Abstract
This paper derives and compares two strategies for minimizing topological constraints in a query expressed by a visual example: (1) elimination of topological relations that are implied uniquely by composition and (2) restriction to topological relations that relate near-neighbor objects, as determined by a Delaunay triangulation. In both cases, the query processing approach is to solve a constraint satisfaction problem over a graph of binary topological relations. Individuals and the combination of the composition- and neighborhood-based strategies were implemented and compared with respect to their ability to reduce topological constraints, and with respect to the quality of the results obtained by a similarity-based searching that uses these pre-processing strategies. The main conclusion of this work is that similarity queries that are formulated in a visual language should exploit the metric characteristics of the configuration, even if only topological constraints are considered for making matches.
This work was partially funded by FONDECYT 1010897 and 7010897 and the National Imagery and Mapping Agency under grant number NMA202-97-1-1023. Max Egenhofer.s work is further support by grants from the National Science Foundation under grant numbers IIS-9970123 and EPS- 9983432, the National Imagery and Mapping Agency under grant numbers NMA201-01-1-2003, NMA201-00-1-2009, NMA401-02-1-2009, and National Institute of Environmental Health Sciences, NIH, under grant number 1 R 01 ES09816-01.
This is a preview of subscription content, log in via an institution to check access.
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
Egenhofer, M.: Query Processing in Spatial-Query-By-Sketch. Journal of Visual Languages and Computing 8(4), 403–424 (1997)
Papadias, D., Mantzouroguannis, M., Kalnis, P., Mamoulis, N., Ahmad, I.: Content-Based Retrieval using Heuristic Search. In: ACM-SIGIR Conference on Research and Development in Information Retrieval, Berkeley, CA, pp. 168–175 (1999)
Papadias, D., Mamoulis, N., Delis, V.: Algorithms for Querying Spatial Structure. In: Gupta, A., Shmueli, O., Widom, J. (eds.) 24th VLDB Conference, New York, NY, pp. 546–557 (1998)
Rodríguez, A., Godoy, F.: A Content-Based Approach to Searching Spatial Configurations. In: Egenhofer, M.J., Mark, D.M. (eds.) GIScience 2002. LNCS, vol. 2478, pp. 260–275. Springer, Heidelberg (2002)
Rigaux, P., Scholl, M., Voisard, A.: Spatial Databases: with Application in GIS. Academic Press, San Diego (2002)
Egenhofer, M., Frank, A.: LOBSTER: Combining AI and Database Techniques. Photogrammetric Engineering & Remote Sensing 56(6), 919–926 (1990)
Park, H.-H., Lee, C.-G., Lee, Y.-J., Chung, C.-W.: Early Separation Filter and Refinement Steps in Spatial Query Optimization. In: International Conference in Database Systems for Advanced Applications, pp. 161–169 (1999)
Clementini, E., Sharma, J., Egenhofer, M.: Modeling Topological Relations: Strategies for Query Processing. Computers and Graphics 18(6) (1994)
Aref, A., Samet, H.: Optimizing Strategies for Spatial Query Processing. In: 7th International Conference on Very Large Databases, Barcelona, Spain, pp. 81–90 (1991)
Samet, H., Aref, W.: Spatial Data Models and Query Processing. In: Modern Database Systems, pp. 338–360. ACM Press, New York (1995)
Kriegel, H., Brinkhoff, T., Schneider, R.: Efficient Spatial Query Processing. IEEE Data Engineering Bulletin 16(3), 10–15 (1993)
Egenhofer, M.: Deriving the Composition of Binary Topological Relations. Journal of Visual Languages and Computing 5(2), 133–149 (1994)
Blaser, A.: Sketching Spatial Queries, Ph.D. Thesis. In Department of Spatial Information Science and Engineering, University of Maine, Orono, ME (2000)
Florence, J., Egenhofer, M.: Distribution of Topological Relations in Geographic Datasets. In: ACSM/ASPRS Conference, Baltimore, MD (1996)
Papadias, D., Arkoumanis, D., Karacapilidis, N.: On the Retrieval of Similar Configurations. In: Poiker, T., Chrisman, N. (eds.) 8th International Symposium on Spatial Data Handling, International Geographical Union, Vancouver, Canada, pp. 510–521 (1998)
Papadias, D., Kalnis, P., Mamoulis, N.: Hierarchical Constraint Satisfaction in Spatial Databases. In: Proceeding of the Annual Meeting of the AAAI, Orlando, FL, pp. 142–147 (1999)
Meseguer, P.: Constraint Satisfaction Problems: an Overview. AICOM 2(1), 3–17 (1989)
Egenhofer, M., Sharma, J.: Assessing the Consistency of Complete and Incomplete Topological Information. Geographical Systems 1, 47–68 (1993)
Egenhofer, M., Franzosa, R.: Point-Set Topological Spatial Relations. International Journal of Geographical Information Systems 5(2), 161–174 (1991)
Randell, D., Cui, Z., Cohn, A.: A Spatial Logic Based on Regions and Connection. In: Nebel, B., Rich, C., Swarthout, W. (eds.) Principles of Knowledge Representation and Reasoning, KR 1992, pp. 65–176. Morgan Kaufmann, Cambridge (1992)
Egenhofer, M., Al-Taha, K.: Reasoning About Gradual Changes of Topological Relations. In: Frank, A.U., Formentini, U., Campari, I. (eds.) GIS 1992. LNCS, vol. 639, pp. 196–219. Springer, Heidelberg (1992)
Gaede, V., Günther, O.: Multidimensional Access Method. ACM Computing Surveys 30(2), 170–231 (1998)
Egenhofer, M., Shariff, A.: Metric Details for Natural-Language Spatial Relations. ACM Transactions on Information Systems 16(4), 295–321 (1998)
Godoy, F., Rodríguez, A.: A Quantitative Description of Spatial Configurations. In: Richardson, D., van Oosterom, P. (eds.) Spatial Data Handling, pp. 299–311. Springer, Ottawa (2002)
Tarski, A.: On The Calculus of Relations. Journal of Symbolic Logic 6(3), 73–89 (1941)
Mackworth, A.: Consistency in Networks of Relations. Artificial Intelligence 8, 99–118 (1977)
Maddux, R.: Some Algebras and Algorithms for Reasoning about Time and Space. Department of Mathematics, Iowa State University, Ames, IO (1990)
Smith, T., Park, K.: Algebraic Approach to Spatial Reasoning. International Journal of Geographical Information Systems 6(3), 177–192 (1992)
Tobler, W.: Cellular Geography. In: Gale, S., Olsson, G. (eds.) Philosophy in Geography, D. Reidel Publishing Company, Dordrecht (1979)
Toussaint, G.: The Relative Neighborhood Graph of a Finite Planar Set. Pattern Recognition 12, 261–268 (1980)
Jaramcyzk, J., Toussaint, G.: Relative Graph and their Relatives. Proceedings of the IEEE 80(9), 1502–1517 (1992)
O’Rourke, J.: Computational Geometry. Cambridge University Press, Cambridge (1993)
Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Berlin (1985)
Bacchus, F., Grove, A.: On the Forward Checking Algorithm. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 292–309. Springer, Heidelberg (1995)
Egenhofer, M.: Spatial SQL: A Query and Presentation Language. IEEE Transactions on Knowledge and Data Engineering 6(1), 86–95 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodríguez, M.A., Egenhofer, M.J., Blaser, A.D. (2003). Query Pre-processing of Topological Constraints: Comparing a Composition-Based with Neighborhood-Based Approach. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds) Advances in Spatial and Temporal Databases. SSTD 2003. Lecture Notes in Computer Science, vol 2750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45072-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-45072-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40535-1
Online ISBN: 978-3-540-45072-6
eBook Packages: Springer Book Archive