Efficient processing of large spatial queries using interior approximations

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

Volumn 2121, Issue , 2001, Pages 404-421

  Kothuri, Ravi K ^a   Ravada, Siva ^a  

^a ORACLE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; DECISION TREES;

3-DIMENSIONAL; COMPLEX GEOMETRIES; DATA GEOMETRY; FILTERING TECHNIQUE; QUERY PERFORMANCE; SPATIAL DATA; SPATIAL DATASETS; SPATIAL QUERIES;

GEOMETRY;

EID: 84944053032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47724-1_21     Document Type: Conference Paper

References (19)

1. W. M. Badaway and W. Aref. On local heuristics to speed up polygon-polygon intersection tests. In Proceedings of ACM GIS International Conference, pages 97–102, 1999.
2. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R* tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322–331, 1990.
3. S. Berchtold, D. A. Keim, and H. P. Kreigel. The X-tree: An index structure for high dimensional data. Proc˙ of the Int. Conf. on Very Large Data Bases, 1996.
4. T. Brinkhoff, H. Horn, H. P. Kriegel, and R. Schneider. A storage and access architecture for efficient query processing in spatial database systems. In Symposium on Large Spatial Databases (SSD’93), LNCS 692, 1993.
5. T. Brinkhoff, H. P. Kriegel, and R. Schneider. Comparison of approximations of complex objects in spatial database systems. In Proc. Int. Conf. on Data Engineering, pages 40–49, 1993.
6. T. Brinkhoff, H. P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 237–246, 1994.
7. M. J. Egenhofer. Reasoning aobout binary topological relations. In Symposium on Spatial Databases, pages 271–289, 1991.
8. M. J. Egenhofer, A. U. Frank, and J. P. Jackson. A topological data model for spatial databases. In Symposium on Spatial Databases (SSD), pages 271–289, 1989.
9. P. Fischer and K. U. Hoffgen. Computing a maximum axis-aligned rectangle in a convex polygon. In Information Processing Letters, 51, pages 189–194, 1994.
10. V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30(2), 1998.
11. A. Guttman. R-trees: A dynamic index structure for spatial searching. Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47–57, 1984.
12. G. Hjaltson and H. Samet. Ranking in spatial databases. In Symposium on Spatial Databases (SSD), 1995.
13. S. T. Leutenegger, M. A. Lopez, and J. M. Edgington. STR: A simple and efficient algorithm for R-tree packing. In Proc. Int. Conf. on Data Engineering, 1997.
14. King-Ip Lin, H. V. Jagdish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal, 3:517–542, 1994.
15. W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, and P. Yanker. The QBIC project: Querying images by content using color, texture and shape. In Proc. of the SPIE Conf. 1908 on Storage and Retrieval for Image and Video Databases, volume 1908, pages 173–187, February 1993.
16. K. V. Ravikanth, S. Ravada, J. Sharma, and J. Banerjee. Indexing mediumdimensionality data in oracle. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1999.
17. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 71–79, May 1995.
18. H. Samet. The design and analysis of spatial data structures. Addison-Wesley Publishing Co., 1989.
19. T. Sellis, N. Roussopoulos, and C. Faloutsos. The r+-tree: A dynamic index for multi-dimensional objects. Proc˙ of the Int. Conf. on Very Large Data Bases, 13:507–518, 1988.