RCached-tree: an index structure for efficiently answering popular queries
暂无分享,去创建一个
[1] James Bailey,et al. Enhancing the B+-tree by dynamic node popularity caching , 2010, Inf. Process. Lett..
[2] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[3] Raghu Ramakrishnan,et al. Database Management Systems , 1976 .
[4] Witold Litwin,et al. Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.
[5] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[6] Klaus H. Hinrichs,et al. Efficient Bulk Operations on Dynamic R-Trees , 1999, Algorithmica.
[7] Marios Hadjieleftheriou,et al. R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.
[8] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..
[9] Kenneth A. Ross,et al. Making B+- trees cache conscious in main memory , 2000, SIGMOD '00.
[10] Nick Roussopoulos,et al. K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.
[11] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.