ACM Home Page
Please provide us with feedback. Feedback
Energy efficient exact kNN search in wireless broadcast environments
Full text PdfPdf (254 KB)
Source Geographic Information Systems archive
Proceedings of the 12th annual ACM international workshop on Geographic information systems table of contents
Washington DC, USA
SESSION: Mobile computing table of contents
Pages: 137 - 146  
Year of Publication: 2004
ISBN:1-58113-979-9
Authors
Bugra Gedik  Georgia Institute of Tech.
Aameek Singh  Georgia Institute of Tech.
Ling Liu  Georgia Institute of Tech.
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 43,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1032222.1032244
What is a DOI?

ABSTRACT

The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies like GPS, this opens up an exciting domain of location based services, allowing a mobile user to query for objects based on its current position. Main bottlenecks in such infrastructures are the draining of power of the mobile devices and the limited network bandwidth available. To alleviate these problems, <i>broadcasting</i> spatial information about relevant objects has been widely accepted as an efficient mechanism. An important class of queries for such an infrastructure is the <i>k</i>-nearest neighbor (<i>k</i>NN) queries, in which users are interested in <i>k</i> closest objects to their position. In this paper, we describe mechanisms to perform <i>exact</i> <i>k</i>NN search on conventional sequential-access R-trees, and optimize established <i>k</i>NN search algorithms. We also propose a novel use of histograms for guiding the search and derive analytical results on maximum queue size and node access count. In addition, we discuss the effects of different broadcast organizations on search performance and challenge the traditional use of Depth-First (<i>dfs</i>) organization. We also extend our mechanisms to support <i>k</i>NN search with non-spatial constraints. While we demonstrate our ideas using a broadcast index, they are equally applicable to any kind of sequential access medium like tertiary tape storage. We validate our mechanisms through an extensive experimental analysis and present our findings.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
City locations data set. http://www.rtreeportal.org/, October 2003.
2
 
3
4
 
5
6
7
8
 
9
 
10
11
12
 
13
T. Imielinski, S. Viswanathan, and B. Badrinath. Energy efficient indexing on air. In ICDE, 1994.
14
 
15
 
16
M. L. Lee, W. Hsu, C. S. Jensen, B. Cui, and K. L. Teo. Supporting frequent updates in R-trees: A bottom-up approach. In VLDB, 2003.
 
17
M. Muralikrishna and D. DeWitt. Equi-depth histograms for estimating selectivity factors for multidimensional queries. In SIGMOD, 1988.
 
18
 
19
20
21
22
23
24
 
25
 
26
N. Shivakumar and S. Venkatasubramanian. Energy-efficient indexing for information dissemination in wireless systems. Journal of Mobile Networks and Nomadic Applications, December 1996.
 
27
 
28
J. Xu, B. Zheng, W. Lee, and D. Lee. Energy efficient index for querying location-dependent data in mobile broadcast environments. In ICDE, 2003.
 
29
 
30


Collaborative Colleagues:
Bugra Gedik: colleagues
Aameek Singh: colleagues
Ling Liu: colleagues