Techniques for Design and Implementation of Efficient Spatial Access Methods
暂无分享,去创建一个
[1] Martti Mäntylä,et al. Localized set operations for solid modeling , 1983, SIGGRAPH.
[2] Walter A. Burkhard. Interpolation-based index maintenance , 1983, BIT Comput. Sci. Sect..
[3] Ekow J. Otoo,et al. Balanced multidimensional extendible hash tree , 1985, PODS.
[4] Klaus H. Hinrichs,et al. Storage and Access Structures for Geometric Data Bases , 1985, FODO.
[5] Hans-Peter Kriegel,et al. PLOP-hashing: A grid file without directory , 1988, Proceedings. Fourth International Conference on Data Engineering.
[6] Christos Faloutsos,et al. Analysis of object oriented spatial access methods , 1987, SIGMOD '87.
[7] Jack A. Orenstein. Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.
[8] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[9] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..
[10] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[11] Per-Åke Larson,et al. Linear Hashing with Partial Expansions , 1980, VLDB.
[12] Douglas Comer,et al. Ubiquitous B-Tree , 1979, CSUR.
[13] T. H. Merrett,et al. A class of data structures for associative searching , 1984, PODS.
[14] Reijo Sulonen,et al. The EXCELL Method for Efficient Geometric Access to Data , 1982, 19th Design Automation Conference.
[15] Michael Stonebraker,et al. Application of Abstract Data Types and Abstract Indices to CAD Data Bases , 1986, Engineering Design Applications.
[16] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.
[17] Hans-Werner Six,et al. Spatial searching in geometric databases , 1988, Proceedings. Fourth International Conference on Data Engineering.
[18] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[19] Nick Roussopoulos,et al. Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.
[20] Ekow J. Otoo,et al. A Mapping Function for the Directory of a Multidimensional Extendible Hashing , 1984, VLDB.
[21] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[22] Hans-Peter Kriegel,et al. Konzepte zur Suche geometrisch ähnlicher Bauteile , 1988, Non-Standard Datenbanken für Anwendungen der Graphischen Datenverarbeitung.
[23] Reijo Sulonen,et al. The EXCELL Method for Efficient Geometric Access to Data , 1982, DAC 1982.
[24] Witold Litwin,et al. Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.
[25] Aris M. Ouksel. The interpolation-based grid file , 1985, PODS '85.
[26] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[27] Hans-Peter Kriegel,et al. Multidimensional dynamic quantile hashing is very efficient for non-uniform record distributions , 1987, 1987 IEEE Third International Conference on Data Engineering.
[28] Hans-Peter Kriegel,et al. Multidimensional Order Preserving Linear Hashing with Partial Expansions , 1986, ICDT.