Abstract
In this paper, we consider the problem of exploiting I/O parallelism for efficient access to transaction-time temporal databases. As temporal databases maintain historical versions of records in addition to current ones, we consider range queries in both time dimension and key dimension. Multiple disks can be used to read sets of disk blocks in parallel, thereby improving the performance of such queries substantially.
The problem is to find an optimal declustering algorithm for spreading record versions across disks. The solution depends on the index structure used. We have adopted the time split B-tree, as it provides efficient support for time range and key range queries. Our declustering method coined LoT (Local Balancing for TSB-trees) aims to decluster runs of logically consecutive leaf nodes of a TSB-tree onto separate disks. The method is dynamic in the sense that it computes the disk address of a new node at its creation time, based on the disk addresses of the nodes in its neighborhood.
LoT is an extension of the local balancing algorithm presented in [SL91]. It considers different sets of disks for historical and current nodes, and uses a two-dimensional distance metric between TSB-tree leaf nodes. As historical nodes of TSB-trees are no longer subject to splits, the coordinates of new nodes in the time-key space are restricted. This is exploited in LoT for achieving good declustering for both time range and key range queries. We derive performance guarantees for LoT in terms of the speedup for range queries. Simulation results show the response time speedup of LoT compared to a scheme that assigns nodes to disks in a random manner.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abdel-Ghaffar, K., El Abbadi, A.: Optimal disk allocation for partial match queries, ACM TODS, Vol. 18 No. 1, 1993
Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H., Patterson, D.A., RAID: High-Performance, Reliable Secondary Storage, ACM Computing Surveys Vol.26 No.2,1994
De Witt, D.J., Gray, J.: Parallel Database Systems: The Future of High Performance Database Systems, Communications of the ACM Vol. 35 No.6, 1992, pp. 85–98
Du, H.C., Sobolewski, J.S., Disk Allocation for Cartesian Product Files on Multiple Disk Systems, ACM Transactions on Database Systems Vol. 7 No. 1, 1982, pp. 82–101
Elmasri, R., Wuu, G.T.J., Kouramajian, V.: The Time Index and the Monotonic B+-tree, in: [Tan93]
Faloutsos, C., Bhagwat, P., Declustering Using Fractals, 2nd International Conference on Parallel and Distributed Information Systems, San Diego, 1993
Faloutsos, C., Metaxas, D., Disk Allocation Methods Using Error Correcting Codes, IEEE Transactions on Computers Vol. 40 No.8, 1991, pp. 907–914
Ghandeharizadeh, S., DeWitt, D.J.: MAGIC.: A Multiattribute Declustering Mechanism for Multiprocessor Database Machines, IEEE Transactions on Parallel and Distributed Systems Vol. 5 No.5, 1994, pp. 509–524
Hua, K., Lee, C., Young, H.C.: Data Partitioning for Multicomputer Database Systems: A Cell-Based Approach, Information Systems Vol. 18 No.5, 1993, pp. 329–342
Himatsingka, B., Srivastava, J.: Performance Evaluation of Grid Based Multi-Attribute Record Declustering Methods, 10th IEEE International Conference on Data Engineering, Houston, 1994
Kouramajian, V, Elmasri, R., Chaudry, A.: Declustering Techniques for Parallelizing Temporal Access Structures, Proc. Data Engineering, 1994
Kamel, I., Faloutsos, C.: Parallel R-trees, Proc. SIGMOD, 1992
Kim, M.H., Pramanik, S., Optimal File Distribution for Partial Match Queries, ACM SIGMOD International Conference on Management of Data, Chicago, 1988
Kolovson, C.P.: Indexing Techniques for Historical Databases, in [Tan93]
Lomet, D., Salzberg, B.: Access Methods for Multiversion Data, Proc. SIGMOD, 1989
Lomet, D., Salzberg, B.: The Performance of a Multiversion Access Method, Proc. SIGMOD, 1990
Lomet, D., Salzberg, B.: Transaction-Time Databases, in: [Tan93]
Li, J., Srivastava, J., Rotem, D.: CMD: A multidimensional declustering method for parallel database systems. Proc. VLDB, 1992
Matsliach, G., Shmueli, O.: A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments, IEEE Transactions on Knowledge and Data Engineering Vol. 6 No.3, 1994, pp. 479–496
Mohan, C., Pirahesh, H., Tang, W.G., Wang, Y.: Parallelism in Relational Database Management Systems, IBM Systems Journal Vol. 33 No.2, 1994, pp. 349–371
Pramanik, S., Kim, M.H.: Parallel Precessing of Large Node B-trees, IEEE Transactions on Computers, Vol. 39, 9, 1990
Seeger, B., Larson, P.A.: Multi-Disk B-trees, Proc. SIGMOD, 1991
Srivastava, J., Niccum, T.M., Himatsingka, B., Data Declustering in PADMA: A PArallel Database MAnager, Bulletin of the IEEE TC on Data Engineering Vol. 17 No.3, September 1994
B. Salzberg, V.J. Tsotras, A Comparison of Access Methods for Time Evolving Data, Technical Report NU-CCS-94-21, Northeastern University, Boston, 1994
Scheuermann, P., Weikum, G., Zabback, P., “Disk Cooling” in Parallel Disk Systems, Bulletin of the IEEE TC on Data Engineering Vol.17 No.3 September 1994
Tansel et al.: Temporal Databases, Benjamin Cummings Publishing, 1993
Zhou, Y, Shekhar, S., Coyle, M.: Disk Allocation Methods for Parallelizing Grid Files, 10th IEEE International Conference on Data Engineering, Houston, 1994
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muth, P., Kraiß, A., Weikum, G. (1996). LoT: Dynamic declustering of TSB-tree nodes for parallel access to temporal data. In: Apers, P., Bouzeghoub, M., Gardarin, G. (eds) Advances in Database Technology — EDBT '96. EDBT 1996. Lecture Notes in Computer Science, vol 1057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014178
Download citation
DOI: https://doi.org/10.1007/BFb0014178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61057-1
Online ISBN: 978-3-540-49943-5
eBook Packages: Springer Book Archive