Efficient computation of spatial joins with intersection predicates

References

• ARGE , L. , PROCOPIUC , O. , RAMASWAMY , S. , SUEL , T. and VITTER , J. 1998 . Scalable-Sweeping Basal Spatial Join . Proceedings of VLDB , : 570 – 581 .
   Google Scholar
• BIALLY , T. 1969 . Space-filling curves: their generation and their application to bandwidth reduction . IEEE Transactions on Information Theory , IT-15 : 658 – 664 .
   Google Scholar
• BRINKHOFE , T. , KRIEGEL , H.-P. and SEEGER , B. 1993 . Efficient processing of spatial joins using R-trees . Proceedings of ACM SIGMOD , : 237 – 246 .
   Google Scholar
• BRINKHOFF , T. , KRIEGEL , H. , SCHNEIDER , R. and SEEGER , B. 1994 . Multistep processing of spatial joins . Proceedings of ACM SIGMOD , : 189 – 208 .
   Google Scholar
• BUREAU OF THE CENSUS . 1991 . TIGER/Line Census Files
   Google Scholar
• FALOUTSOS , C. 1996 . Indexing Multimedia Databases , Dordrecht : Kluwer .
   Google Scholar
• GUNTHER , O. Efficient computation of spatial joins . Proceedings of the International Conference on Data Engineering . Vienna. pp. 50 – 59 .
   Google Scholar
• GUTTMAN , A. 1984 . R-trees: a dynamic index structure for spatial searching . Proceedings of ACM SIGMOD , : 47 – 57 .
   Google Scholar
• LO , M.-L. and RAVISHANKAR , C. V. 1994 . Spatial joins using seeded trees . Proceedings of ACM SIGMOD , : 209 – 220 .
   Google Scholar
• LO , M.-L. and RAVISHANKAR , C. V. Generating seeded trees from spatial data sets . Proceedings of Symposium on Large Spatial Data Bases . Zürich. pp. 328 – 347 .
   Google Scholar
• LO , M.-L. and RAVISHANKAR , C. V. 1996 . Spatial hash-joins . Proceedings of ACM SIGMOD , : 247 – 258 .
   Google Scholar
• MAMOULIS , N. and PAPADIAS , D. 1999 . Integration of spatial join algorithms for processing multiple inputs . Proceedings of ACM SIGMOD , : 1 – 12 .
   Google Scholar
• NIEVERGELT , J. , HINTERBERGER , H. and SEVCIK , K. C. 1984 . The grid file: an adaptable, symmetric multikey file structure . ACM TODS , 1984 : 38 – 71 .
   Google Scholar
• O'NEIL , P. 1996 . Query performance, Talk Delivered at IBM Toronto
   Google Scholar
• O'NEIL , P. and GRAEFE , G. 1995 . Multi-table joins through bitmapped join indices . SIGMOD Record , 24 : 8 – 11 .
   Google Scholar
• ORENSTEIN , J. 1986 . Spatial query processing in an object-oriented database system . Proceedings of ACM SIGMOD , : 326 – 336 .
   Google Scholar
• PAPADIAS , D. , MAMOULIS , N. and THEODORIDIS , Y. 1999 . Processing and optimization of multiway spatial joins using R-trees . PODS , : 44 – 55 .
   Google Scholar
• PATEL , J. M. and DEWITT , D. J. 1996 . Partition based spatial-merge join . Proceedings of ACM SIGMOD , : 259 – 270 .
   Google Scholar
• PREPARATA , F. P. and SHAMOS , M. I. 1995 . Computational Geometry , New York-Heidelberg-Berlin : Springer-Verlag .
   Google Scholar
• ROTEM , D. Spatial join indices . Proceedings of the International Conference on Data Engineering . Vienna. pp. 500 – 509 .
   Google Scholar
• SELLIS , T. , ROUSSOPOULOS , N. and FALOUTSOS , C. 1987 . The R+ -tree a dynamic index for multi-dimensional data . Proceedings of VLDB 1987 , : 507 – 518 .
   Google Scholar
• SEVCK , K. C. and KOUDAS , N. 1996 . Filter trees for managing spatial data over a range of size granularities . Proceedings of VLDB , : 16 – 27 .
   Google Scholar
• STONEBRAKER , M. and MOORE , D. 1996 . Object Relational Databases: The Next Wave , Morgan Kauffman .
   Google Scholar
• THEODORIDIS , Y. , STAFANAKIS , E. and SELLIS , T. 1998 . Cost models for join queries in spatial databases . Proceedings of ICDE , : 476 – 483 .
   Google Scholar
• VALDURIEZ , P. 1987 . Join indexes . ACM TODS , 12 : 218 – 246 .
   Google Scholar