Comparison of Approximations of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems.

@inproceedings{DBLP:conf/icde/BrinkhoffKS93,
  author    = {Thomas Brinkhoff and
               Hans-Peter Kriegel and
               Ralf Schneider},
  title     = {Comparison of Approximations of Complex Objects Used for Approximation-based
               Query Processing in Spatial Database Systems},
  booktitle = {Proceedings of the Ninth International Conference on Data Engineering,
               April 19-23, 1993, Vienna, Austria},
  publisher = {IEEE Computer Society},
  year      = {1993},
  isbn      = {0-8186-3570-3},
  pages     = {40-49},
  ee        = {db/conf/icde/BrinkhoffKS93.html},
  crossref  = {DBLP:conf/icde/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1993 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• 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/An2-6 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

References

[1]

...

[2]

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

[3]

...

[4]

...

[5]

...

[6]

...

[7]

Ronald L. Graham: An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. Inf. Process. Lett. 1(4): 132-133(1972) BibTeX

[8]

Oliver Günther: The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases. ICDE 1989: 598-605 BibTeX

[9]

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

[10]

Erik G. Hoel, Hanan Samet: A Qualitative Comparison Study of Data Structures for Large Line Segment Databases. SIGMOD Conference 1992: 205-214 BibTeX

[11]

H. V. Jagadish: Spatial Search with Polyhedra. ICDE 1990: 311-319 BibTeX

[12]

...

[13]

Hans-Peter Kriegel, Holger Horn, Michael Schiwietz: The Performance of Object Decomposition Techniques for Spatial Query Processing. SSD 1991: 257-276 BibTeX

[14]

...

[15]

Avraham A. Melkman: On-Line Construction of the Convex Hull of a Simple Polyline. Inf. Process. Lett. 25(1): 11-12(1987) BibTeX

[16]

Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9(1): 38-71(1984) BibTeX

[17]

...

[18]

Jack A. Orenstein: Redundancy in Spatial Databases. SIGMOD Conference 1989: 295-305 BibTeX

[19]

Mark J. Post: Minimum Spanning Ellipsoids. STOC 1984: 108-116 BibTeX

[20]

Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley 1990
BibTeX

[21]

...

[22]

...

[23]

Michel Scholl, Agnès Voisard: Thematic Map Modeling. SSD 1989: 167-190 BibTeX

[24]

Bernhard Seeger, Hans-Peter Kriegel: Techniques for Design and Implementation of Efficient Spatial Access Methods. VLDB 1988: 360-371 BibTeX

[25]

Bernhard Seeger, Hans-Peter Kriegel: The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems. VLDB 1990: 590-601 BibTeX

[26]

Raimund Seidel: Linear Programming and Convex Hulls Made Easy. Symposium on Computational Geometry 1990: 211-215 BibTeX

[27]

Hans-Werner Six, Peter Widmayer: Spatial Searching in Geometric Databases. ICDE 1988: 496-503 BibTeX

[28]

...

[29]

...

[30]

...