Global B{sup}+ Tree Indexing in Parallel Database Systems

摘要

In this paper, we propose a global B{sup}+ 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{sup}+ 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{sup}+ indexing trees.