Efficient query execution on broadcasted index tree structures

Get BibTex-formatted data

Author

S Hambrusch, Chuan-Ming Liu, WG Aref, S Prabhakar

Entry type

article

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.

Date

2007 – 03

Journal

Data & Knowledge Engineering

Key alpha

Aref

Number

Pages

511-529

Volume

Publication Date

2007-03-00

Keywords

Data dissemination; Index tree structures; Latency and tuning time; Query processing; Wireless broadcast

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Article{ Aref,
	title = "Efficient query execution on broadcasted index tree structures",
	author = "S Hambrusch, Chuan-Ming Liu, WG Aref, S Prabhakar",
	year = "2007",
	month = "03",
	journal = "Data & Knowledge Engineering",
	number = "3",
	pages = "511-529",
	volume = "60",
	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.",
	keywords = "Data dissemination; Index tree structures; Latency and tuning time; Query processing; Wireless broadcast",
}