Prefetching J +-tree: A cache-optimized main memory database index structure

Journal of Computer Science and Technology

Volumn 24, Issue 4, 2009, Pages 687-707

  Luan, Hua ^a,b   Du, Xiao Yong ^a,b   Wang, Shan ^a,b  

^a Beijing Key Laboratory of Big Data Management and Analysis Methods   (China)

^b RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

Cache conscious; Index structure; Main memory database; PJ + tree; Prefetching

Indexed keywords

CACHE CONSCIOUS; INDEX STRUCTURE; MAIN MEMORY DATABASE; PJ +-TREE; PREFETCHING;

DATA STRUCTURES; DATABASE SYSTEMS;

CACHE MEMORY;

EID: 70349337009     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-009-9251-2     Document Type: Article

References (19)

1. Ailamaki A, DeWitt D J, Hill M D, Wood D A. DBMSs on a modern processor: Where does time go? In Proc. VLDB Conference, Edinburgh, UK, Sept. 7-10, 1999, pp.266-277.
2. Barroso L A, Gharachorloo K, Bugnion E D. Memory system characterization of commercial workloads. In Proc. the 25th ISCA, Barcelona, Spain, June 27-July 1, 1998, pp.3-14.
3. Keeton K, Patterson D A, He Y Q, Raphael R C, Baker W E. Performance characterization of a Quad Pentium Pro SMP using OLTP workloads. In Proc. the 25th ISCA, Barcelona, Spain, June 27-July 1, 1998, pp.15-26.
4. Becker M, Mancheril N, Okamoto S. DBMSs on a modern processor: "Where does time go?" revisited. Technical Report, Carnegie Mellon University, USA, 2004.
5. Rao J, Ross K A. Cache conscious indexing for decision-support in main memory. In Proc. VLDB Conference, Edinburgh, UK, Sept. 7-10, 1999, pp.78-89.
6. Hennessy J L, Patterson D A. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers Inc., 2002.
7. Boncz P, Manegold S, Kersten M L. Database architecture optimized for the new bottleneck: Memory access. In Proc. VLDB Conference, Edinburgh, UK, Sept. 7-10, 1999, pp.54-65.
8. +-trees cache conscious in main memory. In Proc. ACM SIGMOD, Dallas, USA, May 16-18, 2000, pp.475-486.
9. Shatdal A, Kant C, Naughton J F. Cache conscious algorithms for relational query processing. In Proc. VLDB Conference, Santiago, Chile, Sept. 12-15, 1994, pp.510-521.
10. Chen S, Gibbons P B, Mowry T C. Improving index performance through prefetching. In Proc. ACM SIGMOD, Santa Barbara, USA, May 21-24, 2001, pp.235-246.
11. Nyberg C, Barclay T, Cvetanovic Z, Gray J, Lomet D. AlphaSort: A RISC machine sort. In Proc. ACM SIGMOD, Minneapolis, USA, May 24-27, 1994, pp.233-242.
12. Lehman T J, Carey M J. A study of index structures for main memory database management systems. In Proc. VLDB Conference, Kyoto, Japan, Aug. 25-28, 1986, pp.294-303.
13. Baskins D. Judy functions - C libraries for creating and accessing dynamic arrays. http://judy.sourceforge.net.
14. D Comer 1979 The ubiquitous B-Tree ACM Computing Surveys 11 2 121 137 0419.68034 10.1145/356770.356776
15. Garcia-Molina H, Ullman J D, Widom J. Database System Implementation. Prentice Hall, 2000.
16. Luk C K, Mowry T C. Compiler-based prefetching for recursive data structures. In Proc. the 7th ASPLOS, Cambridge, USA, Oct. 1-5, 1996, pp.222-233.
17. CK Luk TC Mowry 1999 Automatic compiler-inserted prefetching for pointer-based applications IEEE Transactions on Computers 48 2 134 141 10.1109/12.752654
18. IA-32 Intel architecture optimization reference manual. Intel, http://developer.intel.com.
19. +-trees. In Proc. ACM SIGMET-RICS, San Diego, USA, June 9-14, 2003, pp.283-294.