Skip to main content
SpringerLink
Log in

Global B+ Tree Indexing in Parallel Database Systems

  • Conference paper
Intelligent Data Engineering and Automated Learning (IDEAL 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2690))

Abstract

In this paper, we propose a global B+ indexing tree structure for parallel database systems, where the index tree is partitioned into multi processors with a possible overlap. We also present algorithms for maintenance of global B+ indexing trees (e.g. insertion and deletion of nodes), and describe operation algorithms (e.g. search and join) on tables that are indexed using global B+ indexing trees.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bayer, R., McCreight, E.M.: Organization and Maintenance of Large Ordered Indices. Acta lnformatica 1(3), 173–189 (1972)

    Article  Google Scholar 

  2. Comer, D.: The Ubiquitous B-Trees. ACM Computing Surveys 11(2), 121–137 (1979)

    Article  MATH  Google Scholar 

  3. Rahayu, J.W., Taniar, D.: Parallel Selection Query Processing Involving Index in Parallel Database Systems. In: Proceedings of I-SPAN 2002 Symposium, pp. 309–314. IEEE CS, Los Alamitos (2002)

    Google Scholar 

  4. Taniar, D., Rahayu, J.W.: A Taxonomy of Indexing Schemes for Parallel Database Systems. Distributed and Parallel Databases 12(1), 73–106 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Taniar, D., Rahayu, J.W.: Parallel Join Query Algorithms Involving Index. Parallel and Distributed Computing Applications and Technologies, 133–140 (2000)

    Google Scholar 

  6. Wolf, J.L., Dias, D.M., Yu, P.S.: A parallel sort-merge join algorithm for managing data skew. IEEE Transactions On Parallel And Distributed Systems 4(1) (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business Systems, Monash University, Vic, 3800, Australia

    David Taniar

  2. Department of Computer Science and Engineering, La Trobe University, Australia

    J. Wenny Rahayu

Authors
  1. David Taniar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Wenny Rahayu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  2. Department of Computer Science, Hong Kong Baptist University, Hong Kong

    Yiu-ming Cheung

  3. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Taniar, D., Rahayu, J.W. (2003). Global B+ Tree Indexing in Parallel Database Systems. In: Liu, J., Cheung, Ym., Yin, H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45080-1_94

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45080-1_94

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40550-4

  • Online ISBN: 978-3-540-45080-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation