Effective Decompositioning of Complex Spatial Objects into Intervals
暂无分享,去创建一个
[1] Christos Faloutsos,et al. Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..
[2] Volker Gaede,et al. Optimal Redundancy in Spatial Database Systems , 1995, SSD.
[3] Christos Faloutsos,et al. Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperectangles , 1997, IEEE Trans. Knowl. Data Eng..
[4] Hans-Peter Kriegel,et al. Query Processing of Spatial Objects: Complexity versus Redundancy , 1993, SSD.
[5] Oliver Günther,et al. Multidimensional access methods , 1998, CSUR.
[6] Claudia Bauzer Medeiros,et al. Databases for GIS , 1994, SGMD.
[7] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[8] Yannis Manolopoulos,et al. Advanced Database Indexing , 1999, Advances in Database Systems.
[9] Hans-Peter Kriegel,et al. Acceleration of relational index structures based on statistics , 2003, 15th International Conference on Scientific and Statistical Database Management, 2003..
[10] Hans-Peter Kriegel,et al. Spatial query processing for high resolutions , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..
[11] Hans-Peter Kriegel,et al. Interval Sequences: An Object-Relational Approach to Manage Spatial Data , 2001, SSTD.
[12] Hans-Peter Kriegel,et al. Managing Intervals Efficiently in Object-Relational Databases , 2000, VLDB.
[13] Jack A. Orenstein. Redundancy in spatial databases , 1989, SIGMOD '89.