Abstract
A constant challenge of current spatial information systems is the retrieval of spatial configurations. This paper describes a new approach to retrieving spatial information whose novelty lies in using a content measure of topological relations to search and index spatial configurations. This approach uses a tree-based schema to index relations between objects’ minimum bounding rectangles, it preprocesses the user query to obtain an ordered list of spatial constraints, and it explores three searching algorithms that work over an indexed domain: fully-restrictive forward checking, partially-restrictive forward checking, and permutation-based searching. Experimental results show the viability of this type of indexing schema as well as the differences among searching algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berchtold, S., Bohm, C., Braunmuller, B., Keim, D., and Kriegel, H.-P. Fast Parallel Similarity Search in Multimedia Databases. ACM SIGMOD International Conference on Management and Data, (1997)
Papadias, D., Arkoumanis, D., and Karacapilidis, N. On the Retrieval of Similar Configurations. In Poiker, T. and Chrisman, N. (eds.) 8th International Symposium on Spatial Data Handling, Vancouver, (1998) 510–521
Wang, J., Li, J., Chan, D., and Wiederhold, G. Semantics-Sensitive Retrieval for Digital Picture Libraries. Digital-Library Magazine 5(11) (1999)
Smith, J. and Chang, S.-F. Integrated Spatial Query and Feature Image Query. Multimedia Systems 7 (1999) 129–140
Egenhofer, M. Query Processing in Spatial-Query-By-Sketch. Journal of Visual Languages and Computing 8(4) (1997) 403–424
Blaser, A. Sketching Spatial Queries. In Department of Spatial Information Science and Engineering, University of Maine, U.S. A, (2000)
Egenhofer, M. Spatial SQL: A Query and Presentation Language. IEEE Transactions on Knowledge and Data Engineering 6(1) (1994) 86–95
Papadias, D., Mamoulis, N., and Theodoridis, Y. Constraint-Based Processing of Multiway Spatial Joins. Algorithmica (2001)
Papadias, D. Hill Climbing Algorithms for Content-Based Retrieval of Similar Configurations. ACM Conference on Information Retrieval, Athens (2000)
Papadias, D., Mantzouroguannis, M., Kalnis, P., Mamoulis, N., and Ahmad, I. Content-Based Retrieval using Heuristic Search. ACM-SIGIR Conference on Research and Development in Information Retrieval, Berkeley (1999)
Papadias, D., Mamoulis, N., and Delis, V. Algorithms for Querying Spatial Structures. 24 th VLDB Conference, New York (1998)
Lee, S. and Hsu, F. Spatial Reasoning and Similarity Retrieval of Images Using 2D C-Strings Knowledge Representation. Pattern Recognition 25(3) (1992) 305–318
Berretti, S., Bimbo, A.D., and Vicario, E. The Computational Aspect of Retrieval by Spatial Arrangement. International Conference on Pattern Recognition, (2000)
El-Kwae, E. and Kabuka, M. A Robust Framework for Content-Based retrieval by Spatial Similarity in Image Databases. ACM Transactions on Information Systems 17(2) (1999)174–198
Castaglia, G., Tortora, G., and Arndt, T. A Unifying Approach to Iconic Indexing for 2-D and 3-D Scenes. IEEE Transactions on Knowledge and Data Engineering 4(3) (1992) 205–222
Lee, S., Yang, M., and Chen, J. Signature File as a Spatial Filter for Iconic Image. Journal of Visual Languages and Computing 3 (1992) 373–392
Goyal, R. and Egenhofer, M. Similarity of Direction Relations. In Jensen, C., Schneider, M., Seeger, B., and Tsotras, V. (Eds.) Seventh International Symposium on Spatial and Temporal Databases. Lecture Notes in Computer Science, Vol. 2121, Springer-Verlag, Berlin (2001) 36–55
Goyal, R. and Egenhofer, M. Cardinal Directions between Extended Spatial Objects. IEEE Transactions on Knowledge and Data Engineering (in press)
Petrakis, G. and Faloustos, C. Similarity Searching in Medical Image Databases. IEEE Transactions on Knowledge and Data Engineering 9(3) (1997)
Egenhofer, M. and Franzosa, R. Point-Set Topological Spatial Relations. International Journal of Geographical Information Systems 5(2) (1991) 161–174
Egenhofer, M. Deriving the Composition of Binary Topological Relations. Journal of Visual Languages and Computing 5(2) (1994) 133–149
Bruns, T. and Egenhofer, M. Similarity of Spatial Scenes. In Kraak, M. and Molenaar, M. (Eds.) Seventh International Symposium on Spatial Data Handling (SDH’ 96), Delft, The Netherlands, (1996) 4A. 31–42
Meseguer, P. Constraint Satisfaction Problems: An Overview. Artificial IntelligenceCom-munications AICOM 2(1) (1989) 3–17
Godoy, F. and Rodríguez, A. A Quantitative Description of Spatial Configurations. Spatial Data Handling, Ottawa, Canada (2002)
Randell, D., Cui, Z., and Cohn, A. A Spatial Logic Based on Regions and Connection. In Nebel, B., Rich, C., and Swarthout, W. (Eds.) Principles of Knowledge Representation and Reasoning, KR’ 92, Morgan Kaufmann, Cambridge, MA, (1992) 165–176
Guttman, A. R-Trees: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD International Conference on Management of Data, (1984)
Florence, J., Prediction Frequency of Topological Relations in Geographic Datasets. Master’s thesis, Department Spatial Information Science and Engineering, University of Maine (1997)
Egenhofer, M. and Sharma, J. Assessing the Consistency of Complete and Incomplete Topological Information. Geographical Systems 1 (1993) 47–68
Chambers, L. The Practical Handbook of Genetic Algorithms: Applications. Chapman & Hall (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodríguez, M.A., Godoy, F.A. (2002). A Content-Based Approach to Searching and Indexing Spatial Configurations. In: Egenhofer, M.J., Mark, D.M. (eds) Geographic Information Science. GIScience 2002. Lecture Notes in Computer Science, vol 2478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45799-2_18
Download citation
DOI: https://doi.org/10.1007/3-540-45799-2_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44253-0
Online ISBN: 978-3-540-45799-2
eBook Packages: Springer Book Archive