The hvtree: A memory hierarchy aware version index

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 397-408

  Zhang, Rui ^a   Stradling, Martin ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; FORESTRY; MECHANISMS; MEMORY ARCHITECTURE;

CHAIN-MECHANISM; DIFFERENT SIZES; HIGH-EFFICIENCY; INDEX STRUCTURE; MAIN MEMORY; MEMORY HIERARCHY; TEMPORAL DATA; UNIQUE FEATURES;

TREES (MATHEMATICS);

COMPUTERS; FORESTRY; MATHEMATICS; OPTIMIZATION; TREES;

EID: 83055180515     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920894     Document Type: Article

References (20)

1. http://www.sdss.org/.
2. C.-H. Ang and K.-P. Tan. The interval b-tree. Inf. Process. Lett., 53(2):85-89, 1995.
3. R. Balasubramonian, D. Albonesi, A. Buyuktosunoglu, and S. Dwarkadas. Memory hierarchy reconfiguration for energy and performance in general-purpose processor architectures. In MICRO, pages 245-257, 2000.
4. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion b-tree. VLDB Journal, 5(4):264-275, 1996.
5. P. A. Bernstein, M. L. Brodie, S. Ceri, D. J. DeWitt, M. J. Franklin, H. Garcia-Molina, J. Gray, G. Held, J. M. Hellerstein, H. V. Jagadish, M. Lesk, D. Maier, J. F. Naughton, H. Pirahesh, M. Stonebraker, and J. D. Ullman. The asilomar report on database research. SIGMOD Record, 27(4):74-80, 1998.
6. M. C. Easton. Key-sequence data sets on inedible storage. IBM Journal of Research and Development, 30(3):230-241, 1986.
7. R. Elmasri, G. T. J.Wuu, and V. Kouramajian. The time index and the monotonic b+-tree. In Temporal Databases, pages 433-456. 1993.
8. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
9. R. A. Hankins and J. M. Patel. Effect of node size on the performance of cache-conscious b+-trees. In SIGMETRICS, pages 283-294. ACM, 2003.
10. P.-Å. Larson. Performance analysis of linear hashing with partial expansions. TODS, 7(4):566-587, 1982.
11. D. B. Lomet. Partial expansions for file organizations with an index. TODS, 12(1):65-84, 1987.
12. D. B. Lomet, M. Hong, R. V. Nehme, and R. Zhang. Transaction time indexing with version compression. PVLDB, 1(1), 2008.
13. D. B. Lomet and B. Salzberg. Access methods for multiversion data. In SIGMOD Conference, pages 315-324, 1989.
14. D. B. Lomet and B. Salzberg. The performance of a multiversion access method. In SIGMOD Conference, pages 353-363, 1990.
15. J. Rao and K. A. Ross. Cache conscious indexing for decision-support in main memory. In VLDB, 1999.
16. +-trees cache conscious in main memory. In SIGMOD Conference, 2000.
17. A. Shatdal, C. Kant, and J. F. Naughton. Cache conscious algorithms for relational query processing. In VLDB, 1994.
18. Y. Tao and D. Papadias. Mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In VLDB, pages 431-440, 2001.
19. P. Westerman. Data warehousing: using the Wal-Mart model. Morgan Kaufmann, 2001.
20. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. SIGPLAN Not., 26(6):30-44, 1991.