Fast Loads and Fast Queries
暂无分享,去创建一个
[1] Michael J. Carey,et al. A Study of Index Structures for a Main Memory Database Management System , 1986, HPTS.
[2] Guido Moerkotte,et al. Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing , 1998, VLDB.
[3] David J. DeWitt,et al. Weaving Relations for Cache Performance , 2001, VLDB.
[4] Kenneth A. Ross,et al. Making B+-Trees Cache Conscious in Main Memory , 2000, SIGMOD Conference.
[5] Goetz Graefe. B-tree indexes, interpolation search, and skew , 2006, DaMoN '06.
[6] Goetz Graefe,et al. Sorting And Indexing With Partitioned B-Trees , 2003, CIDR.
[7] Rohit Jain,et al. Efficient Search of Multi-Dimensional B-Trees , 1995, VLDB.
[8] Alfons Kemper,et al. Efficient bulk deletes in relational databases , 2001, Proceedings 17th International Conference on Data Engineering.
[9] Michael J. Carey,et al. Query processing in main memory database management systems , 1986, SIGMOD '86.
[10] Goetz Graefe,et al. B-tree indexes and CPU caches , 2001, Proceedings 17th International Conference on Data Engineering.
[11] Rudolf Bayer,et al. Organization and maintenance of large ordered indexes , 1972, Acta Informatica.
[12] Peter Bumbulis,et al. A compact B-tree , 2002, SIGMOD '02.
[13] David B. Lomet. The evolution of effective B-tree: page organization and techniques: a personal account , 2001, SGMD.
[14] R. Bayer,et al. Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.