Reverse nearest neighbors search in ad hoc subspaces

IEEE Transactions on Knowledge and Data Engineering

Volumn 19, Issue 3, 2007, Pages 412-426

  Yiu, Man Lung ^a   Mamoulis, Nikos ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Distributed databases; Query processing; Spatial databases

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA ACQUISITION; DATABASE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

DISTRIBUTED DATABASES; REVERSE NEAREST NEIGHBORS (RNN); SPATIAL DATABASES;

QUERY PROCESSING;

EID: 33847734773     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.47     Document Type: Article

References (32)

1. Data Warehousing and OLAP: A Research-Oriented Bibliography, http://www.ondelette.com/OLAP/dwbib.html, 2006.
2. Sysbase IQ White Papers, http://www.sybase.com, 2006.
3. C.C. Aggarwal, CM Procopiuc, J.L. Wolf, P.S. Yu, and J.S. Park, "Fast Algorithms for Projected Clustering," Proc. 1999 ACM SIGMOD Int'l Conf. Management of Data, 1999.
4. S. Arya and A. Vigneron, "Approximating a Voronoi Cell," HKUST Research Report HKUST-TCSC-2003-10, 2003.
5. R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis, "Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects," Proc. Int'l Database Eng. and Applications Symp., 2002.
6. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When Is 'Nearest Neighbor' Meaningful?," Proc. Int'l Conf. Database Theory (ICDT), 1999.
7. P. Boncz and M Kersten, "MIL Primitives for Querying a Fragmented World," VLDB J., vol. 8, no. 2, pp. 101-119, 1999.
8. N. Bruno, L. Gravano, and A. Marian, "Evaluating Top-k Queries over Web-Accessible Databases," Proc. Int'l Conf. Data Eng., 2002.
9. K.C.-C. Chang and S. Hwang, "Minimal Probing: Supporting Expensive Predicates for Top-k Queries," Proc. ACM SIGMOD Conf., 2002.
10. G. Copeland and S. Koshafian, "A Decomposition Storage Model," Proc. ACM SIGMOD Conf., 1985.
11. R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," Proc. 20th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems, 2001.
12. R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," J. Computer and System Sciences, vol. 66, no. 4, pp. 614-656, 2003.
13. H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A.E. Abbadi, "Constrained Nearest Neighbor Queries," Proc. Int'l Symp. Spatial and Temporal Databases, 2001.
14. G.H. Gessert, "Four Valued Logic for Relational Database Systems," SIGMOD Record, vol. 19, no. 1, pp. 29-35, 1990.
15. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins, "Eigentaste: A Constant Time Collaborative Filtering Algorithm," Information Retrieval, vol. 4, no. 2, pp. 133-151, 2001.
16. U. Güntzer, W.-T. Balke, and W. Kießling, "Towards Efficient Multi-Feature Queries in Heterogeneous Environments," Proc. IEEE Int'l Conf. Information Technology (ITCC), 2001.
17. A. Hinneburg, C.C. Aggarwal, and D.A. Keim, "What Is the Nearest Neighbor in High Dimensional Spaces?" Proc. 26th Int'l Conf. Very Large Data Bases (VLDB), 2000.
18. G.R. Hjaltason and H. Samet, "Distance Browsing in Spatial Databases," ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
19. F. Korn and S. Muthukrishnan, "Influence Sets Based on Reverse Nearest Neighbor Queries," Proc. ACM SIGMOD Conf., 2000.
20. F. Korn, S. Muthukrishnan, and D. Srivastava, "Reverse Nearest Neighbor Aggregates over Data Streams," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2002.
21. G. Luo, J.F. Naughton, C. Ellmann, and M. Watzke, "Toward a Progress Indicator for Database Queries," Proc. ACM SIGMOD Conf., 2004.
22. A. Okabe, B. Boots, K. Sugihara, and S. Chiu, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, second ed. Wiley, 2000.
23. B.C. Ooi, C.H. Goh, and K.-L. Tan, "Fast High-Dimensional Data Search in Incomplete Databases," Proc. Int'l Conf. Very Large Data Bases (VLDB), 1998.
24. A. Singh, H. Ferhatosmanoglu, and A.S. Tosun, "High Dimensional Reverse Nearest Neighbor Queries," Proc. Conf. Information and Knowledge Management (CIKM), 2003.
25. I. Stanoi, D. Agrawal, and A.E. Abbadi, "Reverse Nearest Neighbor Queries for Dynamic Databases," Proc. ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery, 2000.
26. I. Stanoi, M. Riedewald, D. Agrawal, and A.E. Abbadi, "Discovery of Influence Sets in Frequently Updated Databases," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2001.
27. M. Stonebraker, D. Abadi, A. Batkin, X. Chen, M. Cherniak, M. Ferreria, E. Lau, A. Lin, S. Madden, E. O'Neil, P. O'Neil, A. Rasin, N. Tran, and S. Zdonik, "C-Store: A Column-Oriented DBMS," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2005.
28. Y. Tao, D. Papadias, and X. Lian, "Reverse kNN Search in Arbitrary Dimensionality," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
29. C. Yang and K.I. Lin, "An Index Structure for Efficient Reverse Nearest Neighbor Queries," Proc. Int'l Conf. Data Eng. (ICDE), 2001.
30. M.L. Yiu and N. Mamoulis, "Reverse Nearest Neighbors Search in Ad-Hoc Subspaces," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
31. M.L. Yiu, D. Papadias, N. Mamoulis, and Y. Tao, "Reverse Nearest Neighbors in Large Graphs," Proc. Int'l Conf. Data Eng. (ICDE), 2005.
32. J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. Lee, "Location-Based Spatial Queries," Proc. ACM SIGMOD Conf., 2003.