Supporting Direction Relations in Spatial Database systems

Despite the attention that direction relations have attracted in domains such as Spatial Query Languages, Image and Multimedia Databases, Reasoning and Geographic Applications, they have not been extensively applied in spatial access methods. In this paper we define direction relations between two-dimensional objects in different levels of qualitative resolution and we show how these relations can be efficiently retrieved in existing DBMSs using several indexing techniques. Then we describe our implementations and provide experimental results on Band Rtree-based data structures to support direction relations efficiently.

[1]  D. Papadias,et al.  Computational Imagery , 1992, Cogn. Sci..

[2]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

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

[4]  Annette Herskovits,et al.  Language and spatial cognition , 1986 .

[5]  M. Egenhofer,et al.  Assessing the Consistency of Complete and Incomplete Topological Information , 1993 .

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

[7]  Daniel Hernández,et al.  Qualitative Representation of Spatial Knowledge , 1994, Lecture Notes in Computer Science.

[8]  Dimitris Papadias,et al.  Topological Inference , 1995, IJCAI.

[9]  Ray Jackendoff.  Semantics and Cognition , 1983 .

[10]  Dimitris Papadias,et al.  Range Queries Involving Spatial Relations: A Performance Analysis , 1995, COSIT.

[11]  Andrew U. Frank,et al.  Constraint-Based Reasoning in Geographic Databases: the Case of Symbolic Arrays , 1994, Workshop on Deductive Databases and Logic Programming.

[12]  Andrew U. Frank,et al.  Qualitative Spatial Reasoning: Cardinal Directions as an Example , 1996, Int. J. Geogr. Inf. Sci..

[13]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[14]  Timos K. Sellis,et al.  A model for the prediction of R-tree performance , 1996, PODS.

[15]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[16]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[17]  TheodoridisYannis,et al.  Topological relations in the world of minimum bounding rectangles , 1995 .

[18]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[19]  Amitabha Mukerjee,et al.  A Qualitative Model for Space , 1990, AAAI.

[20]  Andrew U. Frank,et al.  Qualitative spatial reasoning about distances and directions in geographic space , 1992, J. Vis. Lang. Comput..

[21]  Clement T. Yu,et al.  Reasoning About Spatial Relationships in Picture Retrieval Systems , 1994, VLDB.

[22]  Michael Stonebraker,et al.  The design of POSTGRES , 1986, SIGMOD '86.

[23]  Timos K. Sellis,et al.  The Retrieval of Direction Relations using R-trees , 1994, DEXA.

[24]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[25]  David M. Mark.  Counter-Intuitive Geographic "Facts": Clues for Spatial Reasoning at Geographic Scales , 1992, Spatio-Temporal Reasoning.

[26]  Donna Peuquet,et al.  An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane , 1987, Pattern Recognit..

[27]  Timos K. Sellis,et al.  A Pictorial Query-by-Example Language , 1995, J. Vis. Lang. Comput..