Cruz, I.F. and Mendelzon, A.O. and Wood, Peter (1987) A graphical query language supporting recursion. In: Dayal, U. and Traiger, I.L. (eds.) Proceedings of the Association for Computing Machinery Special Interest Group on Management of Data 1987 Annual Conference. Association for Computing Machinery, pp. 323-330. ISBN 9780897912365.
Abstract
We define a language G for querying data represented as a labeled graph G. By considering G as a relation, this graphical query language can be viewed as a relational query language, and its expressive power can be compared to that of other relational query languages. We do not propose G as an alternative to general purpose relational query languages, but rather as a complementary language in which recursive queries are simple to formulate. The user is aided in this formulation by means of a graphical interface. The provision of regular expressions in G allows recursive queries more general than transitive closure to be posed, although the language is not as powerful as those based on function-free Horn clauses. However, we hope to be able to exploit well-known graph algorithms in evaluating recursive queries efficiently, a topic which has received widespread attention recently.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 25 Oct 2021 15:24 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46470 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
