Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index.
Kien A. Hua, Jeffrey X. W. Su, Chau M. Hua:
Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index.
ICDE 1993: 549-558@inproceedings{DBLP:conf/icde/HuaS93,
author = {Kien A. Hua and
Jeffrey X. W. Su and
Chau M. Hua},
title = {Efficient Evaluation of Traversal Recursive Queries Using Connectivity
Index},
booktitle = {Proceedings of the Ninth International Conference on Data Engineering,
April 19-23, 1993, Vienna, Austria},
publisher = {IEEE Computer Society},
year = {1993},
isbn = {0-8186-3570-3},
pages = {549-558},
ee = {db/conf/icde/HuaS93.html},
crossref = {DBLP:conf/icde/93},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
Copyright © 1993 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
Proceedings of the Ninth International Conference on Data Engineering, April 19-23, 1993, Vienna, Austria.
IEEE Computer Society 1993, ISBN 0-8186-3570-3
Contents BibTeX
References
- [1]
- François Bancilhon, Raghu Ramakrishnan:
An Amateur's Introduction to Recursive Query Processing Strategies.
SIGMOD Conference 1986: 16-52 BibTeX
- [2]
- Jay Banerjee, Won Kim, Sung-Jo Kim, Jorge F. Garza:
Clustering a DAG for CAD Databases.
IEEE Trans. Software Eng. 14(11): 1684-1699(1988) BibTeX
- [3]
- ...
- [4]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
- [5]
- Per-Åke Larson, Vinay Deshpande:
A File Structure Supporting Traversal Recursion.
SIGMOD Conference 1989: 243-252 BibTeX
- [6]
- ...
- [7]
- A. Perko:
On Implicit Data Structures for Priority Queues.
Softw., Pract. Exper. 15(1): 55-57(1985) BibTeX
- [8]
- Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola:
Traversal Recursion: A Practical Approach to Supporting Recursive Applications.
SIGMOD Conference 1986: 166-176 BibTeX
- [9]
- Patrick Valduriez:
Join Indices.
ACM Trans. Database Syst. 12(2): 218-246(1987) BibTeX
- [10]
- Patrick Valduriez, Setrag Khoshafian:
Parallel Evaluation of the Transitive Closure of a Database Relation.
International Journal of Parallel Programming 17(1): 19-37(1988) BibTeX
Referenced by
- Ning Jing, Yun-Wu Huang, Elke A. Rundensteiner:
Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation.
IEEE Trans. Knowl. Data Eng. 10(3): 409-432(1998)
- 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)
- Sakti Pramanik, Sungwon Jung:
Description and Identification of Distributed Fragments of Recursive Relations.
IEEE Trans. Knowl. Data Eng. 8(6): 1002-1016(1996)
- Sungwon Jung, Sakti Pramanik:
HiTi Graph Model of Topographical Roadmaps in Navigation Systems.
ICDE 1996: 76-84
- 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
- Sungwon Jung, Sakti Pramanik:
An Efficient Representation of Distributed Fragments of Recursive Relations.
DASFAA 1995: 397-404
- Shaul Dar, Raghu Ramakrishnan:
A Performance Study of Transitive Closure Algorithms.
SIGMOD Conference 1994: 454-465
- Rakesh Agrawal, Jerry Kiernan:
An Access Structure for Generalized Transitive Closure Queries.
ICDE 1993: 429-438
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:11 2009