Proceedings of the sixteenth international conference on Very large databases
On the performance of object clustering techniques
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Temporal database system implementations
ACM SIGMOD Record
Distributed and Parallel Databases
Managing historical semistructured data
Theory and Practice of Object Systems
Parallel query processing strategies for object-oriented temporal databases
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Temporal query operators in XML databases
Proceedings of the 2002 ACM symposium on Applied computing
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
LoT: Dynamic Declustering of TSB-Tree Nodes for Parallel Access to Temporal Data
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Representing and Querying Changes in Semistructured Data
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Object Placement in Parallel Object-Oriented Database Systems
Proceedings of the Tenth International Conference on Data Engineering
Declustering Techniques for Parallelizing Temporal Access Structures
Proceedings of the Tenth International Conference on Data Engineering
Change-Centric Management of Versions in an XML Warehouse
Proceedings of the 27th International Conference on Very Large Data Bases
An Evaluation of Non-Equijoin Algorithms
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Temporal Query Processing and Optimization in Multiprocessor Database Machines
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Algorithms for Temporal Query Operators in XML Databases
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
IDEAS '00 Proceedings of the 2000 International Symposium on Database Engineering & Applications
Scalable, Parallel, Scientific Databases
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Toward boosting distributed association rule mining by data de-clustering
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.