Energy-Conserving Air Indexes for Nearest Neighbor Search
A location-based service (LBS) provides information based on the location information specified in a query. Nearest-neighbor (NN) search is an important class of queries supported in LBSs. This paper studies energy-conserving air indexes for NN search in a wireless broadcast environment. Linear access requirement of wireless broadcast weakens the performance of existing search algorithms designed for traditional spatial database. In this paper, we propose a new energy-conserving index, called grid-partition index, which enables a single linear scan of the index for any NN queries. The idea is to partition the search space for NN queries into grid cells and index all the objects that are potential nearest neighbors of a query point in each grid cell. Three grid partition schemes are proposed for the grid-partition index. Performance of the proposed grid-partition indexes and two representative traditional indexes (enhanced for wireless broadcast) is evaluated using both synthetic and real data. The result shows that the grid-partition index substantially outperforms the traditional indexes.
Keywordsmobile computing location-based services energy-conserving index nearest-neighbor search wireless broadcast
Unable to display preview. Download preview PDF.
- 2.Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. ch. 7. Springer, New York (1996)Google Scholar
- 3.Chen, M.-S., Wu, K.-L., Yu, S.: Optimizing index allocation for sequential data broadcasting in wireless mobile computing. IEEE Transactions on Knowledge and Data Engineering (TKDE) 15(1) (2003)Google Scholar
- 5.Microsoft Corporation. What is the directband network? (2003), URL at http://www.microsoft.com/resources/spot/direct.mspx
- 6.Spatial Datasets, Website at http://dias.cti.gr/~ytheod/research/datasets/spatial.html
- 7.Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 1984), pp. 47–54 (1984)Google Scholar
- 8.Imielinski, T., Viswanathan, S., Badrinath, B.R.: Data on air - organization and access. IEEE Transactions on Knowledge and Data Engineering (TKDE) 9(3) (May-June 1997)Google Scholar
- 10.Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: Str: A simple and efficient algorithm for r-tree packing. In: Proceedings of the 13th International Conference on Data Engineering (ICDE 1997), Birmingham, UK, April 1997, pp. 497–506 (1997)Google Scholar
- 11.Lo, S.-C., Chen, L.P.: Optimal index and data allocation in multiple broadcast channels. In: Proceedings of the Sixteenth International Conference on Data Engineering (ICDE 2000) (February 2000)Google Scholar
- 13.Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 1995), May 1995, pp. 71–79 (1995)Google Scholar
- 14.Computer Science and Telecommunications Board. IT Roadmap to a Geospatial Future. The National Academies Press (2003)Google Scholar
- 15.Xu, J., Zheng, B., Lee, W.-C., Lee, D.L.: Energy efficient index for querying location-dependent data in mobile broadcast environments. In: Proceedings of the 19th IEEE International Conference on Data Engineering (ICDE 2003), Bangalore, India, March 2003, pp. 239–250 (2003)Google Scholar