Rudolf Bayer :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
David B. Lomet :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Which papers of David B. Lomet cite Rudolf Bayer Ordered by citing publication [Change the order to 'ordered by cited' ]
Gennady Antoshenkov , David B. Lomet , James Murray Order Preserving Compression. [Citation Graph (1, 7)][DBLP ] ICDE, 1996, pp:655-663 [Conf ] Cites:
Rudolf Bayer , Edward M. McCreight Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP ] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal ]
Rudolf Bayer , Karl Unterauer Prefix B-Trees. [Citation Graph (27, 6)][DBLP ] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal ]
Witold Litwin , David B. Lomet The Bounded Disorder Access Method. [Citation Graph (7, 16)][DBLP ] ICDE, 1986, pp:38-48 [Conf ] Cites:
Rudolf Bayer , Edward M. McCreight Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP ] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal ]
Rudolf Bayer , Karl Unterauer Prefix B-Trees. [Citation Graph (27, 6)][DBLP ] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal ]
David B. Lomet Multi-Table Search for B-Tree Files. [Citation Graph (3, 4)][DBLP ] SIGMOD Conference, 1979, pp:35-42 [Conf ] Cites:
Rudolf Bayer , Edward M. McCreight Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP ] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal ]
Rudolf Bayer , Karl Unterauer Prefix B-Trees. [Citation Graph (27, 6)][DBLP ] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal ]
David B. Lomet A High Performance, Universal, Key Associative Access Method. [Citation Graph (7, 7)][DBLP ] SIGMOD Conference, 1983, pp:120-133 [Conf ] Cites:
Rudolf Bayer , Edward M. McCreight Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP ] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal ]
Rudolf Bayer , Karl Unterauer Prefix B-Trees. [Citation Graph (27, 6)][DBLP ] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal ]
David B. Lomet , Betty Salzberg Access Method Concurrency with Recovery. [Citation Graph (20, 12)][DBLP ] SIGMOD Conference, 1992, pp:351-360 [Conf ] Cites:
Georgios Evangelidis , David B. Lomet , Betty Salzberg The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation. [Citation Graph (8, 20)][DBLP ] VLDB, 1995, pp:551-561 [Conf ] Cites:
Rudolf Bayer , Edward M. McCreight Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP ] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal ]
Rudolf Bayer , Mario Schkolnick Concurrency of Operations on B-Trees. [Citation Graph (66, 0)][DBLP ] Acta Inf., 1977, v:9, n:, pp:1-21 [Journal ]
David B. Lomet Digital B-Trees [Citation Graph (15, 9)][DBLP ] VLDB, 1981, pp:333-344 [Conf ] Cites:
Rudolf Bayer , Edward M. McCreight Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP ] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal ]
Rudolf Bayer , Karl Unterauer Prefix B-Trees. [Citation Graph (27, 6)][DBLP ] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal ]
David B. Lomet , Betty Salzberg Exploiting A History Database for Backup. [Citation Graph (3, 11)][DBLP ] VLDB, 1993, pp:380-390 [Conf ] Cites:
David B. Lomet , Mark R. Tuttle Redo Recovery after System Crashes. [Citation Graph (10, 12)][DBLP ] VLDB, 1995, pp:457-468 [Conf ] Cites:
David B. Lomet Bounded Index Exponential Hashing. [Citation Graph (16, 8)][DBLP ] ACM Trans. Database Syst., 1983, v:8, n:1, pp:136-165 [Journal ] Cites:
David B. Lomet Partial Expansions for File Organizations with an Index. [Citation Graph (17, 11)][DBLP ] ACM Trans. Database Syst., 1987, v:12, n:1, pp:65-84 [Journal ] Cites:
David B. Lomet A Simple Bounded Disorder File Organization with Good Performance. [Citation Graph (13, 10)][DBLP ] ACM Trans. Database Syst., 1988, v:13, n:4, pp:525-551 [Journal ] Cites:
Rudolf Bayer , Edward M. McCreight Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP ] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal ]
Rudolf Bayer , Karl Unterauer Prefix B-Trees. [Citation Graph (27, 6)][DBLP ] ACM Trans. Database Syst., 1977, v:2, n:1, pp:11-26 [Journal ]
David B. Lomet , Betty Salzberg The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. [Citation Graph (47, 15)][DBLP ] ACM Trans. Database Syst., 1990, v:15, n:4, pp:625-658 [Journal ] Cites:
Georgios Evangelidis , David B. Lomet , Betty Salzberg The hB-Pi-Tree: A Multi-Attribute Index Supporting Concurrency, Recovery and Node Consolidation. [Citation Graph (2, 23)][DBLP ] VLDB J., 1997, v:6, n:1, pp:1-25 [Journal ] Cites:
Rudolf Bayer , Edward M. McCreight Organization and Maintenance of Large Ordered Indices [Citation Graph (153, 0)][DBLP ] Acta Inf., 1972, v:1, n:, pp:173-189 [Journal ]
Rudolf Bayer , Mario Schkolnick Concurrency of Operations on B-Trees. [Citation Graph (66, 0)][DBLP ] Acta Inf., 1977, v:9, n:, pp:1-21 [Journal ]
David B. Lomet , Betty Salzberg Concurrency and Recovery for Index Trees. [Citation Graph (2, 20)][DBLP ] VLDB J., 1997, v:6, n:3, pp:224-240 [Journal ] Cites: