Generating plans from proofs
We present algorithms for answering queries making use of information about source integrity constraints, access restrictions, and access costs. Our method can exploit the integrity constraints to find plans even when there is no direct access to relations appearing in the query. We look at differen...
Main Authors: | Benedikt, M, Tsamoura, E, Cate, B |
---|---|
Format: | Journal article |
Published: |
Association for Computing Machinery
2016
|
Similar Items
-
Generating collection transformations from proofs
by: Benedikt, M, et al.
Published: (2021) -
Goal-driven query answering for existential rules with equality
by: Benedikt, M, et al.
Published: (2018) -
PDQ 2.0: flexible infrastructure for integrating reasoning and query planning
by: Benedikt, M, et al.
Published: (2023) -
Reformulating queries: theory and practice
by: Benedikt, M, et al.
Published: (2017) -
Balancing expressiveness and inexpressiveness in view design
by: Benedikt, M, et al.
Published: (2020)