期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2016
卷号：9
期号：2
页码：1-16
DOI：10.14257/ijgdc.2016.9.2.01
出版社：SERSC
摘要：For the performance and maintenance cost of the existing index methods, this paper presents a distributed multi access entrance B+ tree index method, which has some features that are important in practice, namely (1) achieve efficient parallel interval queries, and (2) and low maintenance cost for index structure. Our scheme relies on four key techniques to achieve efficient parallel interval queries and low maintenance cost for index structure: (1) It gives a routing table to each leaf node of distributed B+ tree, so as to interval search can be completed from any leaf node of any storage node and break through the Bottleneck caused by the root node in the distributed B+ tree; (2) It construction of balanced binary tree in different levels of a node, and choose select the relevant nodes for its routing table; (3) It uses the layer-by-layer transitivity of B+ tree node splitting information to sense node split position so as to only update routing information within subtree of corresponding particle at the time of node splitting; (4) it uses balanced structure of B+ trees to realize only update the single route information of relevant nodes at the time of node splitting, without adjusting the route tables in a large area. Our scheme has been implemented and evaluated, and the performance results are encouraging.
