An Index Structure for Spatial Joins in Linear Constraint Databases.

@inproceedings{DBLP:conf/icde/ZhuSI99,
  author    = {Hongjun Zhu and
               Jianwen Su and
               Oscar H. Ibarra},
  title     = {An Index Structure for Spatial Joins in Linear Constraint Databases},
  booktitle = {Proceedings of the 15th International Conference on Data Engineering,
               23-26 March 1999, Sydney, Austrialia},
  publisher = {IEEE Computer Society},
  year      = {1999},
  pages     = {636-643},
  ee        = {db/conf/icde/ZhuSI99.html},
  crossref  = {DBLP:conf/icde/99},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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

ACM SIGMOD DiSC

• 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/DISC001 or /cdrom

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 DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Online Edition: IEEE Computer Society DL

Printed Edition

References

[1]

Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
Contents

[2]

Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter: Scalable Sweeping-Based Spatial Join. VLDB 1998: 570-581

[3]

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

[4]

Jon Louis Bentley, Derick Wood: An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. IEEE Trans. Computers 29(7): 571-577(1980)

[5]

Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger: Efficient Processing of Spatial Joins Using R-Trees. SIGMOD Conference 1993: 237-246

[6]

Alexander Brodsky, Joxan Jaffar, Michael J. Maher: Toward Practical Constraint Databases. VLDB 1993: 567-580

[7]

Ramez Elmasri, Shamkant B. Navathe: Fundamentals of Database Systems, 2nd Edition. Benjamin/Cummings 1994, ISBN 0-8053-1748-1
Contents

[8]

Dina Q. Goldin, Paris C. Kanellakis: Constraint Query Algebras. Constraints 1(1/2): 45-83(1996)

[9]

Stéphane Grumbach, Philippe Rigaux, Luc Segoufin: The DEDALE System for Complex Spatial Queries. SIGMOD Conference 1998: 213-224

[10]

Stéphane Grumbach, Jianwen Su, Christophe Tollu: Linear Constraint Query Languages: Expressive Power and Complexity. LCC 1994: 426-446

[11]

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

[12]

Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner: Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations. VLDB 1997: 396-405

[13]

Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz: Constraint Query Languages. J. Comput. Syst. Sci. 51(1): 26-52(1995)

[14]

Gabriel M. Kuper, Sridhar Ramaswamy, Kyuseok Shim, Jianwen Su: A Constraint-Based Spatial Extension to SQL. ACM-GIS 1998: 112-117

[15]

Ming-Ling Lo, Chinya V. Ravishankar: Spatial Hash-Joins. SIGMOD Conference 1996: 247-258

[16]

Jack A. Orenstein: Spatial Query Processing in an Object-Oriented Database System. SIGMOD Conference 1986: 326-336

[17]

Jack A. Orenstein: A Comparison of Spatial Query Processing Techniques for Native and Parameter Spaces. SIGMOD Conference 1990: 343-352

[18]

...

[19]

Jignesh M. Patel, David J. DeWitt: Partition Based Spatial-Merge Join. SIGMOD Conference 1996: 259-270

[20]

Franco P. Preparata, Michael Ian Shamos: Computational Geometry - An Introduction. Springer 1985, ISBN 3-540-96131-3

[21]

Hans-Werner Six, Derick Wood: Counting and Reporting Intersections of d-Ranges. IEEE Trans. Computers 31(3): 181-187(1982)

[22]

Jeffrey Scott Vitter: External Memory Algorithms. PODS 1998: 119-128