Title
Efficient Evaluation Of Traversal Recursive Queries Using Connectivity Index
Abstract
In this paper, we discuss a novel access structure called connectivity index which is designed for the efficient evaluation of traversal recursive queries over large acyclic graphs. Unlike the bottom-up evaluation methods, a unique feature of the proposed graph search approach is that it requires only a single-pass scan of the connectivity index file in evaluating traversal recursive queries.
Publication Date
1-1-1993
Publication Title
Proceedings - International Conference on Data Engineering
Number of Pages
549-558
Document Type
Article; Proceedings Paper
Identifier
scopus
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
0027311626 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/0027311626
STARS Citation
Hua, Kien A.; Su, Jeffrey X.W.; and Hua, Chau M., "Efficient Evaluation Of Traversal Recursive Queries Using Connectivity Index" (1993). Scopus Export 1990s. 780.
https://stars.library.ucf.edu/scopus1990/780