Abstract The problem of building a large location table for physics objects occurs within a number of planned physics data management systems, like those that control reclustering and wide-area replication. To satisfy their efficiency goals, these systems have to make local or remote replicas of individual physics objects, which contain raw or reconstructed data for a single event, rather than replicas of large run or n -tuple files. This replication implies the use of a table to resolve the logical, location independent object descriptor into a physical location where an object replica can be found. For modern physics experiments the table needs to scale to at least some 10 10 objects. We argue that such a table can be efficiently implemented by limiting the freedom of lookup operations, and by exploiting some specific properties of the physics data model. One specific viable implementation is discussed.
[1]
Robert Sedgewick,et al.
Algorithms in C
,
1990
.
[2]
Koen Holtman,et al.
Scalability to Hundreds of Clients in HEP Object Databases
,
1998
.
[3]
Koen Holtman,et al.
A cache filtering optimisation for queries to massive datasets on tertiary storage
,
1999,
DOLAP '99.
[4]
T. Grossman,et al.
Computational Experience with Approximation Algorithms for the Set Covering Problem
,
1994
.
[5]
Donald Kossmann,et al.
A Performance Evaluation of OID Mapping Techniques
,
1995,
VLDB.
[6]
Koen Holtman,et al.
Automatic reclustering of objects in very large databases for high energy physics
,
1998,
Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).