Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Answering complex SQL queries using automatic summary tables
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Information integration using logical views
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Generating efficient plans for queries using views
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Decomposable negation normal form
Journal of the ACM (JACM)
An algorithm for answering queries efficiently using views
ADC '01 Proceedings of the 12th Australasian database conference
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Optimizing Recursive Information-Gathering Plans
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
MiniCon: A scalable algorithm for answering queries using views
The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A survey on knowledge compilation
AI Communications
Journal of Artificial Intelligence Research
Planning to gather inforrnation
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Query-answering algorithms for information agents
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Efficient Genome Wide Tagging by Reduction to SAT
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Journal of Artificial Intelligence Research
Querying structured information sources on the Web
International Journal of Metadata, Semantics and Ontologies
An expressive and efficient solution to the service selection problem
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Scalable query rewriting: a graph-based approach
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Towards scalable data integration under constraints
Proceedings of the 2012 Joint EDBT/ICDT Workshops
Optimizing query rewriting for multiple queries
Proceedings of the Ninth International Workshop on Information Integration on the Web
Hi-index | 0.00 |
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in the scope of emerging infrastructures such as WWW, Semantic Web, Grid, and P2P which require efficient algorithms. The problem is in general intractable, and the current algorithms do not scale well when the number of views or the size of the query grow. We show however that this problem can be encoded as a propositional theory in CNF such that its models are in correspondence with the rewritings of the query. The theory is then compiled into a normal form, that is called d-DNNF and supports several operations like model counting and enumeration in polynomial time (in the size of the compiled theory), for computing the rewritings. Although this method is also intractable in the general case, it is not necessarily so in all cases. We have developed, along these lines and from off-the-shelf propositional engines, novel algorithms for finding maximally-contained rewritings of the query given the set of accessible resources (views). The algorithms scale much better than the current state-of-the-art algorithm, the MiniCon algorithm, over a large number of benchmarks and show in some cases improvements in performance of a couple orders-of-magnitude.