An Analysis Framework for Access Methods
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Douglas Comer,et al. Ubiquitous B-Tree , 1979, CSUR.
[3] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[4] Nick Roussopoulos,et al. Faloutsos: "the r+- tree: a dynamic index for multidimensional objects , 1987 .
[5] Christos Faloutsos,et al. The A dynamic index for multidimensional ob-jects , 1987, Very Large Data Bases Conference.
[6] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[7] Christos Faloutsos,et al. On packing R-trees , 1993, CIKM '93.
[8] Bernd-Uwe Pagel,et al. Towards an analysis of range query performance in spatial data structures , 1993, PODS '93.
[9] Christos Faloutsos,et al. Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension , 1994, PODS.
[10] Christos Faloutsos,et al. Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension , 1995, VLDB.
[11] Jeffrey F. Naughton,et al. Generalized Search Trees for Database Systems , 1995, VLDB.
[12] Bernd-Uwe Pagel,et al. Window query-optimal clustering of spatial objects , 1995, PODS.
[13] Bernd-Uwe Pagel,et al. Are window queries representative for arbitrary range queries? , 1996, PODS.
[14] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[15] Timos K. Sellis,et al. A model for the prediction of R-tree performance , 1996, PODS.
[16] J. Myllymaki,et al. DEVise: integrated querying and visual exploration of large datasets , 1997, SIGMOD '97.
[17] Shin'ichi Satoh,et al. The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.
[18] Shashi Shekhar,et al. Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.
[19] Mario A. López,et al. STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.
[20] Hans-Peter Kriegel,et al. The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.
[21] Hanan Samet,et al. Visualizing and Animating R-trees and Spatial Operations in Spatial Databases on the Worldwide Web , 1998, VDB.
[22] Erik Riedel,et al. A performance study of sequential I/O on windows NT TM 4 , 1998 .
[23] Oliver Günther,et al. Multidimensional access methods , 1998, CSUR.
[24] Joseph M. Hellerstein,et al. AMDB: an access method debugging tool , 1998, SIGMOD '98.
[25] Jonathan Goldstein,et al. When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.
[26] Shashi Shekhar,et al. Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..
[27] Mario A. López,et al. The Effect of Buffering on the Performance of R-Trees , 2000, IEEE Trans. Knowl. Data Eng..