Nearest Neighbor Queries

ACM SIGMOD Record

Volumn 24, Issue 2, 1995, Pages 71-79

  Roussopoulos, Nick ^a   Kelley, Stephen ^a   Vincent, Frederic ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976703615     PISSN: 01635808     EISSN: N/A     Source Type: Journal    
DOI: 10.1145/568271.223794     Document Type: Article

References (12)

1. Beckmann, N., H.-P. Kriegel, R. Schneider and B. Seeger, “The R*-tree: an efficient and robust access method for points and rectangles,” ACM SIGMOD, pp 322–331, May 1990.
2. Brinkhoff, T., Kriegel, H.P., and Seeger, B., “Efficient Processing of Spatial Joins Using R-trees,” Proc. ACM SIGMOD, May 1993, pp. 237–246.
3. Friedman, J.H., Bentley, J.L., and Finkel, R.A., “An algorithm for finding the best matches in logarithmic expected time,” ACM Trans. Math. Software, 3, September 1977, pp. 209–226.
4. Guttman, A., “R-trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD, pp. 47–57, June 1984.
5. Horowitz, E., Sahni, S., “Fundamentals of Computer Algorithms,” Computer Science Press, 1978, pp. 370–421.
6. Jagadish, H.V., “Linear CIustering of Objects with Multiple Attributes,” Proc. ACM SIGMOD, May 1990, pp. 332–342.
7. Kamel, I. and Faloutsos, C., “Hilbert R-Tree: an Improved R-Tree Using Fractals,” Proc. of VLDB, 1994, pp. 500–509.
8. Roussopoulos, N. and D. Leifker, “Direct Spatial Search on Pictorial Databases Using Packed R-trees,” Proc. ACM SIGMOD, May 1985.
9. Samet, H., “The Design & Analysis Of Spatial Data Structures,” Addison-Wesley, 1989.
10. Samet, H., “Applications Of Spatial Data Structures, Computer Graphics, Image Processing and GIS,” Addison-Wesley, 1990.
11. Sellis T., Roussopoulos, N., and Faloutsos, C., “The R+-tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th International Conference on Very Large Data Bases, 1987, pp. 507–518.
12. Sproull, R.F., “Refinements to Nearest-Neighbor Searching in k-Dimensional Trees,” Algorithmica, 6, 1987, pp. 579–589.