{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T13:02:37Z","timestamp":1749646957472},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319561103"},{"type":"electronic","value":"9783319561110"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56111-0_1","type":"book-chapter","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T07:27:52Z","timestamp":1490167672000},"page":"1-17","source":"Crossref","is-referenced-by-count":2,"title":["Cache-Sensitive Skip List: Efficient Range Queries on Modern CPUs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Sprenger","sequence":"first","affiliation":[]},{"given":"Steffen","family":"Zeuch","sequence":"additional","affiliation":[]},{"given":"Ulf","family":"Leser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"unstructured":"B+ tree source code (C 1999). http:\/\/www.amittai.com\/prose\/bpt.c","key":"1_CR1"},{"unstructured":"Introduction to inteladvanced vector extensions. https:\/\/software.intel.com\/en-us\/articles\/introduction-to-intel-advanced-vector-extensions","key":"1_CR2"},{"unstructured":"PAPI. http:\/\/icl.cs.utk.edu\/papi\/","key":"1_CR3"},{"doi-asserted-by":"crossref","unstructured":"Alvarez, V., Richter, S., Chen, X., Dittrich, J.: A comparison of adaptive radix trees and hash tables. In: 31st IEEE International Conference on Data Engineering (2015)","key":"1_CR4","DOI":"10.1109\/ICDE.2015.7113370"},{"doi-asserted-by":"crossref","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indices. In: SIGFIDET (1970)","key":"1_CR5","DOI":"10.1145\/1734663.1734671"},{"unstructured":"Boehm, M., Schlegel, B., Volk, P.B., Fischer, U., Habich, D., Lehner, W.: Efficient in-memory indexing with generalized prefix trees. In: BTW (2011)","key":"1_CR6"},{"issue":"2","key":"1_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: Ubiquitous B-tree. ACM Comput. Surv. 11(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: Proceedings of 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 50\u201359 (2004)","key":"1_CR8","DOI":"10.1145\/1011767.1011776"},{"issue":"1","key":"1_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12859-015-0865-9","volume":"17","author":"J Hakenberg","year":"2016","unstructured":"Hakenberg, J., Cheng, W.Y., Thomas, P., Wang, Y.C., Uzilov, A.V., Chen, R.: Integrating 400 million variants from 80,000 human samples with extensive annotations: towards a knowledge base to analyze disease cohorts. BMC Bioinf. 17(1), 1 (2016)","journal-title":"BMC Bioinf."},{"unstructured":"Herlihy, M., Lev, Y., Luchangco, V., Shavit, N.: A provably correct scalable concurrent skip list. In: Conference on Principles of Distributed Systems (2006)","key":"1_CR10"},{"doi-asserted-by":"crossref","unstructured":"Kim, C., Chhugani, J., Satish, N., Sedlar, E., Nguyen, A.D., Kaldewey, T., Lee, V.W., Brandt, S.A., Dubey, P.: FAST: fast architecture sensitive tree search on modern CPUs and GPUs. In: Proceedings of the International Conference on Management of Data, pp. 339\u2013350 (2010)","key":"1_CR11","DOI":"10.1145\/1807167.1807206"},{"doi-asserted-by":"crossref","unstructured":"Kissinger, T., Schlegel, B., Habich, D., Lehner, W.: KISS-Tree: Smart latch-free in-memory indexing on modern architectures. In: Proceedings of the Eighth International Workshop on Data Management on New Hardware, pp. 16\u201323 (2012)","key":"1_CR12","DOI":"10.1145\/2236584.2236587"},{"doi-asserted-by":"crossref","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: 29th IEEE International Conference on Data Engineering (2013)","key":"1_CR13","DOI":"10.1109\/ICDE.2013.6544812"},{"doi-asserted-by":"crossref","unstructured":"Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: Proceedings of the Seventh EuroSys Conference, pp. 183\u2013196 (2012)","key":"1_CR14","DOI":"10.1145\/2168836.2168855"},{"unstructured":"Munro, J.I., Papadakis, T., Sedgewick, R.: Deterministic skip lists. In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 367\u2013375 (1992)","key":"1_CR15"},{"issue":"6","key":"1_CR16","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"unstructured":"Rao, J., Ross, K.A.: Cache conscious indexing for decision-support in main memory. In: Proceedings of 25th International Conference on Very Large Data Bases, pp. 78\u201389 (1999)","key":"1_CR17"},{"doi-asserted-by":"crossref","unstructured":"Rao, J., Ross, K.A.: Making B $${}^{\\text{+}}$$ -trees cache conscious in main memory. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 475\u2013486 (2000)","key":"1_CR18","DOI":"10.1145\/342009.335449"},{"doi-asserted-by":"crossref","unstructured":"The 1000 Genomes Project Consortium: A global reference for human genetic variation. Nature 526(7571), 68\u201374 (2015)","key":"1_CR19","DOI":"10.1038\/nature15393"},{"issue":"7031","key":"1_CR20","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1038\/nature03441","volume":"434","author":"X Xie","year":"2005","unstructured":"Xie, X., Lu, J., Kulbokas, E., Golub, T.R., Mootha, V., Lindblad-Toh, K., Lander, E.S., Kellis, M.: Systematic discovery of regulatory motifs in human promoters and 3\u2019 UTRs by comparison of several mammals. Nature 434(7031), 338\u2013345 (2005)","journal-title":"Nature"},{"unstructured":"Xie, Z., Cai, Q., Jagadish, H., Ooi, B.C., Wong, W.F.: PI: a parallel in-memory skip list based index. arXiv preprint (2016). arXiv:1601.00159","key":"1_CR21"},{"doi-asserted-by":"crossref","unstructured":"Zhang, H., Andersen, D.G., Pavlo, A., Kaminsky, M., Ma, L., Shen, R.: Reducing the storage overhead of main-memory OLTP databases with hybrid indexes. In: Proceedings of the International Conference on Management of Data, pp. 1567\u20131581 (2016)","key":"1_CR22","DOI":"10.1145\/2882903.2915222"}],"container-title":["Lecture Notes in Computer Science","Data Management on New Hardware"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56111-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T13:11:20Z","timestamp":1498396280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56111-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319561103","9783319561110"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56111-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}