Grid-partition index: A hybrid method for nearest-neighbor queries in wireless location-based services

VLDB Journal

Volumn 15, Issue 1, 2006, Pages 21-39

  Zheng, Baihua ^a   Xu, Jianliang ^b   Lee, Wang Chien ^c   Lee, Dik Lun ^d  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

^d HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Continuous nearest neighbor search; Index structure; Location dependent data; Nearest neighbor search; Wireless broadcast

Indexed keywords

EID: 33745306642     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-004-0146-0     Document Type: Article

References (28)

1. Berehtold, S., Keim, D.A., Kriegel, H.P., Seidl, T.: Indexing the solution space: a new technique for nearest neighbor search in high-dimensional space. IEEE Trans. Knowl. Data Eng. 12(1), 45-57 (2000)
2. Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications Chap. 7. Berlin, Heidelberg, New York: Springer (1996)
3. Cheung, K.L., Fu, W.-C.: Enhanced nearest neighbour search on the r-tree. SIGMOD Rec. 27(3), 16-21 (1998)
4. Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., Abbadi, A.E.: Approximate nearest neighbor searching in multimedia databases. In: Proc. 17th IEEE Int. Conf. on Data Eng. (ICDE'0l) (2001)
5. Goldstein, J., Ramakrishnan, R.: Contrast plots and p-sphere trees: Space, vs. time in nearest neighbor searches. In: Proc. 26th Int. Conf. on Very Large Data Bases (VLDB'00), pp. 429-440, Cairo, Egypt (2000)
6. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on Manage, of Data (SIGMOD'84), pp.47-54 (1984)
7. Hinneburg, A., Aggarwal, C.C., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: Proc. 26th Int. Conf. on Very Large Data Bases (VLDB'00) (2000)
8. Hjaltason, Gí.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database, Syst. 24(2), 265-318 (1999)
9. Hu, Q.L., Lee, W.-C., Lee, D.L.: Power conservative multi-attribute queries on data broadcast. In: Proc. 16th Int. Conf. on Data Eng. (ICDE'00), pp. 157-166. San Diego (2000)
10. Imielinski, T., Viswanathan, S., Badrinath, B.R.: Data on air: organization and access. IEEE Trans. Knowl. Data Eng. 9(3), 353-372 (1997)
11. Kamel, I., Faloutsos, C.: Hubert r-tree: an improved r-tree using fractals. In: Proc. 20th Int. Conf. on Very Large Data Bases (VLDB'94), pp. 500-509. Santiago de Chile, Chile (1994)
12. Lee, D.L., Lee, W.-C., Xu, J., Zheng, B.: Data management in location-dependent information services. IEEE Pervas. Comput. 1(3), 65-72 (2002)
13. Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: Str: a simple and efficient algorithm for r-tree packing. In: Proc. 13th Int. Conf. on Data Eng. (ICDE'97), pp. 497-506. Birmingham, UK (1997)
14. Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: an adaptable, symmetric multikey file structure. ACM Trans. Database. Syst. 9(1), 38-71 (1984)
15. Pramanik, S., Li, J.: Fast approximate search algorithm for nearest neighbor queries in high dimensions. In: Proc. 15th Int. Conf. on Data Eng. (ICDE'99), p. 251 (1999)
16. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proc. 1995 ACM SIGMOD Int. Conf. on Manage, of Data (SIGMOD'95), pp. 71-79 (1995)
17. Computer Science and Telecommunications Board. IT Roadmap to a Geospatial Future. Washington, DC: National Academies Press (2003)
18. Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: Proc. 13th Int. Conf. on Data Eng. (ICDE'97), pp. 422-432. Birmingham, UK (1997)
19. Song. Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Proc. 7th Int. Symp. Spatial Temp. Databases (SSTD'01), pp. 79-96. Los Angeles (2001)
20. Sproull, R.R: Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6(4), 579-589, (1991)
21. Tao, Y., Papadias, D.: Time parameterized queries in spatio-temporal databases. In: Proc. 2002 ACM SIGMOD Int. Conf. on Manage, of Data (SIGMOD'02), pp. 334-345. Madison, WI (2002)
22. Tao,Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proc. 28th Int. Conf. on Very Large Data Bases (VLDB'02), Hong Kong (2002)
23. Weber, R., Blott, S.: An approximation based structure for similarity search. Technical Report 24, ESPRIT Project HERMES (No. 9141) (1997)
24. Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance, study for similarity-search methods in high-dimensional spaces. In: Proc. 24th Int. Conf. on Very Large Data Bases (VLDB'98), pp. 194-205. New York (1998)
25. Wilfong, G.T.: Nearest neighbor problems. In: Symp. on Computat. Geometry, pp. 224-233 (1991)
26. Xu, J., Zheng, B., Lee, W.-C., Lee, D.L.: Energy efficient index for querying location-dependent data in mobile broadcast environments. In: Proc. 19th IEEE Int. Conf. on Data Eng. (ICDE'03), pp. 239-250. Bangalore, India (2003)
27. Yu, C., Ooi, B.C., Tan, K.-L., Jagadish, H.V.: Indexing the distance: an efficient method to KNN processing. Proc. 27th Int. Conf. on Very Large Data Bases (VLDB'0l), pp. 421-430. Rome (2001)
28. Zheng, B., Xu, J., Lee, W.C., Lee, D.L.: Energy-conserving air indexes for nearest neighbor search. In: Proc. 9th Int. Conf. on Extending Database Technol. (EDBT'04). Heraklion, Crete, Greece (2004)