Efficient query execution on broadcasted index tree structures

Authors:
Susanne Hambrusch;Chuan-Ming Liu;Walid G. Aref;Sunil Prabhakar
Affiliations:
Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA;Department of Computer Science and Information Engineering, National Taipei University of Technology, Taipei 106, Taiwan;Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA;Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA
Venue:
Data & Knowledge Engineering
Year:
2007

Citing 21
Cited 2

Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures

The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Energy efficient indexing on air

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An analysis of selective tuning schemes for nonuniform broadcast

Data & Knowledge Engineering
A framework for scalable dissemination-based systems

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
On selective tuning in unreliable wireless channels

Data & Knowledge Engineering
Broadcast scheduling for information distribution

Wireless Networks
Supporting range queries in a wireless environment with nonuniform broadcast

Data & Knowledge Engineering
On indexed data broadcast

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Introduction to Algorithms

Introduction to Algorithms
A complementary approach to data broadcasting in mobile information systems

Data & Knowledge Engineering
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
An Adaptive Access Method for Broadcast Data under an Error-Prone Mobile Environment

IEEE Transactions on Knowledge and Data Engineering
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing

IEEE Transactions on Knowledge and Data Engineering
Query Processing in Broadcasted Spatial Index Trees

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Indexed Sequential Data Broadcasting in Wireless Mobile Computing

ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Spatial queries in wireless broadcast systems

Wireless Networks - Special issue: Pervasive computing and communications

A power-saving protocol for exact GkNN search in wireless broadcast environments

IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Effective protocols for kNN search on broadcast multi-dimensional index trees

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The continuous broadcast of data together with an index structure is an effective way of disseminating data in a wireless mobile environment. The index allows a mobile client to tune in only when relevant data is available on the channel and leads to reduced power consumption for the clients. This paper investigates the execution of queries on broadcasted index trees when query execution corresponds to a partial traversal of the tree. Queries exhibiting this behavior include range queries and nearest neighbor queries. We present two broadcast schedules for index trees and two query algorithms executed by mobile clients. Our solutions simultaneously minimize tuning time and latency and adapt to the client's available memory. Experimental results using real and synthetic data compare results for a broadcast with node repetition to one without node repetition and they show how a priority-based data management can help reduce tuning time and latency.