Reverse nearest neighbors search in ad-hoc subspaces

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 76-

  Yiu, Man Lung ^a   Mamoulis, Nikos ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC SUBSPACES; MULTIDIMENSIONAL INDEXES; PROBLEM DIMENSIONS; REVERSE NEAREST NEIGHBORS;

ALGORITHMS; DATA STORAGE EQUIPMENT; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; OBJECT RECOGNITION; PROBLEM SOLVING; SEARCH ENGINES; SET THEORY;

QUERY LANGUAGES;

EID: 33749620348     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.129     Document Type: Conference Paper

References (25)

1. Data Warehousing and OLAP: A Research-Oriented Bibliography. http://www.ondelette.com/OLAP/dwbib.html.
2. Sysbase IQ white papers, http://www.sybase.com.
3. C. C. Aggarwal, C. M. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast Algorithms for Projected Clustering. In SIGMOD, 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. In IDEAS, 2002.
6. K. Beyer, J. Goldstein, R.Ramakrishnan, and U. Shaft. When is "Nearest Neighbor" Meaningful? In ICDT, 1999.
7. P. Boncz and M. Kersten. MIL Primitives for Querying a Fragmented World. VLDB Journal, 8(2): 101-119, 1999.
8. G. Copeland and S. Koshafian. A Decomposition Storage Model. In SIGMOD, 1985.
9. R. Fagin, A. Lotem, and M. Naor. Optimal Aggregation Algorithms for Middleware. In PODS, 2001.
10. G. H. Gessert. Four Valued Logic for Relational Database Systems. SIGMOD Record, 19(1):29-35, 1990.
11. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A Constant Time Collaborative Filtering Algorithm. Information Retrieval, 4(2):133-151, 2001.
12. A. Hinneburg, C. C. Aggarwal, and D. A. Keim. What is the Nearest Neighbor in High Dimensional Spaces? In VLDB, 2000.
13. G. R. Hjaltason and H. Samet. Distance Browsing in Spatial Databases. TODS, 24(2):265-318, 1999.
14. F. Korn and S. Muthukrishnan. Influence Sets Based on Reverse Nearest Neighbor Queries. In SIGMOD, 2000.
15. F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse Nearest Neighbor Aggregates Over Data Streams. In VLDB, 2002.
16. A. Okabe, B. Boots, K. Sugihara, and S. Chiu. Spatial Tessellations : Concepts and Applications of Voronoi Diagrams. Wiley, second edition, 2000.
17. B. C. Ooi, C. H. Goh, and K.-L. Tan. Fast High-Dimensional Data Search in Incomplete Databases. In VLDB, 1998.
18. A. Singh, H. Ferhatosmanoglu, and A. S. Tosun. High Dimensional Reverse Nearest Neighbor Queries. In CIKM, 2003.
19. I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse Nearest Neighbor Queries for Dynamic Databases. In SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000.
20. I. Stanoi, M. Riedewald, D. Agrawal, and A. E. Abbadi. Discovery of Influence Sets in Frequently Updated Databases. In VLDB, 2001.
21. 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. In VLDB, 2005.
22. Y. Tao, D. Papadias, and X. Lian. Reverse kNN Search in Arbitrary Dimensionality. In VLDB, 2004.
23. C. Yang and K. I. Lin. An Index Structure for Efficient Reverse Nearest Neighbor Queries. In ICDE, 2001.
24. M. L. Yiu, D. Papadias, N. Mamoulis, and Y. Tao. Reverse Nearest Neighbors in Large Graphs. In ICDE, 2005.
25. J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. Lee. Location-based Spatial Queries. In SIGMOD, 2003.