{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T07:14:21Z","timestamp":1792048461828,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425557","type":"print"},{"value":"9783540448037","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44803-9_5","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:15:48Z","timestamp":1178212548000},"page":"41-54","source":"Crossref","is-referenced-by-count":9,"title":["The Impact of Buffering on Closest Pairs Queries Using R-Trees"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Corral","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"5_CR1","unstructured":"W. Bridge, A. Joshi, M. Keihl, T. Lahiri, J. Loaiza and N. MacNaughton: \u201cThe Oracle Universal Server Buffer\u201d, Proc. 23rd VLDB Conf., pp. 590\u2013594, Athens, Greece, 1997."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger: \u201cThe R*-tree: and Efficient and Robust Access Method for Points and Rectangles\u201d, Proc. 1990 ACM SIGMOD Conf., pp. 322\u2013331, Atlantic City, NJ, 1990.","DOI":"10.1145\/93597.98741"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H.P. Kriegel and B. Seeger: \u201cEfficient Processing of Spatial Joins Using R-Trees\u201d. Proc. 1993 ACM SIGMOD Conf., pp. 237\u2013246, Washington, DC, 1993.","DOI":"10.1145\/170035.170075"},{"key":"5_CR4","unstructured":"H.T. Chou and D.J. DeWitt: \u201cAn Evaluation of Buffer Management Strategies for Relational Database Systems\u201d, Proc. 11th VLDB Conf., pp. 127\u2013141, Stockholm, Sweden, 1985."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: \u201cClosest Pair Queries in Spatial Databases\u201d, Proc. 2000 ACM SIGMOD Conf., pp. 189\u2013200, Dallas, TX, 2000.","DOI":"10.1145\/342009.335414"},{"key":"5_CR6","unstructured":"C.Y. Chan, B.C. Ooi and H. Lu: \u201cExtensible Buffer Management of Indexes\u201d, Proc. 18th VLDB Conf., pp. 444\u2013454, Vancouver, Canada, 1992."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"A. Corral, M. Vassilakopoulos and Y. Manolopoulos: \u201cAlgorithms for Joining R-Trees and Linear Region Quadtrees\u201d, Proc. 6th SSD Conf., pp. 251\u2013269, Hong Kong, China, 1999.","DOI":"10.1007\/3-540-48482-5_16"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"A. Corral, M. Vassilakopoulos and Y. Manolopoulos: \u201cThe Impact of Buffering on Closest Pairs Queries using R-trees\u201d, Technical Report, Dept. of Informatics, Aristotle University of Thessaloniki, February 2001.","DOI":"10.1007\/3-540-44803-9_5"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/1994.2022","volume":"9","author":"W. Effelsberg","year":"1984","unstructured":"W. Effelsberg and T. Harder: \u201cPrinciples of Database Buffer Management\u201d, ACM Transactions on Database Systems, Vol. 9, No. 4, pp. 560\u2013595, 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"A. Guttman: \u201cR-trees: A Dynamic Index Structure for Spatial Searching\u201d, Proc. 1984 ACM SIGMOD Conf., pp. 47\u201357, Boston, MA, 1984.","DOI":"10.1145\/602259.602266"},{"key":"5_CR11","unstructured":"Y.W. Huang, N. Jing and E.A. Rundensteiner: \u201cSpatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations\u201d, Proc. 23rd VLDB Conf., pp. 396\u2013405, Athens, Greece, 1997."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"G.R. Hjaltason and H. Samet: \u201cIncremental Distance Join Algorithms for Spatial Databases\u201d, Proc. 1998 ACM SIGMOD Conf., pp. 237\u2013248, Seattle, WA, 1998.","DOI":"10.1145\/276304.276326"},{"key":"5_CR13","unstructured":"T. Johnson and D. Shasha: \u201c2Q: a Low Overhead High Performance Buffer Management Replacement Algorithm\u201d, Proc. 20th VLDB Conf., pp. 439\u2013450, Santiago, Chile, 1994."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"S.T. Leutenegger and M.A. Lopez: \u201cThe Effect of Buffering on the Performance of R-Trees\u201d. Proc. ICDE Conf., pp. 164\u2013171, Orlando, FL, 1998.","DOI":"10.1109\/ICDE.1998.655772"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"E.J. O\u2019Neil, P.E. O\u2019Neil and G. Weikum: \u201cThe LRU-K Page Replacement Algorithm for Database Disk Buffering\u201d, Proc. 1993 ACM SIGMOD Conf., pp. 297\u2013306, Washington, DC, 1993.","DOI":"10.1145\/170035.170081"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"A. Papadopoulos and Y. Manolopoulos: \u201cGlobal Page Replacement in Spatial Databases\u201d, Proc. DEXA\u201996, Conf., pp. 855\u2013864, Zurich, Switzerland, 1996.","DOI":"10.1007\/BFb0034737"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"A. Papadopoulos, P. Rigaux and M. Scholl: \u201cA Performance Evaluation of Spatial Join Processing Strategies\u201d, Proc. 6th SSD Conf., pp. 286\u2013307, Hong Kong, China, 1999.","DOI":"10.1007\/3-540-48482-5_18"},{"key":"5_CR18","unstructured":"G.M. Sacco: \u201cIndex Access with a Finite Buffer\u201d, Proc. 13th VLDB Conf., pp. 301\u2013309, Brighton, England, 1987."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"M. Stonebraker, J. Frew, K. Gardels and J. Meredith: \u201cThe Sequoia 2000 Benchmark\u201d, Proc. 1993 ACM SIGMOD Conf., pp. 2\u201311, Washington, DC, 1993.","DOI":"10.1145\/170035.170038"},{"key":"5_CR20","unstructured":"G.M. Sacco and M. Schkolnick: \u201cA Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model\u201d, Proc. 8th VLDB Conf., pp. 257\u2013262, 1982."}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44803-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:34:00Z","timestamp":1556386440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44803-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425557","9783540448037"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44803-9_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}