Influence sets based on reverse nearest neighbor queries

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 29, Issue 2, 2000, Pages 201-212

  Korn, Flip ^a   Muthukrishnan, S ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039845446     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/335191.335415     Document Type: Article

References (17)

1. P. Agrawal. Range searching. In E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 575-598. CRC Press, Boca Raton, FL, 1997.
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. ACM SIGMOD, pages 322-331, May 23-25 1990.
3. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In Proc. of ACM SIGMOD, pages 237-246, Washington, D.C., May 26-28 1993.
4. B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1:133-162, 1986.
5. K. Fukunaga and P. M. Narendra. A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. on Computers (TOC), C-24(7):750-753, July 1975.
6. V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30(2):170-231, June 1998.
7. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD, pages 47-57, Boston, Mass, June 1984.
8. G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. ACM SIGMOD '98, pages 237-248, June 1998.
9. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM TODS, 24(2):265-318, June 1999.
10. K. Jain and V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. Proc. 40th IEEE Foundations of Computer Science (FOCS '99), pages 2-13, 1999.
11. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12:28-35, 1983.
12. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast nearest-neighbor search in medical image databases. Conf. on Very Large Data Bases (VLDB), pages 215-226, September 1996.
13. B. Pagel, H. Six, H. Toben, and P. Widmayer. Towards an analysis of range query performance. In Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 214-221, Washington, D.C., May 1993.
14. R. Rajaraman, M. Korupolu, and G. Plaxton. Analysis of a local search heuristic for facility location problems. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA '98), pages 1-10, 1998.
15. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proc. of ACM-SIGMOD, pages 71-79, San Jose, CA, May 1995.
16. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+ tree: A dynamic index for multi-dimensional objects. In Proc. 13th International Conference on VLDB, pages 507-518, England, September 1987.
17. M. Smid. Closest point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook on Computational Geometry. Elsevier Science Publishing, 1997.