Reverse furthest neighbors in spatial databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 664-675

  Yao, Bin ^a   Li, Feifei ^a   Kumar, Piyush ^a  

^a Florida State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTION SITES; CONVEX HULL; DATA SETS; NOVEL ALGORITHM; POTENTIAL SITES; QUERY POINTS; REVERSE NEAREST NEIGHBORS; SPATIAL DATABASE; SYNTHETIC AND REAL DATA; TREE-BASED ALGORITHMS; VORONOI DIAGRAMS;

CHEMICAL PLANTS; DECISION TREES; MONOCHROMATORS;

SET THEORY;

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

References (36)

1. E. Achtert, C. Böhm, P. Kroger, P. Kunath, A. Pryakhin, and M. Renz, "Efficient reverse k-nearest neighbor search in arbitrary metric spaces," in SIGMOD, 2006.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu, "An optimal algorithm for approximate nearest neighbor searching in fixed dimensions," Journal of ACM, vol. 45, no. 6, pp. 891-923, 1998.
3. F. Aurenhammer, "Voronoi diagrams - a survey of a fundamental geometric data structure," ACM Computing Survey, vol. 23, no. 3, pp. 345-405, 1991.
4. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: an efficient and robust access method for points and rectangles," in SIGMOD, 1990.
5. R. Benetis, C. S. Jensen, G. Karciauskas, and S. Ŝaltenis, "Nearest and reverse nearest neighbor queries for moving objects," The VLDB Journal, vol. 15, no. 3, pp. 229-249, 2006.
6. S. Berchtold, C. Böhm, D. A. Keim, and H. P. Kriegel, "A cost model for nearest neighbor search in high-dimensional data space," in PODS, 1997.
7. M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf, Computational geometry: Algorithms and applications. Springer, 1997.
8. C. Böhm, "A cost model for query processing in high dimensional data spaces," ACM Transaction on Database Systems, vol. 25, no. 2, pp. 129-178, 2000.
9. C. Böhm and H.-P. Kriegel, "Determining the convex hull in large multidimensional databases," in DaWaK, 2001.
10. S. Cabello, J. M. Diaz-Banez, S. Langerman, C. Seara, and I. Ventura, "Reverse facility location problems," European Journal of Operational Research, vol. to appear, 2008.
11. Chvatal and Vasek, Linear Programming, ser. A Series of Books in the Mathematical Sciences. New York: W. H. Freeman and Company, 1983.
12. B. Cui, B. C. Ooi, J. Su, and K.-L. Tan, "Contorting high dimensional data for efficient main memory kNN processing," in SIGMOD, 2003.
13. E. D. Demaine and M. Patrascu, "Tight bounds for dynamic convex hull queries (again)," in SoCG, 2007.
14. K. Deng, X. Zhou, H. T. Shen, K. Xu, and X. Lin, "Surface k-NN query processing," in ICDE, 2006.
15. S. P. Fekete and A. Kroller, "Geometry-based reasoning for a large sensor network," in SoCG, 2006.
16. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter, "Externalmemory computational geometry," in FOCS, 1993.
17. A. Guttman, "R-trees: a dynamic index structure for spatial searching," in SIGMOD, 1984.
18. G. R. Hjaltason and H. Samet, "Distance browsing in spatial databases," ACM Trans. Database Syst., vol. 24, no. 2, 1999.
19. +-tree based indexing method for nearest neighbor search," ACM Trans. Database Syst., vol. 30, no. 2, pp. 364-397, 2005.
20. J. M. Kang, M. F. Mokbel, S. Shekhar, T. Xia, and D. Zhang, "Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors," in ICDE, 2007.
21. M. R. Kolahdouzan and C. Shahabi, "Voronoi-based k nearest neighbor search for spatial network databases," in VLDB, 2004.
22. F. Korn and S. Muthukrishnan, "Influence sets based on reverse nearest neighbor queries," in SIGMOD, 2000.
23. F. Korn, S. Muthukrishnan, and D. Srivastava, "Reverse nearest neighbor aggregates over data streams," in VLDB, 2002.
24. K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis, "Continuous nearest neighbor monitoring in road networks," in VLDB, 2006.
25. N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest neighbor queries," in SIGMOD, 1995.
26. A. Singh, H. Ferhatosmanoglu, and A. Tosun, "High dimensional reverse nearest neighbor queries," in CIKM, 2003.
27. I. Stanoi, M. Riedewald, D. Agrawal, and A. E. Abbadi, "Discovery of influence sets in frequently updated databases," in VLDB, 2001.
28. Y. Tao, D. Papadias, and X. Lian, "Reverse kNN search in arbitrary dimensionality," in VLDB, 2004.
29. Y. Tao, D. Papadias, X. Lian, and X. Xiao, "Multidimensional reverse kNN search," The VLDB Journal, vol. 16, no. 3, pp. 293-316, 2007.
30. Y. Tao, D. Papadias, and Q. Shen, "Continuous nearest neighbor search," in VLDB, 2002.
31. T. Xia and D. Zhang, "Continuous reverse nearest neighbor," in ICDE, 2006.
32. X. Xiong, M. F. Mokbel, and W. G. Aref, "SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases," in ICDE, 2005.
33. C. Yang and K.-I. Lin, "An index structure for efficient reverse nearest neighbor queries," in ICDE, 2001.
34. M. L. Yiu and N. Mamoulis, "Reverse nearest neighbors search in ad hoc subspaces," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 3, pp. 412-426, 2007.
35. M. L. Yiu, D. Papadias, N. Mamoulis, and Y. Tao, "Reverse nearest neighbors in large graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 4, pp. 540-553, 2006.
36. H. Yu, P. K. Agarwal, R. Poreddy, and K. R. Varadarajan, "Practical methods for shape fitting and kinetic data structures using core sets," in SoCG, 2004.