Indexing large geographic datasets with compact qualitative representation

ABSTRACT This paper develops a new mechanism to efficiently compute and compactly store qualitative spatial relations between spatial objects, focusing on topological and directional relations for large datasets of region objects. The central idea is to use minimum bounding rectangles (MBRs) to approximately represent region objects with arbitrary shape and complexity and only store spatial relations that cannot be unambiguously inferred from the relations of corresponding MBRs. We demonstrate, both in theory and practice, that our approach requires considerably less construction time and storage space, and can answer queries more efficiently than the state-of-the-art methods.

[1]  Anthony G. Cohn,et al.  Reasoning about Topological and Cardinal Direction Relations Between 2-Dimensional Spatial Objects , 2014, J. Artif. Intell. Res..

[2]  Derick Wood,et al.  Finding Rectangle Intersections by Divide-and-Conquer , 1984, IEEE Transactions on Computers.

[3]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[4]  Jayant Sharma,et al.  Modeling Topological Spatial Relations: Strategies for Query Processing , 1998 .

[5]  Jan Oliver Wallgrün,et al.  Exploiting qualitative spatial reasoning for topological adjustment of spatial data , 2012, SIGSPATIAL/GIS.

[6]  Paolo Fogliaroni Qualitative spatial configuration queries: towards next generation access methods for GIS , 2012 .

[7]  Agnès Voisard,et al.  Spatial Databases: With Application to GIS , 2001 .

[8]  R. K. Goyal,et al.  The Direction-Relation Matrix : A Representation for Direction Relations between Extended Spatial Objects , 2014 .

[9]  Paolo Fogliaroni,et al.  Managing Qualitative Spatial Information to Support Query-by-Sketch , 2011, Understanding and Processing Sketch Maps @ COSIT.

[10]  Ralf Hartmut Güting,et al.  A practical divide-and-conquer algorithm for the rectangle intersection problem , 1987, Inf. Sci..

[11]  Max J. Egenhofer,et al.  Consistent queries over cardinal directions across different levels of detail , 2000, Proceedings 11th International Workshop on Database and Expert Systems Applications.

[12]  Timothy Baldwin,et al.  Location-based mobile games for spatial knowledge acquisition , 2011 .

[13]  Sanjiang Li,et al.  On redundant topological constraints , 2014, Artif. Intell..

[14]  Derick Wood,et al.  An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles , 1980, IEEE Transactions on Computers.

[15]  M. Goodchild Citizens as sensors: the world of volunteered geography , 2007 .

[16]  Anthony G. Cohn,et al.  REASONING WITH TOPOLOGICAL AND DIRECTIONAL SPATIAL INFORMATION , 2009, Comput. Intell..

[17]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[18]  Anthony G. Cohn,et al.  Qualitative Spatial Representation and Reasoning , 2008, Handbook of Knowledge Representation.

[19]  Timos K. Sellis,et al.  Topological relations in the world of minimum bounding rectangles: a study with R-trees , 1995, SIGMOD '95.

[20]  Rami Al-Salman,et al.  Qualitative Spatial Query Processing: Towards Cognitive Geographic Information Systems , 2014 .

[21]  Gerhard Weikum,et al.  YAGO2: A Spatially and Temporally Enhanced Knowledge Base from Wikipedia: Extended Abstract , 2013, IJCAI.

[22]  Max J. Egenhofer,et al.  Geo-Mobile Query-by-Sketch , 2007, Int. J. Web Eng. Technol..

[23]  Sanjiang Li,et al.  Reasoning about cardinal directions between extended objects , 2009, Artif. Intell..

[24]  Anthony G. Cohn,et al.  A Spatial Logic based on Regions and Connection , 1992, KR.

[25]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[26]  Anthony G. Cohn,et al.  The ‘Egg-Yolk’ Representation of Regions with Indeterminate Boundaries , 2020 .