BR-Tree: A Scalable Prototype for Supporting Multiple Queries of Multidimensional Data


Multidimensional data indexing has received much research attention recently in a centralized system. However, it remains a nascent area of research in providing an integrated structure for multiple queries on multidimensional data in a distributed environment. In this paper, we propose a new data structure, called BR-tree (Bloom-filter-based R-tree), and implement such a prototype in the context of a distributed system. The node in a BR-tree, viewed as an expansion from the traditional R-tree node structure, incorporates space-efficient Bloom filters to facilitate fast membership queries. The proposed BR-tree can simultaneously support not only existing point and range queries, but also cover and bound queries that can potentially benefit various data indexing services. Compared with previous data structures, BR-tree achieves space efficiency and provides quick response ( Oðlog nÞ) on these four types of queries. Our extensive experiments in a distributed environment further validate the practicality and efficiency of the proposed BR-tree structure.

DOI: 10.1109/TC.2009.97

Extracted Key Phrases

23 Figures and Tables

Cite this paper

@article{Hua2009BRTreeAS, title={BR-Tree: A Scalable Prototype for Supporting Multiple Queries of Multidimensional Data}, author={Yu Hua and Bin Xiao and Jianping Wang}, journal={IEEE Trans. Computers}, year={2009}, volume={58}, pages={1585-1598} }