{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:01:33Z","timestamp":1742979693932,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319139593"},{"type":"electronic","value":"9783319139609"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-13960-9_10","type":"book-chapter","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T03:40:51Z","timestamp":1421120451000},"page":"126-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The DCB-Tree: A Space-Efficient Delta Coded Cache Conscious B-Tree"],"prefix":"10.1007","author":[{"given":"Robert","family":"Binna","sequence":"first","affiliation":[]},{"given":"Dominic","family":"Pacher","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Meindl","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther","family":"Specht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-540-76298-0_52","volume-title":"The Semantic Web","author":"S Auer","year":"2007","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: a nucleus for a web of open data. In: Aberer, K., et al. (eds.) ISWC\/ASWC 2007. LNCS, vol. 4825, pp. 722\u2013735. Springer, Heidelberg (2007)"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binary B-Trees: data structure and maintenance algorithms. Acta Informatica 1(4), 290\u2013306 (1972)","journal-title":"Acta Informatica"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indices. In: Proceedings of the SIGFIDET (now SIGMOD) 1970, p. 107. ACM Press, New York (1970)","DOI":"10.1145\/1734663.1734671"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/320521.320530","volume":"2","author":"R Bayer","year":"1977","unstructured":"Bayer, R., Unterauer, K.: Prefix B-Trees. ACM Trans. Database Syst. 2(1), 11\u201326 (1977)","journal-title":"ACM Trans. Database Syst."},{"key":"10_CR5","unstructured":"Binna, R., Gassler, W., Zangerle, E., Pacher, D., Specht, G.: SpiderStore: exploiting main memory for efficient RDF graph representation and fast querying. In: Proceedings of Workshop on Semantic Data Management (SemData) at VLDB (2010)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bohannon, P., Mcllroy, P., Rastogi, R.: Main-memory index structures with fixed-size partial keys. In: Proceedings of SIGMOD 2001, vol. 30, pp. 163\u2013174. ACM Press, New York, June 2001","DOI":"10.1145\/376284.375681"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Chen, S., Gibbons, P.B., Mowry, T.C., Valentin, G.: Fractal prefetching B+-Trees. In: Proceedings of SIGMOD 2002, p. 157. ACM Press, New York (2002)","DOI":"10.1145\/564708.564710"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","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."},{"issue":"9","key":"10_CR9","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Commun. ACM 3(9), 490\u2013499 (1960)","journal-title":"Commun. ACM"},{"key":"10_CR10","unstructured":"Gray, J.: Tape is dead, disk is tape, flash is disk, RAM locality is king, Gong Show Presentation at CIDR (2007)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: 19th Annual Symposium on Foundations of Computer Science (SCFS 1978), pp. 8\u201321. IEEE, October 1978","DOI":"10.1109\/SFCS.1978.3"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Hoffart, J., Suchanek, F.M., Berberich, K., Lewis-Kelham, E., de Melo, G., Weikum, G.: YAGO2: exploring and querying world knowledge in time, space, context, and many languages. In: Proceedings of WWW 2011, p. 229. ACM Press, New York (2011)","DOI":"10.1145\/1963192.1963296"},{"key":"10_CR13","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 SIGMOD 2010, p. 339 (2010)","DOI":"10.1145\/1807167.1807206"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Lehman, T.J., Careay, M.J.: A study of index structures for main memory database management systems. In: Proceedings of VLDB 1986, pp. 294\u2013303 (1986)","DOI":"10.1145\/16894.16878"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: Proceedings of ICDE 2013, pp. 38\u201349. IEEE, April 2013","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Levandoski, J.J., Lomet, D.B., Sengupta, S.: The Bw-tree: A B-tree for new hardware platforms. In: Proceedings of ICDE 2013, pp. 302\u2013313 (2013)","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: Proceedings of the 7th ACM European Conference on Computer Systems - EuroSys 2012, p. 183 (2012)","DOI":"10.1145\/2168836.2168855"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. In: Proceedings of VLDB Endowment, vol. 1, pp. 647\u2013659, August 2008","DOI":"10.14778\/1453856.1453927"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Rao, J., Ross, K.A.: Cache Conscious Indexing for Decision-Support in Main Memory. In: Proceedings of VLDB 1999, pp. 475\u2013486. Morgan Kaufmann Publishers Inc. (1999)","DOI":"10.1145\/335191.335449"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/335191.335449","volume":"29","author":"J Rao","year":"2000","unstructured":"Rao, J., Ross, K.A.: Making B+-Trees cache conscious in main memory. ACM SIGMOD Rec. 29(2), 475\u2013486 (2000)","journal-title":"ACM SIGMOD Rec."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Schlegel, B., Gemulla, R., Lehner, W.: k-ary search on modern processors. In: Proceedings of the Fifth International Workshop on Data Management on New Hardware - DaMoN 2009, p. 52. ACM Press, New York (2009)","DOI":"10.1145\/1565694.1565705"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/216585.216588","volume":"23","author":"WA Wulf","year":"1995","unstructured":"Wulf, W.A., McKee, S.A.: Hitting the memory wall. ACM SIGARCH Comput. Archit. News 23(1), 20\u201324 (1995)","journal-title":"ACM SIGARCH Comput. Archit. News"}],"container-title":["Lecture Notes in Computer Science","In Memory Data Management and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13960-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T14:21:28Z","timestamp":1717683688000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13960-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319139593","9783319139609"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13960-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"14 January 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}