Multidimensional reverse kNN search

VLDB Journal

Volumn 16, Issue 3, 2007, Pages 293-316

  Tao, Yufei ^a   Papadias, Dimitris ^b   Lian, Xiang ^b   Xiao, Xiaokui ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

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

Author keywords

Continuous search; Reverse nearest neighbor; Spatial database

Indexed keywords

EID: 34249107075     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-005-0168-2     Document Type: Article

References (20)

1. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R°tree: An efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322-331 (1990)
2. Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects. In: IDEAS, pp. 44-53 (2002)
3. Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for high-dimensional data. In: VLDB, pp. 28-39 (1996)
4. Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer (2000)
5. Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the R-tree. SIGMOD Record 27(3), 16-21 (1998)
6. Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A.E.: Constrained nearest neighbor queries. In: SSTD, pp. 257-278 (2001)
7. Goldstein, J., Ramakrishnan, R., Shaft, U., Yu, J.-B.: Processing queries by linear constraints. In: PODS, pp. 257-267 (1997)
8. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47-57 (1984)
9. Hjaltason, G.R., Goldstein, H.: Distance browsing in spatial databases. TODS 24(2), 265-318 (1999)
10. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201-212 (2000)
11. Korn, F., Muthukrishnan, S., Srivastava, D.: Reverse nearest neighbor aggregates over data streams. In: VLDB, pp. 814-825 (2002)
12. Lin, K.-I., Nolen, M., Yang, C.: Applying bulk insertion techniques for dynamic reverse nearest neighbor problems. In: IDEAS, pp. 290-297 (2003)
13. Maheshwari, A., Vahrenhold, J., Zeh, N.: On reverse nearest neighbor queries. In: CCCG, pp. 128-132 (2002)
14. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71-79 (1995)
15. Singh, A., Ferhatosmanoglu, H., Tosun, A.S.: High dimensional reverse nearest neighbor queries. In: CIKM, pp. 91-98 (2003)
16. Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD workshop, pp. 744-755 (2000)
17. Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of influence sets in frequently updated databases. In: VLDB, pp. 99-108 (2001)
18. Tao, Y., Papadias, D., Lian, X.: Reverse knn search in arbitrary dimensionality. In: VLDB, pp. 744-755 (2004)
19. Theodoridis, Y. Sellis, T.K.: A model for the prediction of R-tree performance. In: PODS, pp. 161-171 (1996)
20. Yang, C., Lin, K.-I.: An index structure for efficient reverse nearest neighbor queries. In: ICDE, pp. 485-492 (2001)