Ranking in spatial databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 951, Issue , 1995, Pages 83-95

  Hjaltason, Gísli R ^a   Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; NEAREST NEIGHBOR SEARCH; QUERY LANGUAGES; QUERY PROCESSING;

APPLICATION AREA; COMPLEX QUERIES; K NEAREST NEIGHBOR QUERIES; QUERY OBJECT; QUERY PROCESSOR; SPATIAL DATA STRUCTURE; SPATIAL DATABASE; SPATIAL OBJECTS;

ALGORITHMS;

EID: 84957646742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60159-7_6     Document Type: Conference Paper

References (15)

1. W. G. Aref and H. Samet. Extending a DBMS with spatial operations. In O. Gunther and H. J. Schek, editors, Advances in Spatial Databases-2nd Symposium, SSD’91, pages 299-318, Berlin, 1991. Springer-Verlag. (also Lecture Notes in Computer Science 525).
2. W. G. Aref and H. Samet. Uniquely reporting spatial objects: yet another operation for comparing spatial data structures. In Proceedings of the Fifth International Symposium on Spatial Data Handling, pages 178-189, Charleston, South Carolina, August 1992.
3. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, Arlington, VA., January 1994.
4. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, June 1979.
5. L. M. Goldschlager. Short algorithms for space-filling curves. Software-Practice and Experience, 11(1):99, January 1981.
6. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of the SIGMOD Conference, pages 47-57, Boston, June 1984.
7. E. G. Hoel and H. Samet. Efficient processing of spatial queries in line segment databases. In O. Günther and H. J. Schek, editors, Advances in Spatial Databases-2nd Symposium, SSD’91, pages 237-256. Springer-Verlag, Berlin, 1991. (also Lecture Notes in Computer Science 525).
8. M. Lindenbaum and H. Samet. A probabilistic analysis of trie-based sorting of large collections of line segments. Department of Computer Science CS-TR-3455, University of Maryland, College Park, MD, April 1995.
9. R. C. Nelson and H. Samet. A population analysis for hierarchical data structures. In Proceedings of the SIGMOD Conference, pages 270-277, San Francisco, May 1987.
10. J. T. Robinson. The k-d-b-tree: a search structure for large multidimensional dynamic indexes. In Proceedings of the SIGMOD Conference, pages 10-18, Ann Arbor, MI, April 1981.
11. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pages 71-79, San Jose, CA, May 1995.
12. H. Samet. Neighbor finding techniques for images represented by quadtrees. Computer Graphics and Image Processing, 18(1):37-57, January 1982.
13. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.
14. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
15. M. Stonebraker, T. Sellis, and E. Hanson. An analysis of rule indexing implementations in data base systems. In Proceedings of the First International Conference on Expert Database Systems, pages 353-364, Charleston, SC, April 1986.