A study of object declustering strategies in parallel temporal object database systems

In a transaction-time temporal object database management system (TODBMS), updating an object creates a new version of the object, but the old version is still accessible. A TODBMS will store large amounts of data, and in order to provide the necessary computing power and data bandwidth, a parallel system based on a shared-nothing architecture is necessary. In order to benefit from a parallel architecture, a suitable declustering of the objects over the nodes in the system is important. In this paper, we study three low-cost declustering algorithms: (1) declustering based on the hash value of the OID of the objects, (2) range partitioning based on the timestamp of the objects, and (3) a new hybrid algorithm, where current object versions are declustered according to the hash value of the OID, and the historical versions are range partitioned based on timestamp. In contrast to many similar studies, we study the performance with a workload including both read and update operations. We show that strategies 1 and 3 are the most scalable strategies, and that the new hybrid declustering strategy is especially suitable for low update rates, for example in geographical information systems and decision support systems with support for temporal data. However, in general declustering based on the hash value of the OID of the objects has the most stable and predictable performance.

[1]  Rafael Berlanga Llavori,et al.  A temporal object-oriented model for digital libraries of documents , 2001, Concurr. Comput. Pract. Exp..

[2]  Shahram Ghandeharizadeh,et al.  Object placement in parallel object-oriented database systems , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.

[3]  Amélie Marian,et al.  Change-Centric Management of Versions in an XML Warehouse , 2001, VLDB.

[4]  M. J. Aramburu Cabo,et al.  A temporal object‐oriented model for digital libraries of documents , 2001 .

[5]  Anil Kumar,et al.  Temporal Database Bibliography Update , 1996, SIGMOD Rec..

[6]  Hiroyuki Kitagawa,et al.  Development and Performance Analysis of a Temporal Persistent Object Store POST/C++ , 1996, Australian Database Conference.

[7]  Jennifer Widom,et al.  Representing and querying changes in semistructured data , 1998, Proceedings 14th International Conference on Data Engineering.

[8]  Sushil Jajodia,et al.  Temporal Databases: Research and Practice , 1998 .

[9]  Stanley Y. W. Su,et al.  Parallel query processing strategies for object-oriented temporal databases , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[10]  Michael H. Böhlen,et al.  Temporal database system implementations , 1995, SGMD.

[11]  David J. DeWitt,et al.  Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines , 1990, VLDB.

[12]  Ramez Elmasri,et al.  Declustering techniques for parallelizing temporal access structures , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.

[13]  Sushil Jajodia,et al.  Temporal Database Bibliography Update , 1997, Temporal Databases, Dagstuhl.

[14]  Stanley Y. W. Su,et al.  Implementation and evaluation of parallel query processing algorithms and data partitioning heuristics in object-oriented databases , 2004, Distributed and Parallel Databases.

[15]  Wei Sun.  Proceedings of the fourth international conference on on Parallel and distributed information systems , 1996 .

[16]  Kjetil Nørvåg.  The vagabond temporal OID index: an index structure for OID indexing in temporal object database systems , 2000, Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789).

[17]  Jennifer Widom,et al.  Managing Historical Semistructured Data , 1999, Theory Pract. Object Syst..

[18]  David J. DeWitt,et al.  An Evaluation of Non-Equijoin Algorithms , 1991, VLDB.

[19]  Donovan A. Schneider,et al.  The Gamma Database Machine Project , 1990, IEEE Trans. Knowl. Data Eng..

[20]  Kjetil Nørvåg,et al.  Temporal query operators in XML databases , 2002, SAC '02.

[21]  Richard R. Muntz,et al.  Temporal Query Processing and Optimization in Multiprocessor Database Machines , 1992, VLDB.

[22]  Gerhard Weikum,et al.  LoT: Dynamic Declustering of TSB-Tree Nodes for Parallel Access to Temporal Data , 1996, EDBT.

[23]  Andreas Steiner,et al.  A generalisation approach to temporal data models and their implementations , 1998 .

[24]  Jeffrey F. Naughton,et al.  On the performance of object clustering techniques , 1992, SIGMOD '92.

[25]  Kjetil Nrvag.  Vagabond: The Design and Analysis of a Temporal Object Database Management System , 2000 .

[26]  John L. Pfaltz,et al.  Scalable, parallel, scientific databases , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[27]  Kjetil Nørvåg,et al.  Algorithms for Temporal Query Operators in XML Databases , 2002, EDBT Workshops.