Abstract
In this paper, we propose a global B + indexing tree structure for parallel database systems. A global B + indexing tree is a tree structure used for indexing where the complete index tree is partially partitioned into multi-processors but the overall structure of global index is still maintained. 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
