Multi-step processing of spatial joins
暂无分享,去创建一个
Hans-Peter Kriegel | Bernhard Seeger | Thomas Brinkhoff | Ralf Schneider | H. Kriegel | B. Seeger | Thomas Brinkhoff | R. Schneider
[1] Oliver Günther,et al. The design of the cell tree: an object-oriented index structure for geometric databases , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.
[2] Margaret H. Dunham,et al. Join processing in relational databases , 1992, CSUR.
[3] Dov Dori,et al. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition , 1983, Comput. Vis. Graph. Image Process..
[4] Takao Asano,et al. Minimum partition of polygonal regions into trapezoids , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[5] Oliver Günther. Efficient Computation of Spatial Joins , 1993, ICDE.
[6] H. V. Jagadish. Spatial search with polyhedra , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.
[7] Christos Faloutsos,et al. Gray Codes for Partial Match and Range Queries , 1988, IEEE Trans. Software Eng..
[8] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[9] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[10] Hans-Peter Kriegel,et al. A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems , 1993, SSD.
[11] Hans-Peter Kriegel,et al. The Impact of Global Clustering on Spatial Database Systems , 1994, VLDB.
[12] Dan Benson,et al. Symbolic and Spatial Database for Structural Biology , 1991, OOPSLA.
[13] Michael Ian Shamos,et al. Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[14] Dan Benson,et al. Symbolic and spatial database for structural biology , 1991, OOPSLA 1991.
[15] Hans-Peter Kriegel,et al. Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.
[16] Jack A. Orenstein. Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.
[17] Emo Welzl,et al. Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.
[18] Hans-Peter Kriegel,et al. The Performance of Object Decomposition Techniques for Spatial Query Processing , 1991, SSD.
[19] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.
[20] H. V. Jagadish,et al. Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.
[21] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .
[22] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[23] Hans-Peter Kriegel,et al. The TR*-Tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations , 1991, Workshop on Computational Geometry.
[24] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[25] Hans-Peter Kriegel,et al. Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.