BR-Tree: A scalable prototype for supporting multiple queries of multidimensional data

Yu Hua, Bin Xiao, Jianping Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

18 Citations (Scopus)

Abstract

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 ({\le}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.
Original languageEnglish
Article number5184804
Pages (from-to)1585-1598
Number of pages14
JournalIEEE Transactions on Computers
Volume58
Issue number12
DOIs
Publication statusPublished - 1 Dec 2009

Keywords

  • Bound query.
  • BR-tree
  • Cover query
  • Multidimensional data
  • Point query
  • Range query

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this