Abstract

In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest form, conjunctive queries and views, which already is NP-complete. Our context is data integration, so we search for maximally-contained rewritings. By looking at the problem from a graph perspective we are able to gain a better insight and develop an algorithm which compactly represents common patterns in the source descriptions, and (optionally) pushes some computation offline. This together with other optimizations result in an experimental performance about two orders of magnitude faster than current state-of-the-art algorithms, rewriting queries using over 10000 views within seconds.

Metadata

publication

Proceedings of SIGMOD 2011 International conference on Management of data …, 2011

year

2011

publication date

2011/6/12

authors

George Konstantinidis, José Luis Ambite

link

https://dl.acm.org/doi/abs/10.1145/1989323.1989335

resource_link

https://www.cs.ox.ac.uk/people/george.konstantinidis/hdmsKonstantinidis.pdf

conference

Proceedings of SIGMOD 2011 International conference on Management of data

pages

97-108

publisher

ACM