I/O-Efficiency of Shortest Path Algorithms: An Analysis.
Bin Jiang:
I/O-Efficiency of Shortest Path Algorithms: An Analysis.
ICDE 1992: 12-19@inproceedings{DBLP:conf/icde/Jiang92,
author = {Bin Jiang},
editor = {Forouzan Golshani},
title = {I/O-Efficiency of Shortest Path Algorithms: An Analysis},
booktitle = {Proceedings of the Eighth International Conference on Data Engineering,
February 3-7, 1992, Tempe, Arizona},
publisher = {IEEE Computer Society},
year = {1992},
isbn = {0-8186-2545-7},
pages = {12-19},
ee = {db/conf/icde/Jiang92.html},
crossref = {DBLP:conf/icde/92},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
Copyright © 1992 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Forouzan Golshani (Ed.):
Proceedings of the Eighth International Conference on Data Engineering, February 3-7, 1992, Tempe, Arizona.
IEEE Computer Society 1992, ISBN 0-8186-2545-7
Contents BibTeX
References
- [1]
- Rakesh Agrawal:
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries.
IEEE Trans. Software Eng. 14(7): 879-885(1988) BibTeX
- [2]
- Rakesh Agrawal, Shaul Dar, H. V. Jagadish:
Direct Transitive Closure Algorithms: Design and Performance Evaluation.
ACM Trans. Database Syst. 15(3): 427-458(1990) BibTeX
- [3]
- Rakesh Agrawal, H. V. Jagadish:
Hybrid Transitive Closure Algorithms.
VLDB 1990: 326-334 BibTeX
- [4]
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
The Design and Analysis of Computer Algorithms.
Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX
- [5]
- ...
- [6]
- ...
- [7]
- ...
- [8]
- ...
- [9]
- ...
- [10]
- Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood:
G+: Recursive Queries Without Recursion.
Expert Database Conf. 1988: 645-666 BibTeX
- [11]
- Isabel F. Cruz, Theodore S. Norvell:
Aggregative Closure: An Extension of Transitive Closure.
ICDE 1989: 384-391 BibTeX
- [12]
- ...
- [13]
- Shaul Dar, Rakesh Agrawal:
Extending SQL with Generalized Transitive Closure Functionality.
IEEE Trans. Knowl. Data Eng. 5(5): 799-812(1993) BibTeX
- [14]
- ...
- [15]
- ...
- [16]
- ...
- [17]
- ...
- [18]
- ...
- [19]
- ...
- [20]
- ...
- [21]
- ...
- [22]
- ...
- [23]
- ...
- [24]
- ...
- [25]
- ...
- [26]
- ...
- [27]
- ...
- [28]
- ...
- [29]
- Yannis E. Ioannidis, Raghu Ramakrishnan:
Efficient Transitive Closure Algorithms.
VLDB 1988: 382-394 BibTeX
- [30]
- Bin Jiang:
Making the Partial Transitive Closure an Elementary Database Operation.
BTW 1989: 231-245 BibTeX
- [31]
- Bin Jiang:
A Suitable Algorithm for Computing Partial Transitive Closures in Databases.
ICDE 1990: 264-271 BibTeX
- [32]
- ...
- [33]
- Bin Jiang:
DFS-Traversing Graphs in a Paging Environment, LRU or MRU?
Inf. Process. Lett. 40(4): 193-196(1991) BibTeX
- [34]
- ...
- [35]
- Bin Jiang:
Traversing Graphs in a Paging Environment, BFS or DFS?
Inf. Process. Lett. 37(3): 143-147(1991) BibTeX
- [36]
- Donald B. Johnson:
A Note on Dijkstra's Shortest Path Algorithm.
J. ACM 20(3): 385-388(1973) BibTeX
- [37]
- Donald B. Johnson:
Efficient Algorithms for Shortest Paths in Sparse Networks.
J. ACM 24(1): 1-13(1977) BibTeX
- [38]
- ...
- [39]
- Kurt Mehlhorn, Stefan Näher:
LEDA: A Library of Efficient Data Types and Algorithms.
MFCS 1989: 88-106 BibTeX
- [40]
- ...
- [41]
- ...
- [42]
- ...
- [43]
- ...
- [44]
- Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola:
Traversal Recursion: A Practical Approach to Supporting Recursive Applications.
SIGMOD Conference 1986: 166-176 BibTeX
- [45]
- Hans-Jörg Schek, H.-Bernhard Paul, Marc H. Scholl, Gerhard Weikum:
The DASDBS Project: Objectives, Experiences, and Future Prospects.
IEEE Trans. Knowl. Data Eng. 2(1): 25-43(1990) BibTeX
- [46]
- Hans-Jörg Schek, Marc H. Scholl:
The relational model with relation-valued attributes.
Inf. Syst. 11(2): 137-147(1986) BibTeX
- [47]
- Harald Schöning:
Integrating Complex Objects and Recursion.
DOOD 1989: 573-592 BibTeX
- [48]
- Robert Endre Tarjan:
Depth-First Search and Linear Graph Algorithms.
SIAM J. Comput. 1(2): 146-160(1972) BibTeX
- [49]
- Patrick Valduriez:
Join Indices.
ACM Trans. Database Syst. 12(2): 218-246(1987) BibTeX
- [50]
- Henry S. Warren Jr.:
A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations.
Commun. ACM 18(4): 218-220(1975) BibTeX
- [51]
- Gerhard Weikum:
Set-Oriented Disk Access to Large Complex Objects.
ICDE 1989: 426-433 BibTeX
- [52]
- Gerhard Weikum, Peter Zabback, Peter Scheuermann:
Dynamic File Allocation in Disk Arrays.
SIGMOD Conference 1991: 406-415 BibTeX
- [53]
- ...
- [54]
- ...
Referenced by
- Shashi Shekhar, Duen-Ren Liu:
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations.
IEEE Trans. Knowl. Data Eng. 9(1): 102-119(1997)
- Shashi Shekhar, Duen-Ren Liu:
CCAM: A Connectivity-Clustered Access Method for Aggregate Queries on Transportation Networks: A Summary of Results.
ICDE 1995: 410-419
- Yannis E. Ioannidis, Raghu Ramakrishnan, Linda Winger:
Transitive Closure Algorithms Based on Graph Traversal.
ACM Trans. Database Syst. 18(3): 512-576(1993)
- Shashi Shekhar, Ashim Kohli, Mark Coyle:
Path Computation Algorithms for Advanced Traveller Information System (ATIS).
ICDE 1993: 31-39
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
ICDE Proceedings: Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:18:01 2009