Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
An improvement on the complexity of factoring read-once Boolean functions
Discrete Applied Mathematics
World-set decompositions: Expressiveness and efficient algorithms
Theoretical Computer Science
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Size Bounds and Query Plans for Relational Joins
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Database Query Processing Using Finite Cursor Machines
Theory of Computing Systems
On the Readability of Monotone Boolean Formulae
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Parallel evaluation of conjunctive queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Probabilistic Databases
Classification of annotation semirings over query containment
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
FDB: a query engine for factorised relational databases
Proceedings of the VLDB Endowment
Demonstration of the FDB query engine for factorised databases
Proceedings of the VLDB Endowment
Semiring-annotated data: queries and provenance?
ACM SIGMOD Record
On minimal constraint networks
Artificial Intelligence
Efficient provenance storage for relational queries
Proceedings of the 21st ACM international conference on Information and knowledge management
Classification of annotation semirings over containment of conjunctive queries
ACM Transactions on Database Systems (TODS)
Aggregation and ordering in factorised databases
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We give two characterisations of conjunctive queries based on factorisations of their results whose nesting structure is defined by so-called factorisation trees. The first characterisation concerns sizes of factorised representations. For any query, we derive a size bound that is asymptotically tight within our class of factorisations. We also characterise the queries by tight bounds on the readability of the provenance of result tuples and define syntactically the class of queries with bounded readability.