The impact of buffering on closest pairs queries using r-trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2151, Issue , 2001, Pages 41-54

  Corral, Antonio ^a   Vassilakopoulos, Michael ^b   Manolopoulos, Yannis ^c  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^c UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; DECISION TREES; FORESTRY; INFORMATION SYSTEMS; INFORMATION USE; QUERY PROCESSING;

BRANCH-AND-BOUND ALGORITHMS; BUFFER SIZES; BUFFER STRUCTURES; K-CLOSEST PAIRS; PAGE REPLACEMENT; PAGE REPLACEMENT ALGORITHMS; RECURSIVE ALGORITHMS; SPATIAL DATASETS;

ITERATIVE METHODS;

EID: 84948989773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44803-9_5     Document Type: Conference Paper

References (20)

1. W. Bridge, A. Joshi, M. Keihl, T. Lahiri, J. Loaiza and N. MacNaughton: "The Or-acle Universal Server Buffer", Proc. 23rd VLDB Conf., pp.590-594, Athens, Greece, 1997.
2. N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger: "The R*-tree: and Efficient and Robust Access Method for Points and Rectangles", Proc. 1990 ACM SIGMOD Conf., pp.322-331, Atlantic City, NJ, 1990.
3. T. Brinkhoff, H.P. Kriegel and B. Seeger: "Eficient Processing of Spatial Joins Using R-Trees". Proc. 1993 ACM SIGMOD Conf., pp.237-246, Washington, DC, 1993.
4. H.T. Chou and D.J. DeWitt: "An Evaluation of Buffer Management Strategies for Relational Database Systems", Proc. 11th VLDB Conf., pp.127-141, Stockholm, Sweden, 1985.
5. A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: "Closest Pair Queries in Spatial Databases", Proc. 2000 ACM SIGMOD Conf., pp.189-200, Dallas, TX, 2000.
6. C.Y. Chan, B.C. Ooi and H. Lu: "Extensible Buffer Management of Indexes", Proc. 18th VLDB Conf., pp.444-454, Vancouver, Canada, 1992.
7. A. Corral, M. Vassilakopoulos and Y. Manolopoulos: "Algorithms for Joining R-Trees and Linear Region Quadtrees", Proc. 6th SSD Conf., pp.251-269, Hong Kong, China, 1999.
8. A. Corral, M. Vassilakopoulos and Y. Manolopoulos: "The Impact of Buffering on Closest Pairs Queries using R-trees", Technical Report, Dept. of Informatics, Aristotle University of Thessaloniki, February 2001.
9. W. Effelsberg and T. Harder: "Principles of Database Buffer Management", ACM Transactions on Database Systems, Vol.9, No.4, pp.560-595, 1984.
10. A. Guttman: "R-trees: A Dynamic Index Structure for Spatial Searching", Proc. 1984 ACM SIGMOD Conf., pp.47-57, Boston, MA, 1984.
11. Y.W. Huang, N. Jing and E.A. Rundensteiner: "Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations", Proc. 23rd VLDB Conf., pp.396-405, Athens, Greece, 1997.
12. G.R. Hjaltason and H. Samet: "Incremental Distance Join Algorithms for Spatial Databases", Proc. 1998 ACM SIGMOD Conf., pp.237-248, Seattle, WA, 1998.
13. T. Johnson and D. Shasha: "2Q: a Low Overhead High Performance Bu_er Man-agement Replacement Algorithm", Proc. 20th VLDB Conf., pp.439-450, Santiago, Chile, 1994.
14. S.T. Leutenegger and M.A. Lopez: "The Effect of Buffering on the Performance of R-Trees". Proc. ICDE Conf., pp.164-171, Orlando, FL, 1998.
15. E.J. O'Neil, P.E. O'Neil and G. Weikum: "The LRU-K Page Replacement Algo-rithm for Database Disk Buffering", Proc. 1993 ACM SIGMOD Conf., pp.297-306, Washington, DC, 1993.
16. A. Papadopoulos and Y. Manolopoulos: "Global Page Replacement in Spatial Databases", Proc. DEXA'96, Conf., pp.855-864, Zurich, Switzerland, 1996.
17. A. Papadopoulos, P. Rigaux and M. Scholl: "A Performance Evaluation of Spatial Join Processing Strategies", Proc. 6th SSD Conf., pp.286-307, Hong Kong, China, 1999.
18. G.M. Sacco: "Index Access with a Finite Buffer", Proc. 13th VLDB Conf., pp.301-309, Brighton, England, 1987.
19. M. Stonebraker, J. Frew, K. Gardels and J. Meredith: "The Sequoia 2000 Bench-mark", Proc. 1993 ACM SIGMOD Conf., pp.2-11, Washington, DC, 1993.
20. G.M. Sacco and M. Schkolnick: "A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model", Proc. 8th VLDB Conf., pp.257-262, 1982.