{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:54:16Z","timestamp":1725515656503},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387096797"},{"type":"electronic","value":"9780387096803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09680-3_17","type":"book-chapter","created":{"date-parts":[[2008,7,21]],"date-time":"2008-07-21T07:37:14Z","timestamp":1216625834000},"page":"241-255","source":"Crossref","is-referenced-by-count":4,"title":["Cache-sensitive Memory Layout for Binary Trees"],"prefix":"10.1007","author":[{"given":"Riku","family":"Saikkonen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Rao, J., Ross, K.A.: Making B+\u2212trees cache conscious in main memory. In: 2000 ACM SIGMOD International Conference on Management of Data, ACM Press (2000) 475\u2013486","DOI":"10.1145\/342009.335449"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Hankins, R.A., Patel, J.M.: Effect of node size on the performance of cache-conscious B+\u2212trees. In: 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, ACM Press (2003) 283\u2013294","DOI":"10.1145\/781027.781063"},{"key":"17_CR3","unstructured":"Rao, J., Ross, K.A.: Cache conscious indexing for decision-support in main memory. In: 25th International Conference on Very Large Data Bases (VLDB 1999), Morgan Kaufmann (1999) 78\u201389"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chen, S., Gibbons, P.B., Mowry, T.C.: Improving index performance through prefetching. In: 2001 ACM SIGMOD International Conference on Management of Data, ACM Press (2001) 235\u2013246","DOI":"10.1145\/375663.375688"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bohannon, P., McIlroy, P., Rastogi, R.: Main-memory index structures with fixed-size partial keys. In: 2001 ACM SIGMOD International Conference on Management of Data, ACM Press (2001) 163\u2013174","DOI":"10.1145\/375663.375681"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Rahman, N., Cole, R., Raman, R.: Optimised predecessor data structures for internal memory. In: 5th Workshop on Algorithm Engineering (WAE 2001). Volume 2141 of Lecture Notes in Computer Science., Springer-Verlag (2001) 67\u201378","DOI":"10.1007\/3-540-44688-5_6"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Chen, S., Gibbons, P.B., Mowry, T.C., Valentin, G.: Fractal prefetching B+\u2212trees: Optimizing both cache and disk performance. In: 2002 ACM SIGMOD International Conference on Management of Data, ACM Press (2002) 157\u2013168","DOI":"10.1145\/564691.564710"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/S0097539701389956","volume":"35","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. SIAM Journal on Computing 35(2) (2005) 341\u2013358","journal-title":"SIAM Journal on Computing"},{"key":"17_CR9","unstructured":"Brodal, G.S., Fagerberg, R., Jacob, R.: Cache oblivious search trees via binary trees of small height. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), Society for Industrial and Applied Mathematics (2002) 39\u201348"},{"key":"17_CR10","unstructured":"Bender, M.A., Duan, Z., Iacono, J., Wu, J.: A locality-preserving cache-oblivious dynamic dictionary. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), Society for Industrial and Applied Mathematics (2002) 29\u201338"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Jiang, W., Ding, C., Cheng, R.: Memory access analysis and optimization approaches on splay trees. In: 7th Workshop on Languages, Compilers and Run-time Support for Scalable Systems, ACM Press (2004) 1\u20136","DOI":"10.1145\/1066650.1066655"},{"key":"17_CR12","unstructured":"Oksanen, K., Malmi, L.: Memory reference locality and periodic relocation in main memory search trees. In: 5th Hellenic Conference of Informatics, Greek Computer Society (1995)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Demaine, E.D., Farach-Colton, M.: Efficient tree layout in a multilevel memory hierarchy. In: 10th Annual European Symposium on Algorithms (ESA 2002). Volume 2461 of Lecture Notes in Computer Science., Springer-Verlag (2002) 165\u2013173","DOI":"10.1007\/3-540-45749-6_18"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Brodal, G.S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J., L\u00f3pez-Ortiz, A.: The cost of cache-oblivious searching. In: 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), IEEE Computer Society (2003) 271\u2013282","DOI":"10.1109\/SFCS.2003.1238201"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Soisalon-Soininen, E., Widmayer, P.: Concurrency and recovery in full-text indexing. In: String Processing and Information Retrieval Symposium (SPIRE 1999), IEEE Computer Society (1999) 192\u2013198","DOI":"10.1109\/SPIRE.1999.796595"},{"key":"17_CR16","unstructured":"Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann (1993)"}],"container-title":["IFIP International Federation for Information Processing","Fifth Ifip International Conference On Theoretical Computer Science \u2013 Tcs 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09680-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:44:31Z","timestamp":1619559871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09680-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387096797","9780387096803"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3_17","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[]}}