An efficient method for the retrieval of objects by topological relations in spatial database systems

Information Processing and Management

Volumn 39, Issue 4, 2003, Pages 543-559

  Lin, P L ^a   Tan, W H ^a  

^a PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Internal rectangle; Minimum bounding rectangle; Object retrieval; Spatial database; Topological relation

Indexed keywords

DATABASE SYSTEMS; INFORMATION RETRIEVAL; TOPOLOGY;

OBJECT RETRIEVAL;

DATA PROCESSING;

EID: 0037508812     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0306-4573(02)00034-1     Document Type: Article

References (13)

1. Beckmann, N., Kriegel, H. P., Schneider, R., & Seeger, B. (1990). The R*-tree: an efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD Conference on Management of Data (pp. 322-331). New York: ACM Press.
2. Brinkhoff, T., Kriegel, H. P., & Schneider, R. (1993). Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems. In Proceedings of 9th International Conference on Data Engineering (pp. 40-49).
3. Brinkhoff, T., Kriegel, H. P., Schneider, R., & Seeger, B. (1994). Multi-step processing of spatial joins. In Proceedings of ACM SIGMOD International Conference on Management of Data (pp. 197-208).
4. Egenhofer M., Franzosa R. Point-set topological spatial relations. International Journal of Geographic Information Systems. 5:1991;161-174.
5. Gaede V., Günther O. Multidimensional access methods. ACM Computing Surveys. 2:1997;170-231.
6. Güting R.H. An introduction to spatial database systems. Very Large Data Bases Journal. 3:1994;357-399.
7. Guttman, A. (1984). R-Trees: a dynamic index structure for spatial searching. In Proceedings of the ACM Conference on the Modeling of Data (SIGMOD) (pp. 47-57). New York: ACM Press Ltd.
8. Lee, D. T. (1998). Computational geometry I. URL http://www.ece.nwu.deu/̃dtlee/publication.html#11.
9. Melkman A.A. On-line construction of convex hull of a simple polyline. Information Processing Letters. 25(1):1987;11-12.
10. Papadias, D., Theodoridis, Y., Sellis, T., & Egenhofer, M. (1995). Topological relations in the world of minimum bounding rectangles: a study with R-trees. In Proceedings of the ACM Conference on the Modeling of Data (SIGMOD) (pp. 92-103). New York: ACM Press.
11. Papadias D., Theodoridis Y. Spatial relations, minimum bounding rectangles, and spatial data structures. International Journal of Geographic Information Science. 11:1997;111-138.
12. Post, M. J. (1984). Minimum spanning ellipsoids. In Proceedings of 16th Annual Symposium on Theory of Computing (pp. 108-116).
13. Sellis, T., Roussopoulos, N., & Faloutsos, C. (1987). The R + -tree: a dynamic index for multi-dimensional objects. In Proceedings of the 13th Very Large Data Bases Conference (VLDB) (pp. 507-518).