|
Philip L. Lehman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Michael J. Carey:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Michael J. Carey cite Philip L. LehmanOrdered by citing publication[Change the order to 'ordered by cited']
-
Paul M. Bober, Michael J. Carey
Indexing Alternatives for Multiversion Locking. [Citation Graph (0, 22)][DBLP] EDBT, 1994, pp:145-158 [Conf] Cites:
-
V. Srinivasan, Michael J. Carey
Performance of On-Line Index Construction Algorithms. [Citation Graph (8, 13)][DBLP] EDBT, 1992, pp:293-309 [Conf] Cites:
-
V. Srinivasan, Michael J. Carey
Performance of B-Tree Concurrency Algorithms. [Citation Graph (15, 19)][DBLP] SIGMOD Conference, 1991, pp:416-425 [Conf] Cites:
-
Markos Zaharioudakis, Michael J. Carey
Highly Concurrent Cache Consistency for Indices in Client-Server Database Systems. [Citation Graph (0, 14)][DBLP] SIGMOD Conference, 1997, pp:50-61 [Conf] Cites:
-
Paul M. Bober, Michael J. Carey
Indexing for Multiversion Locking: Alternatives and Performance Evaluation. [Citation Graph (0, 24)][DBLP] IEEE Trans. Knowl. Data Eng., 1997, v:9, n:1, pp:68-84 [Journal] Cites:
-
V. Srinivasan, Michael J. Carey
Performance of B+ Tree Concurrency Algorithms [Citation Graph (2, 29)][DBLP] VLDB J., 1993, v:2, n:4, pp:361-406 [Journal] Cites:
-
H. T. Kung, Philip L. Lehman
Concurrent Manipulation of Binary Search Trees. [Citation Graph (21, 17)][DBLP] ACM Trans. Database Syst., 1980, v:5, n:3, pp:354-382 [Journal]
-
Philip L. Lehman, S. Bing Yao
Efficient Locking for Concurrent Operations on B-Trees. [Citation Graph (63, 12)][DBLP] ACM Trans. Database Syst., 1981, v:6, n:4, pp:650-670 [Journal]
|