Bounded Query Rewriting Using Views
international conference on management of data, pp. 6:1-6:46, 2018.
Bounded rewriting big data complexity
A query Q has a bounded rewriting using a set of views if there exists a query Q' expressed in the same language as Q, such that given a dataset D, Q(D) can be computed by Q' that accesses only cached views and a small fraction DQ of D. We consider datasets D that satisfy a set of access constraints, a combination of cardinality constrain...More
Full Text (Upload PDF)
PPT (Upload PPT)