KISS-Tree: Smart latch-free in-memory indexing on modern architectures

8th International Workshop on Data Management on New Hardware, DaMoN 2012 - In Conjunction with ACM SIGMOD/PODS Conference

Volumn , Issue , 2012, Pages 16-23

  Kissinger, Thomas ^a   Schlegel, Benjamin ^a   Habich, Dirk ^a   Lehner, Wolfgang ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

B+-TREES; COMPRESSION SCHEME; CONCURRENT UPDATE; DATABASE ARCHITECTURE; DEGREE OF PARALLELISM; FUNDAMENTAL CHANGES; HARDWARE PLATFORM; HARDWARE THREADS; INDEX STRUCTURE; LOW MEMORY; MAIN MEMORY; MEMORY ACCESS; MODERN ARCHITECTURES; ON CURRENTS; PREFIX TREES; READ PERFORMANCE; READ/WRITE PERFORMANCE; SECONDARY MEMORIES; SERVER SYSTEM; STRUCTURAL MAINTENANCE; VIRTUAL MEMORY MANAGEMENT;

COMPUTER HARDWARE; DATA STRUCTURES; FORESTRY; HARDWARE; INFORMATION MANAGEMENT; OPTIMIZATION;

MEMORY ARCHITECTURE;

DATA BASES; FORESTRY; HARD WARE; INFORMATION RETRIEVAL; OPTIMIZATION;

EID: 84863480727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2236584.2236587     Document Type: Conference Paper

References (13)

1. Dexter project. http://wwwdb.inf.tu-dresden.de/dexter.
2. R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes, pages 245-262. Software pioneers, New York, NY, USA, 2002.
3. M. Böhm, B. Schlegel, P. B. Volk, U. Fischer, D. Habich, and W. Lehner. Efficient in-memory indexing with generalized prefix trees. In BTW, pages 227-246, 2011.
4. S. Heinz, J. Zobel, and H. E. Williams. Burst tries: a fast, efficient data structure for string keys. ACM Trans. Inf. Syst., 20(2):192-223, Apr. 2002. (Pubitemid 44642302)
5. C. Kim, J. Chhugani, N. Satish, E. Sedlar, A. D. Nguyen, T. Kaldewey, V. W. Lee, S. A. Brandt, and P. Dubey. Fast: fast architecture sensitive tree search on modern cpus and gpus. In SIGMOD, pages 339-350, 2010.
6. D. E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, 1973.
7. P. L. Lehman and s. B. Yao. Efficient locking for concurrent operations on b-trees. ACM Trans. Database Syst., 6:650-670, December 1981.
8. T. J. Lehman and M. J. Carey. A study of index structures for main memory database management systems. VLDB '86, pages 294-303, San Francisco, CA, USA, 1986. Morgan Kaufmann Publishers Inc.
9. P. E. McKenney and J. D. Slingwine. Read-copy update: Using execution history to solve concurrency problems.
10. A. Prokopec, P. Bagwell, and M. Odersky. Lock-free resizeable concurrent tries. LCPC, 2011.
11. J. Rao and K. A. Ross. Making b+- trees cache conscious in main memory. SIGMOD Rec., 29:475-486, May 2000.
12. J. Sewall, J. Chhugani, C. Kim, N. Satish, and P. Dubey. Palm: Parallel architecture-friendly latch-free modifications to b+ trees on many-core processors. PVLDB, 4(11):795-806, 2011.
13. W. A.Wulf and S. A. McKee. Hitting the memory wall: implications of the obvious. SIGARCH Comput. Archit. News, 23(1):20-24, Mar. 1995.