Integrated Query Processing Strategies for Spatial Path Queries.

@inproceedings{DBLP:conf/icde/HuangJR97,
  author    = {Yun-Wu Huang and
               Ning Jing and
               Elke A. Rundensteiner},
  editor    = {W. A. Gray and
               Per-{\AA}ke Larson},
  title     = {Integrated Query Processing Strategies for Spatial Path Queries},
  booktitle = {Proceedings of the Thirteenth International Conference on Data
               Engineering, April 7-11, 1997 Birmingham U.K},
  publisher = {IEEE Computer Society},
  year      = {1997},
  isbn      = {0-8186-7807-0},
  pages     = {477-486},
  ee        = {db/conf/icde/HuangJR97.html},
  crossref  = {DBLP:conf/icde/97},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1997 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-7 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]

Rakesh Agrawal, Shaul Dar, H. V. Jagadish: Direct Transitive Closure Algorithms: Design and Performance Evaluation. ACM Trans. Database Syst. 15(3): 427-458(1990) BibTeX

[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]

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

[4]

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

[5]

Max J. Egenhofer: What's Special about Spatial? Database Requirements for Vehicle Navigation in Geographic Space (Extended Abstract). SIGMOD Conference 1993: 398-402 BibTeX

[6]

Oliver Günther: Efficient Computation of Spatial Joins. ICDE 1993: 50-59 BibTeX

[7]

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

[8]

Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner: Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types. ACM-GIS 1995: 93- BibTeX

[9]

Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner: Effective Graph Clustering for Path Queries in Digital Map Databases. CIKM 1996: 215-222 BibTeX

[10]

Yannis E. Ioannidis, Raghu Ramakrishnan, Linda Winger: Transitive Closure Algorithms Based on Graph Traversal. ACM Trans. Database Syst. 18(3): 512-576(1993) BibTeX

[11]

Ning Jing, Yun-Wu Huang, Elke A. Rundensteiner: Hierarchical Optimization of Optimal Path Finding for Transportation Applications. CIKM 1996: 261-268 BibTeX

[12]

Ming-Ling Lo, Chinya V. Ravishankar: Spatial Joins Using Seeded Trees. SIGMOD Conference 1994: 209-220 BibTeX

[13]

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

[14]

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

[15]

Jack A. Orenstein, T. H. Merrett: A Class of Data Structures for Associative Searching. PODS 1984: 181-190 BibTeX

[16]

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

[17]

Doron Rotem: Spatial Join Indices. ICDE 1991: 500-509 BibTeX

[18]

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

[19]

Michael Ian Shamos, Dan Hoey: Geometric Intersection Problems. FOCS 1976: 208-215 BibTeX

Referenced by

1. Ning Jing, Yun-Wu Huang, Elke A. Rundensteiner: Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. IEEE Trans. Knowl. Data Eng. 10(3): 409-432(1998)
2. Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner: Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations. VLDB 1997: 396-405
3. Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner: A Cost Model for Estimating the Performance of Spatial Joins Using R-trees. SSDBM 1997: 30-38