By Topic

Multi-dimensional range query for data management using bloom filters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yu Hua ; Sch. of Comput., Huazhong Univ. of Sci. & Technol., Wuhan ; Dan Feng ; Ting Xie

Providing range query as basic network services has received much research attention recently. Range query can exhibit all items located within a certain range. Previous approaches to represent and query items, such as distributed hash tables (DHT) or R-tree structures, use too much storage space to store and maintain items to achieve exact query results. Corresponding structures cannot effectively support operations on items that have multi-dimensional attributes. In this paper, we propose a simple and space-efficient structure, i.e., multi-dimensional segment bloom filter (MDSBF), to support range query for data management. Our approach logically divides the range of multi-dimensional attributes into several segments to support fast and accurate lookups. We also develop a simple algorithm to achieve load balance among multiple segments and improve query accuracy. Through theoretical analysis and performance evaluation, we demonstrate that the MDSBF structure can efficiently support range query service for items with multi-dimensional attributes.

Published in:

Cluster Computing, 2007 IEEE International Conference on

Date of Conference:

17-20 Sept. 2007