Group nearest neighbor queries

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 301-312

  Papadias, Dimitris ^a   Shen, Qiongmao ^a   Tao, Yufei ^b   Mouratidis, Kyriakos ^a  

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

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; DATABASE SYSTEMS; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; PROBLEM SOLVING; TREES (MATHEMATICS);

INDEXING TECHNIQUES; NEAREST NEIGHBOUR (NN) SEARCH; QUERY PROPERTIES; QUERY RETRIEVAL;

QUERY LANGUAGES;

EID: 2442483624     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. [AMN+98] Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A. An Optimal Algorithm for Approximate Nearest Neighbor Searching, Journal of the ACM, 45(6): 891-923, 1998.
2. [AY01] Aggrawal, C., Yu, P. Outlier Detection for High Dimensional Data. SIGMOD, 2001.
3. [B00] Bohm, C. A Cost Model for Query Processing in High Dimensional Data Spaces. TODS, Vol. 25(2): 129-178, 2000.
4. [BCG02] Bruno, N., Chaudhuri, S., Gravano, L. Top-k Selection Queries over Relational Databases: Mapping Strategies and Performance Evaluation. TODS 27(2): 153-187, 2002.
5. [BGRS99] Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U. When Is Nearest Neighbor Meaningful? ICDT, 1999.
6. [BJKS02] Benetis, R., Jensen, C., Karciauskas, G., Saltenis, S. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. IDEAS, 2002.
7. [BKSS90] Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD, 1990.
8. [CMTV00] Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M. Closest Pair Queries in Spatial Databases. SIGMOD, 2000.
9. [F02] Fagin, R. Combining Fuzzy Information: an Overview. SIGMOD Record, 31 (2): 109-118, 2002.
10. [FLN01] Fagin, R., Lotem, A., Naor, M. Optimal Aggregation Algorithms for Middleware. PODS, 2001.
11. [FSAA01] Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A. Constrained Nearest Neighbor Queries. SSTD, 2001.
12. [G84] Guttman, A. R-trees: A Dynamic Index Structure for Spatial Searching. SIGMOD, 1984.
13. [JMF99] Jain, A., Murthy, M., Flynn, P., Data Clustering: A Review. ACM Comp. Surveys, 31(3): 264-323, 1999.
14. [HS98] Hjaltason, G., Samet, H. Incremental Distance Join Algorithms for Spatial Databases. SIGMOD, 1998.
15. [HS99] Hjaltason, G., Samet, H. Distance Browsing in Spatial Databases. TODS, 24(2), 265-318, 1999.
16. [HYC01] Hochreiter, S., Younger, A.S., Conwell, P. Learning to Learn Using Gradient Descent. ICANN, 2001.
17. [KGT99] Kollios, G., Gunopulos, D., Tsotras, V. Nearest Neighbor Queries in Mobile Environment. STDBM, 1999.
18. [KM00] Korn, F., Muthukrishnan, S. Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD, 2000.
19. [KMS02] Korn, F., Muthukrishnan, S. Srivastava, D. Reverse Nearest Neighbor Aggregates Over Data Streams. VLDB, 2002.
20. [NO97] Nakano, K., Olariu, S. An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications. IEEE Trans. on Parallel and Distributed Systems 8(9): 983-990, 1997.
21. [PM97] Papadopoulos, A., Manolopoulos, Y. Performance of Nearest Neighbor Queries in R-trees. ICDT, 1997.
22. [PZMT03] Papadias, D., Zhang, J., Mamoulis, N., Tao, Y. Query Processing in Spatial Network Databases. VLDB, 2003.
23. [RKV95] Roussopoulos, N., Kelly, S., Vincent, F. Nearest Neighbor Queries. SIGMOD, 1995.
24. [S91] Sproull, R. Refinements to Nearest Neighbor Searching in K-Dimensional Trees. Algorithmica, 6(4): 579-589, 1991.
25. [SKS02] Shahabi, C., Kolahdouzan, M., Sharifzadeh, M. A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases. ACM GIS, 2002.
26. [SR01] Song, Z., Roussopoulos, N. K-Nearest Neighbor Search for Moving Query Point. SSTD, 2001.
27. [SYUK00] Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H. The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation. VLDB, 2000.
28. [TP02] Tao, Y., Papadias, D. Time Parameterized Queries in Spatio-Temporal Databases. SIGMOD, 2002.
29. [TP03] Tao, Y., Papadias, D. Spatial Queries in Dynamic Environments. ACM TODS, 28(2): 101-139, 2003.
30. [TPS02] Tao, Y., Papadias, D., Shen, Q. Continuous Nearest Neighbor Search. VLDB, 2002.
31. [Web1] www.maproom.psu.edu/dcw/
32. [Web2] dke.cti.gr/People/ytheod/research/datasets/
33. [WSB98] Weber, R., Schek, H.J., Blott, S. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. VLDB, 1998.
34. [YOTJ01] Yu, C., Ooi, B, Tan, K., Jagadish, H. Indexing the Distance: An Efficient Method to KNN Processing. VLDB, 2001.