An abstract framework for generating maximal answers to queries

Sara Cohen*, Yehoshua Sagiv

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

A framework for modeling query semantics as graph properties is presented. In this framework, a single definition of a query automatically gives rise to several semantics for evaluating that query under varying degrees of incomplete information. For example, defining natural joins automatically gives rise to full disjunctions. Two of the proposed semantics have incremental-polynomial- time query-evaluation algorithms for all types of queries that can be defined in this framework. Thus, the proposed framework generalizes previous definitions of semantics for incomplete information and improves previous complexity results for query evaluation.

Original languageAmerican English
Title of host publicationDatabase Theory - ICDT 2005 - 10th International Conference, Proceedings
Pages129-143
Number of pages15
DOIs
StatePublished - 2005
Externally publishedYes
Event10th International Conference on Database Theory, ICDT 2005 - Edinburgh, United Kingdom
Duration: 5 Jan 20057 Jan 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3363 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Conference on Database Theory, ICDT 2005
Country/TerritoryUnited Kingdom
CityEdinburgh
Period5/01/057/01/05

Fingerprint

Dive into the research topics of 'An abstract framework for generating maximal answers to queries'. Together they form a unique fingerprint.

Cite this