Skip to main navigation Skip to search Skip to main content

Queries with incomplete answers over semistructured data

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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
Title of host publicationProceedings of the 18th ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS 1999
PublisherACM Transactions on Intelligent Systems and Technology
Pages227-236
Number of pages10
ISBN (Print)1581130627
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

Publication series

NameProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
ISSN (Print)1055-6338

Conference

Conference18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 1999
CityPhiladelphia, PA, USA
Period31/05/993/06/99

Fingerprint

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

Cite this