{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:34:26Z","timestamp":1725557666355},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408062"},{"type":"electronic","value":"9783540452270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45227-0_15","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T19:57:53Z","timestamp":1277236673000},"page":"139-147","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Both Cache and Disk Performance of R-Trees"],"prefix":"10.1007","author":[{"given":"Myungsun","family":"Park","sequence":"first","affiliation":[]},{"given":"Sukho","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Preceedings of the 1990 ACM SIGMOD International Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.-P.: The Pyramid-Tree: Breaking the Curse of Dimensionality. In: Proceedings of the 1998 ACM SIGMOD International Conference, pp. 142\u2013153 (1998)","DOI":"10.1145\/276304.276318"},{"key":"15_CR3","unstructured":"Boncz, P., Manegold, S., Kersten, M.: Database Architecture Optimized for the new Bottleneck: Memory Access. In: Proceedings of 25th International Conference on Very Large Data Bases, pp. 54\u201365 (1999)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chen, S., Gibbons, P.B., Mowry, T.C.: Improving Index Performance through Prefetching. In: Proceedings of the 2001 ACM SIGMOD International Conference, pp. 235\u2013246 (2001)","DOI":"10.1145\/375663.375688"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chen, S., Gibbons, P.B., Mowry, T.C., Valentin, G.: Fractal Prefetching B\u2009+\u2009-Trees: Optimizing Both Cache and Disk Performance. In: Proceedings of the 2002 ACM SIGMOD International Conference, pp. 157\u2013168 (2002)","DOI":"10.1145\/564691.564710"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Kamel, I., Faloutsos, C.: On Packing R-trees. In: Proceedings of the 1993 ACM CIKM Conference, pp. 490\u2013499 (1993)","DOI":"10.1145\/170088.170403"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Kim, K., Cha, S., Kwon, K.: Optimizing Multidimensional Index Trees for Main Memory Access. In: Proceedings of the 2001 ACM SIGMOD International Conference, pp. 139\u2013150 (2001)","DOI":"10.1145\/375663.375679"},{"key":"15_CR8","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":"15_CR9","doi-asserted-by":"crossref","unstructured":"Rao, J., Ross, K.A.: Making B\u2009+\u2009-Trees Cache Conscious in Main Memory. In: Proceedings of the 2000 ACM SIGMOD International Conference, pp. 475\u2013486 (2000)","DOI":"10.1145\/342009.335449"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45227-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:54:53Z","timestamp":1559195693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45227-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408062","9783540452270"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45227-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}