An abstract framework for generating maximal answers to queries

Sara Cohen; Yehoshua Sagiv

doi:10.1007/978-3-540-30570-5_9

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 proceeding › Conference contribution › peer-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 language	English
Title of host publication	Database Theory - ICDT 2005 - 10th International Conference, Proceedings
Pages	129-143
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-540-30570-5_9
State	Published - 2005
Externally published	Yes
Event	10th International Conference on Database Theory, ICDT 2005 - Edinburgh, United Kingdom Duration: 5 Jan 2005 → 7 Jan 2005

Publication series

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

Conference

Conference	10th International Conference on Database Theory, ICDT 2005
Country/Territory	United Kingdom
City	Edinburgh
Period	5/01/05 → 7/01/05

Access to Document

10.1007/978-3-540-30570-5_9

Cite this

Cohen, S., & Sagiv, Y. (2005). An abstract framework for generating maximal answers to queries. In Database Theory - ICDT 2005 - 10th International Conference, Proceedings (pp. 129-143). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3363 LNCS). https://doi.org/10.1007/978-3-540-30570-5_9

@inproceedings{c8debd8ad54c401594eb1f228d88bc2e,

title = "An abstract framework for generating maximal answers to queries",

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.",

author = "Sara Cohen and Yehoshua Sagiv",

year = "2005",

doi = "10.1007/978-3-540-30570-5_9",

language = "אנגלית",

isbn = "3540242880",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "129--143",

booktitle = "Database Theory - ICDT 2005 - 10th International Conference, Proceedings",

note = "10th International Conference on Database Theory, ICDT 2005 ; Conference date: 05-01-2005 Through 07-01-2005",

}

Cohen, S & Sagiv, Y 2005, An abstract framework for generating maximal answers to queries. in Database Theory - ICDT 2005 - 10th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3363 LNCS, pp. 129-143, 10th International Conference on Database Theory, ICDT 2005, Edinburgh, United Kingdom, 5/01/05. https://doi.org/10.1007/978-3-540-30570-5_9

An abstract framework for generating maximal answers to queries. / Cohen, Sara; Sagiv, Yehoshua.
Database Theory - ICDT 2005 - 10th International Conference, Proceedings. 2005. p. 129-143 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3363 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An abstract framework for generating maximal answers to queries

AU - Cohen, Sara

AU - Sagiv, Yehoshua

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77049088031&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-30570-5_9

DO - 10.1007/978-3-540-30570-5_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77049088031

SN - 3540242880

SN - 9783540242888

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 129

EP - 143

BT - Database Theory - ICDT 2005 - 10th International Conference, Proceedings

T2 - 10th International Conference on Database Theory, ICDT 2005

Y2 - 5 January 2005 through 7 January 2005

ER -

An abstract framework for generating maximal answers to queries

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this