1. K. Kato. Persistently Cached B-Trees. IEEE Trans. on Knowledge and Data Eng. (TKDE), 15(3):706-720, May/June 2003. (http://www.osss.is.tsukuba.ac.jp/kato/files/2001-04-tkde.pdf ) (bibtex entry)

1. S. Hwang, K. Kwon, S.K. Cha, and B.S. Lee. Performance Evaluation of Main-Memory R-tree Variants. In Proc. of Advances in Spatial and Temporal Databases, 8th International Symposium (SSTD 2003), Santorini Island (Greece), pages 10--27, July 2003. Lecture Notes in Computer Science 2750 Springer 2003 . (bibtex entry)

2. L. Jiang, B. Salzberg, D. Lomet, and M. Barrena. The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure. In 8th Int. Symp. on Spatial and Temporal Databases (SSTD 2003), Santorini Island (Greece), July 2003. (http://www.ccs.neu.edu/research/dblab/publications/jiang.pdf ) (bibtex entry)

3. K-T. Lee, I. Jung, and C-Y. Choi. Design and Implementation of a Cache-Conscious Index Manager for the Tachyon, a Main Memory DBMS. In 27th Annual Int. Computer Software and Applications Conf., Dallas, Texas (USA), Nov. 2003. (bibtex entry)

BACK TO INDEX