Skip to main content
Log in

A Taxonomy of Indexing Schemes for Parallel Database Systems

Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

In this paper, we present a taxonomy of indexing schemes in parallel database systems. Index partitioning is not recognized widely as yet. One of the reasons is that most of index structures are trees, not flat structures like tables, and consequently, index partitioning imposes some degree of complexity compared with common data partitioning for tables. We present three parallel indexing schemes, and discuss their maintenance strategies. We also analyze their storage requirements.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. R. Bayer and E.M. McCreight, “Organization and maintenance of large ordered indices,” Acta Informatica, vol. 1, no.3, pp. 173–189, 1972.

    Google Scholar 

  2. R. Bayer and M. Schkolnick, “Concurrency of operations on B-trees,” Acta Informatica, vol. 9, pp.1–21, 1977.

    Google Scholar 

  3. B. Bergsten, M. Couprie, and P. Valduriez, “Overview of parallel architecture for databases,” The Computer Journal, vol. 36, no.8, pp. 734–740, 1993.

    Google Scholar 

  4. D. Comer, “The ubiquitous B-Trees,” ACM Computing Surveys, vol. 11, no.2, pp. 121–137, 1979.

    Google Scholar 

  5. D.J. DeWitt and J. Gray, “Parallel database systems: The future of high performance database systems,” Communication of the ACM, vol. 35, no.6, pp. 85–98, 1992.

    Google Scholar 

  6. C. Ellis, “Concurrent search and inserts in 2-3 trees,” Acta Informatica, vol. 14, pp. 63–86, 1980.

    Google Scholar 

  7. R. Elmasri and S.B. Navathe, Fundamental of Database Systems, 2nd edn., The Benjamin/Cummings Publishing Company, 1994.

  8. S. Ghandeharizadeh and D. DeWitt, “Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines,” in Proceedings of the 16th VLDB Conference, Brisbane, 1990, pp. 481–492.

  9. S. Ghandeharizadeh, et. al., “A performance analysis of alternative multi-attribute declustering strategies,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1992, pp. 29–38.

  10. T. Johnson and A. Colbrook, “A distributed, replicated, data-balanced search structure,” Technical Report, University of Florida, 1993.

  11. Y. Kwong and D. Wood, “A new method for concurrency in B-trees,” IEEE Transactions on Software Engineering, vol. 8, pp. 211–222, 1982.

    Google Scholar 

  12. P. Lehman and S. Yao, “Efficient locking for concurrent operations on B-trees,” ACMTransactions on Database Systems, vol. 6, pp. 650–670, 1981.

    Google Scholar 

  13. J. Liebeherr, E.R. Omiecinski, and I.F. Akyildiz, “The effect of index partitioning schemes on the performance of distributed query processing,” IEEE Transactions on Knowledge and Data Engineering, vol. 5, no.3, pp. 510–522, 1993.

    Google Scholar 

  14. T. Mahapatra and S. Mishra, Oracle Parallel Processing, O'Reilly Publishing Company, 2000.

  15. R. Ramakrishnan, Database Management Systems, New York: McGraw Hill, 1998.

    Google Scholar 

  16. Y. Sagiv, “Concurrent operations on B-trees with overtaking,” Journal of Computer and System Sciences, vol. 33, pp. 275–296, 1986.

    Google Scholar 

  17. D. Shasha and N. Goodman, “Concurrent search structure algorithms,” ACM Transactions on Database Systems, vol. 13, pp. 53–90, 1988.

    Google Scholar 

  18. D. Taniar and J.W. Rahayu, “Parallel join query algorithms involving index,” in Parallel and Distributed Computing Applications and Technologies, C.S. Leung, J. Sum, C.L. Wang, and G.H. Young (Eds.), The University of Hong Kong, 2000, pp. 133–140.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Taniar, D., Rahayu, J.W. A Taxonomy of Indexing Schemes for Parallel Database Systems. Distributed and Parallel Databases 12, 73–106 (2002). https://doi.org/10.1023/A:1015682215394

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1015682215394

Navigation