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. © Springer-Verlag 2003.
Cite
CITATION STYLE
Taniar, D., & Wenny Rahayu, J. (2004). Global B+ tree indexing in parallel database systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2690, 701–708. https://doi.org/10.1007/978-3-540-45080-1_94
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
