Query processing over incomplete autonomous databases: query rewriting using learned data dependencies

  • Authors:
  • Garrett Wolf;Aravind Kalavagattu;Hemal Khatri;Raju Balakrishnan;Bhaumik Chokshi;Jianchun Fan;Yi Chen;Subbarao Kambhampati

  • Affiliations:
  • Arizona State University, Tempe, USA;Arizona State University, Tempe, USA;Arizona State University, Tempe, USA;Arizona State University, Tempe, USA;Arizona State University, Tempe, USA;Arizona State University, Tempe, USA;Arizona State University, Tempe, USA;Arizona State University, Tempe, USA

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through mediators. Traditional query processing techniques that focus on the strict soundness of answer tuples often ignore tuples with critical missing attributes, even if they wind up being relevant to a user query. Ideally we would like the mediator to retrieve such possibleanswers and gauge their relevance by accessing their likelihood of being pertinent answers to the query. The autonomous nature of web databases poses several challenges in realizing this objective. Such challenges include the restricted access privileges imposed on the data, the limited support for query patterns, and the bounded pool of database and network resources in the web environment. We introduce a novel query rewriting and optimization framework QPIAD that tackles these challenges. Our technique involves reformulating the user query based on mined correlations among the database attributes. The reformulated queries are aimed at retrieving the relevant possibleanswers in addition to the certain answers. QPIAD is able to gauge the relevance of such queries allowing tradeoffs in reducing the costs of database query processing and answer transmission. To support this framework, we develop methods for mining attribute correlations (in terms of Approximate Functional Dependencies), value distributions (in the form of Naïve Bayes Classifiers), and selectivity estimates. We present empirical studies to demonstrate that our approach is able to effectively retrieve relevant possibleanswers with high precision, high recall, and manageable cost.