Factoring augmented regular chain programs
Wood, Peter (1990) Factoring augmented regular chain programs. In: McLeod, D. and Sacks-Davis, R. and Schek, H.-O. (eds.) 16th International Conference on Very Large Data Bases. Morgan Kaufmann, pp. 255-263. ISBN 9781558601499.
Abstract
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use of regular expressions to specify constraints on paths in these graphs. When only constants are allowed in regular expressions, it has been shown that these queries can be evaluated efficiently. In this paper, we study the inclusion of variables in regular expressions. We show that efficient evaluation algorithms still exist, and in so doing provide a translation to a class of Datalog programs, the augmented regular chain programs, which can always be factored. This class of programs is incomparable to previously identified classes of factorable programs.
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 14:50 |
| Last Modified: | 09 Aug 2023 12:52 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/46465 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |