Self-correcting queries for xml

  • Authors:
  • Tali Brodianskiy;Sara Cohen

  • Affiliations:
  • Technion-Israel Institute of Technology, Haifa, Israel;Technion-Israel Institute of Technology, Haifa, Israel

  • Venue:
  • Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

It has been observed that queries over XML data sources are often unsatisfiable. Unsatisfiability may stem from several different sources, e.g., the user may be insufficiently familiar with the labels appearing the documents, or may not be intimately aware of the hierarchical structure of the documents. This difficulty may be compounded by the fact that errors in query formulation lead to an empty answer, and not to some sort of compilation error. To deal with query and document mismatches, previous research has considered returning answers that maximally satisfy (in some sense) the query, instead of only returning strictly satisfying answers. However, this breaks the golden database rule that only strictly satisfying answers are returned when querying. Indeed, the relationship between the query and answers is no longer clear, when unsatisfying answers are returned. To revive the golden database rule, this paper proposes a framework for deriving self-correcting queries over XML. This framework generates similar satisfiable queries, when the user query is unsatisfiable. The user can then choose a satisfiable query of interest, and receive exactly satisfying answers to this query.