Efficient method for maximizing bichromatic reverse nearest neighbor

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 1126-1137

  Wong, Raymond Chi Wing ^a   Tamer Ozsu M ^b   Yu, Philip S ^c   Fu, Ada Wai Chee ^d   Liu, Lian ^a  

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

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^d CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SIZE; EXPONENTIAL TIME COMPLEXITY; OPTIMAL REGIONS; REAL-LIFE APPLICATIONS; REVERSE NEAREST NEIGHBORS; SPATIAL DATABASE;

EID: 84865095455     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687754     Document Type: Article

References (19)

1. N. M. Amato, M. Goodrich, and E. A. Ramos. Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In 11th ACM-SIAM Sympos. Discreate Algorithms, 2000.
2. *-tree: An efficient and robust access method for points and rectangles. In SIGMOD, 1990.
3. S. Cabello, J. M. Diaz-Banex, S. Langerman, and C. Seara. Facility location problems in the plane based on reverse nearest neighbor queries. In European Journal of Operational Research, to appear.
4. S. Cabello, J. M. Diaz-Banez, S.Langerman, C. Seara, and I. Ventura. Reverse facility location problems. In Canadian Conference on Computational Geometry, 2005.
5. J. Cardinal and S. Langerman. Min-max-min geometric facility location problems. In 22nd European Workshop on Computational Geometry (EWCG), 2006.
6. B. Chazelle. Filtering search: A new approach to query-answering. In SIAM. J. Comput., 1986.
7. B. Chazelle. New upper bounds for neighbor searching. In Information and Control, 1986.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 2000.
9. Y. Du, D. Zhang, and T. Xia. The optimal-location query. In SSTD, 2005.
10. 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.
11. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In SIGMOD, 2000.
12. J. Krarup and P. M. Pruzan. The simple plant location problem: Survey and synthesis. In European Journal of Operational Research, 1983.
13. I. Stanoi, M. Riedewald, D. Agrawal, and A. E. Abbadi. Discovery of influence sets in frequently updated databases. In VLDB, 2001.
14. B. C. Tansel, R. L. Francis, and T. Lowe. Location on networks: A survey. In Management Science, 1983.
15. L. H. U, M. L. Yiu, K. Mouratidis, and N. Mamoulis. Capacity constrained assignment in spatial databases. In SIGMOD, 2008.
16. R. C.-W. Wong, T. Ozsu, P. S. Yu, and A. W.-C. Fu. Efficient method for maximizing bichromatic reverse nearest neighbor. In http://www.cse.ust.hk/∼raywong/paper/maxBRNN-technical.pdf, 2009.
17. R. C.-W. Wong, Y. Tao, A. W.-C. Fu, and X. Xiao. On efficient spatial matching. In VLDB, 2007.
18. T. Xia, D. Zhang, E. Kanoulas, and Y. Du. On computing top-t most influential spatial sites. In VLDB, 2005.
19. D. Zhang, Y. Du, T. Xia, and Y. Tao. Progressive computation of the min-dist optimal-location query. In VLDB, 2006.