Queries with incomplete answers over semistructured data

  • Yaron Kanza*
  • , Werner Nutt
  • , Yehoshua Sagiv
  • *Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

23 Scopus citations

Abstract

The principles of queries that allow incomplete answers are presented. Partial answers make it necessary to refine the model of query evaluation. The first modification relates to the satisfaction of conditions, under some circumstances, conditions involving unbound variables as satisfied are considered. Second, in order to prevent a proliferation of answers, only answers that are maximal in the sense that there are no assignments that bind more variables and satisfy the conditions of the query, are accepted. The mode of query evaluation consists of two phases, a search phase and a filter phase. The containment problem for queries consisting only of search constraints under the different semantics are investigated.

Original languageEnglish
Pages (from-to)227-236
Number of pages10
JournalProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
DOIs
StatePublished - 1999
Event18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 1999 - Philadelphia, PA, USA
Duration: 31 May 19993 Jun 1999

Fingerprint

Dive into the research topics of 'Queries with incomplete answers over semistructured data'. Together they form a unique fingerprint.

Cite this