|
Kapali P. Eswaran:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Toshihide Ibaraki:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Toshihide Ibaraki cite Kapali P. EswaranOrdered by citing publication[Change the order to 'ordered by cited']
-
Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). [Citation Graph (2, 9)][DBLP] VLDB, 1983, pp:89-91 [Conf] Cites:
-
Toshihide Ibaraki, Tiko Kameda
On the Optimal Nesting Order for Computing N-Relational Joins. [Citation Graph (29, 15)][DBLP] ACM Trans. Database Syst., 1984, v:9, n:3, pp:482-502 [Journal] Cites:
-
Mike W. Blasgen, Kapali P. Eswaran
Storage and Access in Relational Data Bases. [Citation Graph (75, 0)][DBLP] IBM Systems Journal, 1977, v:16, n:4, pp:362-377 [Journal]
-
Morton M. Astrahan, Mike W. Blasgen, Donald D. Chamberlin, Kapali P. Eswaran, Jim Gray, Patricia P. Griffiths, W. Frank King III, Raymond A. Lorie, Paul R. McJones, James W. Mehl, Gianfranco R. Putzolu, Irving L. Traiger, Bradford W. Wade, Vera Watson
System R: Relational Approach to Database Management. [Citation Graph (238, 14)][DBLP] ACM Trans. Database Syst., 1976, v:1, n:2, pp:97-137 [Journal]
-
Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
Serializability with Constraints. [Citation Graph (2, 15)][DBLP] ACM Trans. Database Syst., 1987, v:12, n:3, pp:429-452 [Journal] Cites:
-
Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
Cautious Transaction Schedulers with Admission Control. [Citation Graph (3, 12)][DBLP] ACM Trans. Database Syst., 1985, v:10, n:2, pp:205-229 [Journal] Cites:
|