Synthesizing View Definitions from Data

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. Categories and Subject Descriptors H.2.m [Database Management]: Miscellaneous--Database Theory General Terms Algorithms, Theory Keywords View Definitions, Query Synthesis, Algorithms, Complexity

• Type: Conference
• Year: 2010
• Where: ICDT
• Authors: Anish Das Sarma, Aditya Parameswaran, Hector Garcia-Molina, Jennifer Widom
• Keywords: Corresponding View Instance, Database, ICDT 2010, View Definitions, View Instance