Twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems
What people are saying - Write a review
We haven't found any reviews in the usual places.
The Complexity of Data Exchange
Inverting Schema Mappings
24 other sections not shown
acyclic algorithm APMA approximation arity assume attributes B-trees binary binary relation binding pattern bits Bloom filter cache-oblivious cluster complexity compute conjunctive queries consider constant constraints core corresponding cost count data exchange data streams data structure Datalog defined Definition denote dependencies distribution edges egds elements equivalent evaluation example Figure finite set first-order logic formula function given graph homomorphism input insert inverse Lemma logn lower bound multiset node NP-complete operators optimal path expression polynomial predicate probability problem Proc proof quantiles query answering query containment query plan query Q queues random rebalance red nodes Regular XPath relation symbol relational algebra result s-t tgds sample satisfies schema mapping Section solution source instance space subgoals subset subtree target Theorem tion transitive closure treewidth tuple Turing machine unary undecidable update variables XPath XPath-algebra