Barcelo, P. and Hurtado, C.A. and Libkin, L. and Wood, Peter T. (2010) Expressive languages for path queries over graph-structured data. In: UNSPECIFIED (ed.) Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems of Data. New York, USA: ACM Publications, pp. 3-14. ISBN 9781450300339.
Abstract
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.), the power of standard languages such as the widely studied conjunctive regular path queries (CRPQs) is insufficient in at least two ways. First, they cannot output paths and second, more crucially, they cannot express relations among paths. We thus propose a class of extended CRPQs, called ECRPQs, which add regular relations on tuples of paths, and allow path variables in the heads of queries. We provide several examples of their usefulness in querying graph structured data, and study their properties. We analyze query evaluation and representation of tuples of paths in the output by means of automata. We present a detailed analysis of data and combined complexity of queries, and consider restrictions that lower the complexity of ECRPQs to that of relational conjunctive queries. We study the containment problem, and look at further extensions with first-order features, and with non-regular relations that express arithmetic properties of paths, based on the lengths and numbers of occurrences of labels.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Sarah Hall |
| Date Deposited: | 29 Aug 2013 14:52 |
| Last Modified: | 09 Aug 2023 12:34 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/8058 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
