|
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
|
Swarup Acharya , Rafael Alonso , Michael Franklin , Stanley Zdonik, Broadcast disks: data management for asymmetric communication environments, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.199-210, May 22-25, 1995, San Jose, California, United States
|
| |
3
|
|
 |
4
|
Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States
|
| |
5
|
|
 |
6
|
Keith Cheverst , Nigel Davies , Keith Mitchell , Adrian Friday, Experiences of developing and deploying a context-aware tourist guide: the GUIDE project, Proceedings of the 6th annual international conference on Mobile computing and networking, p.20-31, August 06-11, 2000, Boston, Massachusetts, United States
[doi> 10.1145/345910.345916]
|
 |
7
|
Christos Faloutsos , Timos Sellis , Nick Roussopoulos, Analysis of object oriented spatial access methods, Proceedings of the 1987 ACM SIGMOD international conference on Management of data, p.426-439, May 27-29, 1987, San Francisco, California, United States
|
 |
8
|
|
| |
9
|
|
| |
10
|
|
 |
11
|
Jason Hill , Robert Szewczyk , Alec Woo , Seth Hollar , David Culler , Kristofer Pister, System architecture directions for networked sensors, Proceedings of the ninth international conference on Architectural support for programming languages and operating systems, p.93-104, November 2000, Cambridge, Massachusetts, United States
|
 |
12
|
Qinglong Hu , Dik Lun Lee , Wang-Chien Lee, Performance evaluation of a wireless hierarchical data dissemination system, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.163-173, August 15-19, 1999, Seattle, Washington, United States
[doi> 10.1145/313451.313528]
|
| |
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
|
Viswanath Poosala , Peter J. Haas , Yannis E. Ioannidis , Eugene J. Shekita, Improved histograms for selectivity estimation of range predicates, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.294-305, June 04-06, 1996, Montreal, Quebec, Canada
|
 |
21
|
|
 |
22
|
Nick Roussopoulos , Stephen Kelley , Frédéric Vincent, Nearest neighbor queries, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.71-79, May 22-25, 1995, San Jose, California, United States
|
 |
23
|
Simonas Šaltenis , Christian S. Jensen , Scott T. Leutenegger , Mario A. Lopez, Indexing the positions of continuously moving objects, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.331-342, May 15-18, 2000, Dallas, Texas, United States
|
 |
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
|
|
|