Kikot, Stanislav and Kontchakov, Roman and Rapisarda, Salvatore and Zakharyaschev, Michael (2018) STYPES: nonrecursive datalog rewriter for linear TGDs and conjunctive queries. In: Panetto, H. and Debruyne, C. and Proper, H. and Ardagna, C. and Roman, D. and Meersman, R. (eds.) On the Move to Meaningful Internet Systems. OTM 2018 Conferences. LNCS 11230. Springer, pp. 441-460. ISBN 9783030026707.
|
Text
cr.pdf - Author's Accepted Manuscript Download (322kB) | Preview |
Abstract
We present STYPES, a system that rewrites ontology-mediated queries with linear tuple-generating dependencies and conjunctive queries to equivalent nonrecursive datalog (NDL) queries. The main feature of STYPES is that it produces polynomial-size rewritings whenever the treewidth of the input conjunctive queries and the size of the chases for the ontology atoms as well as their arity are bounded; moreover, the rewritings can be constructed and executed in LOGCFL, indicating high parallelisability in theory. We show experimentally that Apache Flink on a cluster of machines with 20 virtual CPUs is indeed able to parallelise execution of a series of NDL-rewritings constructed by STYPES, with the time decreasing proportionally to the number of CPUs available.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | Confederated International Conferences: CoopIS, C&TC, and ODBASE 2018, Valletta, Malta, October 22-26, 2018, Proceedings, Part I |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 19 Oct 2018 08:13 |
| Last Modified: | 09 Aug 2023 12:44 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/24097 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
