Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees.

@inproceedings{DBLP:conf/sigmod/PapadiasTSE95,
  author    = {Dimitris Papadias and
               Yannis Theodoridis and
               Timos K. Sellis and
               Max J. Egenhofer},
  editor    = {Michael J. Carey and
               Donovan A. Schneider},
  title     = {Topological Relations in the World of Minimum Bounding Rectangles:
               A Study with R-trees},
  booktitle = {Proceedings of the 1995 ACM SIGMOD International Conference on
               Management of Data, San Jose, California, May 22-25, 1995},
  publisher = {ACM Press},
  year      = {1995},
  pages     = {92-103},
  ee        = {http://doi.acm.org/10.1145/223784.223798, db/conf/sigmod/PapadiasTSE95.html},
  crossref  = {DBLP:conf/sigmod/95},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1995 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/smod9397 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

Online Edition: ACM Digital Library

References

[Allen 1983]

James F. Allen: Maintaining Knowledge about Temporal Intervals. Commun. ACM 26(11): 832-843(1983) BibTeX

[Beckmann 1990]

Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331 BibTeX

[Brinkhoff 1993]

Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneider: Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems. ICDE 1993: 40-49 BibTeX

[Brinkhoff 1994]

Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: Multi-Step Processing of Spatial Joins. SIGMOD Conference 1994: 197-208 BibTeX

[Clementinni 1995]

...

[Egenhofer 1991]

Max J. Egenhofer: Reasoning about Binary Topological Relations. SSD 1991: 143-160 BibTeX

[Egenhofer 1993]

Max J. Egenhofer: Definitions of Line-Line Relations for Geographic Databases. IEEE Data Eng. Bull. 16(3): 40-45(1993) BibTeX

[Egenhofer 1994]

Max J. Egenhofer: Spatial SQL: A Query and Presentation Language. IEEE Trans. Knowl. Data Eng. 6(1): 86-95(1994) BibTeX

[Egenhofer 1992]

...

[Frank 1995]

...

[Freksa 1992]

Christian Freksa: Temporal Reasoning Based on Semi-Intervals. Artif. Intell. 54(1): 199-227(1992) BibTeX

[Glasgow 1992]

...

[Greene 1989]

Diane Greene: An Implementation and Performance Analysis of Spatial Data Access Methods. ICDE 1989: 606-615 BibTeX

[Grigni 1995]

...

[Guttman 1984]

Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57 BibTeX

[Hadzilacos 1992]

...

[Keighan 1993]

...

[Mark, Egenhofer 1994]

...

[Mark, Xia 1994]

...

[MGE 1993]

...

[Papadias 1994]

Dimitris Papadias, Timos K. Sellis: Qualitative Representation of Spatial Knowledge in Two-Dimensional Space. VLDB J. 3(4): 479-516(1994) BibTeX

[Papadias, Theodoridis 1994]

...

[Papadias, Theodoridis, Sellis 1994]

Dimitris Papadias, Yannis Theodoridis, Timos K. Sellis: The Retrieval of Direction Relations using R-trees. DEXA 1994: 173-182 BibTeX

[Papadias, Sellis 1995]

Dimitris Papadias, Timos K. Sellis: A Pictorial Query-by-Example Language. J. Vis. Lang. Comput. 6(1): 53-72(1995) BibTeX

[Randell 1992]

David A. Randell, Zhan Cui, Anthony G. Cohn: A Spatial Logic based on Regions and Connection. KR 1992: 165-176 BibTeX

[Roussopoulos 1995]

Nick Roussopoulos, Stephen Kelley, Frédéic Vincent: Nearest Neighbor Queries. SIGMOD Conference 1995: 71-79 BibTeX

[Sellis 1987]

Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. VLDB 1987: 507-518 BibTeX

[Sistla 1994]

A. Prasad Sistla, Clement T. Yu, R. Haddad: Reasoning About Spatial Relationships in Picture Retrieval Systems. VLDB 1994: 570-581 BibTeX

Referenced by

1. Jochen Van den Bercken, Martin Schneider, Bernhard Seeger: Plug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins. EDBT 2000: 495-509
2. Nikos Mamoulis, Dimitris Papadias: Integration of Spatial Join Algorithms for Processing Multiple Inputs. SIGMOD Conference 1999: 1-12
3. Haitao Jiang, Ahmed K. Elmagarmid: Spatial and Temporal Content-Based Access to Hypervideo Databases. VLDB J. 7(4): 226-238(1998)
4. Volker Gaede, Oliver Günther: Multidimensional Access Methods. ACM Comput. Surv. 30(2): 170-231(1998)
5. Dimitris Papadias, Nikos Mamoulis, Vasilis Delis: Algorithms for Querying by Spatial Structure. VLDB 1998: 546-557
6. Oliver Günther, Vincent Oria, Philippe Picouet, Jean-Marc Saglio, Michel Scholl: Benchmarking Spatial Joins À La Carte. SSDBM 1998: 32-41
7. Toshiyuki Amagasa, Masayoshi Aritsugi, Takayuki Tanaka, Yoshinari Kanamori: Implementing Class Library and Index for Managing Spatio-Temporal Data. ER Workshops 1998: 532-541
8. Yannis Theodoridis, Timos K. Sellis: A Model for the Prediction of R-tree Performance. PODS 1996: 161-171
9. Thodoros Topaloglou, John Mylopoulos: Representing Partial Spatial Information in Databases. ER 1996: 325-340
10. Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer: Generalized Search Trees for Database Systems. VLDB 1995: 562-573