On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Machine Learning
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
Putting context into schema matching
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the complexity of deriving schema mappings from database instances
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Positive--Negative Partial Set Cover problem
Information Processing Letters
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Complexity of two-level logic minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Human-assisted graph search: it's okay to ask questions
Proceedings of the VLDB Endowment
Designing and refining schema mappings via data examples
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Spreadsheet table transformations from examples
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Learning semantic string transformations from examples
Proceedings of the VLDB Endowment
Spreadsheet data manipulation using examples
Communications of the ACM
Learning twig and path queries
Proceedings of the 15th International Conference on Database Theory
Proceedings of the 15th International Conference on Database Theory
Certain and possible XPath answers
Proceedings of the 16th International Conference on Database Theory
Schema mappings and data examples
Proceedings of the 16th International Conference on Extending Database Technology
Learning and verifying quantified boolean queries by example
Proceedings of the 32nd symposium on Principles of database systems
Reverse engineering complex join queries
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Learning queries for relational, semi-structured, and graph databases
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.02 |
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view query is restricted to a specific family of queries. We study the tradeoffs among succintness, level of approximation, and the family of queries through algorithms and complexity results. For each family of queries, we address three variants of the VDP: (1) Does there exist an exact view definition, and if so find it. (2) Find the best view definition, i.e., one as close to the input view instance as possible, and as succinct as possible. (3) Find an approximate view definition that satisfies an input approximation threshold, and is as succinct as possible.