Global page replacement in spatial databases

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

Volumn 1134 LNCS, Issue , 1996, Pages 855-864

  Papadopoulos, Apostolos ^a   Manolopoulos, Yannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DECISION TREES; EXPERT SYSTEMS;

CACHING ALGORITHM; LEAST RECENTLY USED; PAGE REPLACEMENT; REPLACEMENT ALGORITHM; SPATIAL DATA STRUCTURE; SPATIAL DATABASE; SYNTHETIC DATASETS; TIME-PERIODS;

TREES (MATHEMATICS);

EID: 84899867739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0034737     Document Type: Conference Paper

References (18)

1. [Beck90] N. Beckmann, I-P. Kriegel and B. Seeger: 'The R*-tree: an efficient and robust method for points and rectangles", Proceedings of the 1990 ACM SIGMOD Conference, pp.322-331, Atlantic City, NJ, 1990.
2. [Chan92] C. Y. Chan, B. C. Ooi and H. Lu: 'Extensible buffer management of indexes", Proceedings of the 18th VLDB Conference, pp.444-454, VazLcouver, Canada 1992.
3. [Effe84] W. Effelsberg: "Principles of database buffer management", ACM Transactions on Database Systems, vol.9, no.4, pp.560-595, 1984.
4. [Gray94] J. Gray, S. Englert, K. Baclawski and P. Weinberger: 'The Quickly generating billion-record synthetic databases", Proceedings of the 1994 ACM SIGMOD Conference, pp.243-252, Minneapolis, M, 1994.
5. [Gunt89] O. Gunther: 'The design of the Cell tree: an object-oriented index structure for geometric databases", Proceedings of the 5th 1EEE Conference on Data Engineering, pp.598-615, Los Angeles, CA, 1989.
6. [Guti94] RH. Guting: "An introduction to spatial database systems", The VLDB Journal, vol.3, no.4, pp.357-399, 1994.
7. [Gutt84] A. Guttman: 'The R-trees: a dynamic index structure for spatial searching", Prooeedings of the 1984 ACM SIGMOD Conference, pp.47-57, Boston, MA, 1984.
8. [Henr89] A. Henrich, H.W. Six and P. Widmayer: 'The LSD-tree: spatial access to multidimensional point and non-point objects", Proceedings of the 15th VLDB Conference, pp.45-53, Amsterdam, Netherlands, 1989.
9. [John94] T. Johnson and D. Shasha: "2Q: a low overhead high performance buffer management replacement algorithm", Proceedings of the BOth VLDB Conference, pp.439-450, Santiago, Chile, 1994.
10. [Kame93] I. kamel and C. Faloutsos: The TV packing R-trees", Proceedings of the and Conference on Information and Knowledge Management (CIKM), Washington DC, 1993.
11. [Kame94] I. Kamel and C. Faloutsos: "Hilbert R-tree: an improved R-tree using Fractals", Proceedings of the 2Oth VLDB Conference, pp.500-509, Santiago, Chile, 1994.
12. [Laur92] R Laurini and D. Thompson: "Fundamentals of spatial information systems", Academic Press, London, 1992.
13. [Lin94] K. I Lin, H V. Jagadish and C. Faloatsos: 'the TV-tree: an index structure for high-dimensional data", The VLDB Journal, vol.3, pp.517-542, 1994.
14. [O'nei193] E. J. O'Neil, P. E. O'Neil and Gerhard Weikum: 'The LRU-K page replacement algorithm for database disk buffering", Proceedings of the 1993 ACM SIGMOD Conference, pp.297-306, Washington DC, 1993.
15. [Page93] B.U. Pagel, H.W. Six, H. Toben and P. Widmayer: 'The an analysis of range query performance in spatial data structures", Proceedings of the 1993 ACM PODS Conference, pp.214-221, Washington DC, 1993.
16. [Rons85] N. Roussopoulos and D. Leit'ker: 'The Direct spatial search on pictorial databases using packed R-trees", Proceedings of the 1985 ACM SIGMOD Conference, pp.17- 31, Austin, TX, 1985.
17. [Same90] H. Samet: "The design and analysis of Spatial data structures", Addison- Wesley, Reading, MA, 1990.
18. [Se1187] T. Sellis, N. Roussopoulos and C. Faloutsos: 'The R +-tree: a dynamic index for multidimensional objects", Proceedings of the 13th VLDB Conference, pp.507-518, Brighton, UK, 1987.