2009 · 141 citations · 19 references
ComputingComputer ScienceInformation SystemsData EngineeringData ManagementDatabasesDatabase ManagementQuery ManagementQuery OptimizationQuery ProcessingRelational Data ModelRelational DatabasesData ClassificationData Classification SchemesDatabase Management SystemsQuery EquivalenceQuery MinimizationQuery StrategySchema Optimization
It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in the data all play an important role in this context. Subscribing to this viewpoint, in this paper, we present a novel data-driven approach, called Query By Output (QBO), which can enhance the usability of database systems. The central goal of QBO is as follows: given the output of some query Q on a database D, denoted by Q(D), we wish to construct an alternative query Q′ such that Q(D) and Q′ (D) are instance-equivalent. To generate instance-equivalent queries from Q(D), we devise a novel data classification-based technique that can handle the at-least-one semantics that is inherent in the query derivation. In addition to the basic framework, we design several optimization techniques to reduce processing overhead and introduce a set of criteria to rank order output queries by various notions of utility. Our framework is evaluated comprehensively on three real data sets and the results show that the instance-equivalent queries we obtain are interesting and that the approach is scalable and robust to queries of different selectivities.
19
Modeling by shortest data description
J. Rissanen · Automatica · 1978 · 6K citations
S. Borzsony, Donald Kossmann, Konrad Stocker · 2002 · 2.2K citations
Patrick Valduriez · ACM Transactions on Database Systems · 1987 · 504 citations · Full text
Moshé M. Zloof · 1975 · 490 citations
Selectivity estimation using probabilistic models
Lise Getoor, Benjamin Taskar, Daphne Koller · 2001 · 265 citations