1. D. Lomet. B-tree Page Size When Caching is Considered. SIGMOD Record, 27(3):28--32 , Sept. 1998. (bibtex entry)

2. D. Lomet and B. Salzberg. Concurrency and recovery for index trees. VLDB Journal, 6(3):224--240, Aout 1997. Springer Verlag . (bibtex entry)

3. D. Lomet and B. Salzberg. Temporal Databases Theory, design, and implementation, chapter 16 - Transaction Time Databases, pages 388--417. Tansel, Clifford, Gadia, Jojodia, Segev, Snodgrass, 1993. The Benjamin Cummings Publishing, ISBN : 0-8053-2413-5 . (bibtex entry)

1. 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)

2. L. Jiang, B. Salzberg, D. Lomet, and M. Barrena. The BT-tree: A Branched and Temporal Access Method. In Proc. of the 26th Int. Conf. on Very Large Data Bases (VLDB'00), Cairo (Egypt), pages 451--460, 2000. (ftp://ftp.ccs.neu.edu/pub/people/salzberg/bttree.ps.gz ) (bibtex entry)

3. G. Evangelidis, D. Lomet, and B. Salzberg. The hB$^II$-tree: A Modified hB-tree Supportong Concurrency, Recovery and Node Consolidation. In Proc. 21st Int. Conf. on Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 551--561 , 1995. (bibtex entry)

1. D. Lomet and B. Salzberg. Media Recovery with Time-Split b-trees. Technical report, Digital Equipment Corporation - Cambridge Research Lab., Nov. 1991. CRL 91/9 . (bibtex entry)

BACK TO INDEX