{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:31Z","timestamp":1725512011831},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717027"},{"type":"electronic","value":"9783540717034"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71703-4_32","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T00:31:22Z","timestamp":1186014682000},"page":"361-373","source":"Crossref","is-referenced-by-count":2,"title":["Construction of Tree-Based Indexes for Level-Contiguous Buffering Support"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Skopal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hoksza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslav","family":"Pokorn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"32_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.: Searching in High-Dimensional Spaces \u2013 Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Computing Surveys"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-45876-X_34","volume-title":"Advances in Database Technology - EDBT 2002","author":"T. Brinkhoff","year":"2002","unstructured":"Brinkhoff, T.: A Robust and Self-tuning Page-Replacement Strategy for Spatial Database Systems. In: Jensen, C.S., Jeffery, K.G., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, pp. 533\u2013552. Springer, Heidelberg (2002)"},{"issue":"3","key":"32_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/spe.4380200302","volume":"20","author":"S.D. Carson","year":"1990","unstructured":"Carson, S.D.: A system for adaptive disk rearrangement. Software - Practice and Experience (SPE)\u00a020(3), 225\u2013242 (1990)","journal-title":"Software - Practice and Experience (SPE)"},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001), doi:10.1145\/502807.502808","journal-title":"ACM Computing Surveys"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: VLDB\u201997, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44803-9_5","volume-title":"Advances in Databases and Information Systems","author":"A. Corral","year":"2001","unstructured":"Corral, A., Vassilakopoulos, M., Manolopoulos, Y.: The Impact of Buffering on Closest Pairs Queries Using R-Trees. In: Caplinskas, A., Eder, J. (eds.) ADBIS 2001. LNCS, vol.\u00a02151, pp. 41\u201354. Springer, Heidelberg (2001)"},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/1994.2022","volume":"9","author":"W. Effelsberg","year":"1984","unstructured":"Effelsberg, W., Haerder, T.: Principles of database buffer management. ACM Transastions on Database Systems (TODS)\u00a09(4), 560\u2013595 (1984), doi:10.1145\/1994.2022","journal-title":"ACM Transastions on Database Systems (TODS)"},{"issue":"2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998), doi:10.1145\/280277.280279","journal-title":"ACM Computing Surveys"},{"key":"32_CR9","unstructured":"Hettich, S., Bay, S.: The UCI KDD archive (1999), http:\/\/kdd.ics.uci.edu"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/1095810.1095836","volume-title":"ACM SOSP \u201905","author":"H. Huang","year":"2005","unstructured":"Huang, H., Hung, W., Shin, K.G.: FS2: dynamic data replication in free disk space for improving disk performance and energy consumption. In: ACM SOSP \u201905, Brighton, United Kingdom, pp. 263\u2013276. ACM Press, New York (2005), doi:10.1145\/1095810.1095836"},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/69.842248","volume":"12","author":"S.T. Leutenegger","year":"2000","unstructured":"Leutenegger, S.T., Lopez, M.A.: The Effect of Buffering on the Performance of R-Trees. IEEE Transaction on Knowledge and Data Engineering\u00a012(1), 33\u201344 (2000), doi:10.1109\/69.842248","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"issue":"3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1145\/68012.68016","volume":"14","author":"L.F. Mackert","year":"1989","unstructured":"Mackert, L.F., Lohman, G.M.: Index scans using a finite LRU buffer: a validated I\/O model. ACM Transactions on Database Systems (TODS)\u00a014(3), 401\u2013424 (1989), doi:10.1145\/68012.68016","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"32_CR13","first-page":"387","volume-title":"ACM SIGMOD","author":"R.T. Ng","year":"1991","unstructured":"Ng, R.T., Faloutsos, C., Sellis, T.K.: Flexible buffer allocation based on marginal gains. In: ACM SIGMOD, pp. 387\u2013396. ACM Press, New York (1991)"},{"key":"32_CR14","first-page":"297","volume-title":"ACM SIGMOD","author":"E.J. O\u2019Neil","year":"1993","unstructured":"O\u2019Neil, E.J., O\u2019Neil, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: ACM SIGMOD, Washington, D.C., United States, pp. 297\u2013306. ACM Press, New York (1993), doi:10.1145\/170035.170081"},{"key":"32_CR15","volume-title":"Database Management Systems","author":"R. Ramakrishnan","year":"2003","unstructured":"Ramakrishnan, R., Gehrke, J.: Database Management Systems, 3rd edn. McGraw-Hill, New York (2003)","edition":"3"},{"key":"32_CR16","unstructured":"Ruemmler, C., Wilkes, J.: Disk Shuffling. Technical Report HPL-CSP-91-30, Hewlett-Packard Laboratories (1991)"},{"key":"32_CR17","unstructured":"Schlosser, S.W., Schindler, J., Papadomanolakis, S., Shao, M., Ailamaki, A., Faloutsos, C., Granger, G.R.: On multidimensional data and modern disks. In: 4th USENIX Conference on File and Storage Technologies, pp. 225\u2013238 (2005)"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/11408079_73","volume-title":"Database Systems for Advanced Applications","author":"T. Skopal","year":"2005","unstructured":"Skopal, T., Pokorn\u00fd, J., Sn\u00e1\u0161el, V.: Nearest Neighbours Search Using the PM-Tree. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.\u00a03453, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"issue":"2","key":"32_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys\u00a033(2), 209\u2013271 (2001), citeseer.ist.psu.edu\/vitter01external.html","journal-title":"ACM Computing Surveys"},{"key":"32_CR20","first-page":"194","volume-title":"VLDB \u201998","author":"R. Weber","year":"1998","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB \u201998, pp. 194\u2013205. Morgan Kaufmann, San Francisco (1998)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/11681885_11","volume-title":"Trends in Enterprise Application Architecture","author":"B. Yu","year":"2006","unstructured":"Yu, B., Kim, S.H.: An efficient zoning technique for multi-dimensional access methods. In: Draheim, D., Weber, G. (eds.) TEAA 2005. LNCS, vol.\u00a03888, pp. 129\u2013143. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases: Concepts, Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71703-4_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T05:49:09Z","timestamp":1708148949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71703-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717027","9783540717034"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71703-4_32","relation":{},"subject":[]}}