An abstract framework for generating maximal answers to queries

Authors:
Sara Cohen;Yehoshua Sagiv
Affiliations:
Faculty of Industrial Engineering and Management, Technion—Israel Institute of Technology, Technion City, Haifa, Israel;The Selim and Rachel Benin School of Engineering and Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel
Venue:
ICDT'05 Proceedings of the 10th international conference on Database Theory
Year:
2005

Citing 16
Cited 7

On generating all maximal independent sets

Information Processing Letters
Outerjoins as disjunctions

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Integrating information by outerjoins and full disjunctions (extended abstract)

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Queries with incomplete answers over semistructured data

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Complexity of Testing Implications of Functional and Join Dependencies

Journal of the ACM (JACM)
Flexible queries over semistructured data

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Querying partially sound and complete data sources

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate XML joins

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Tree Pattern Relaxation

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Generating Relations from XML Documents

ICDT '03 Proceedings of the 9th International Conference on Database Theory
A Semantics-based Approach to Design of Query Languages for Partial Information

Selected Papers from a Workshop on Semantics in Databases
Computing full disjunctions

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
FleXPath: flexible structure and full-text querying for XML

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7

An incremental algorithm for computing ranked full disjunctions

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An incremental algorithm for computing ranked full disjunctions

Journal of Computer and System Sciences
Maximally joining probabilistic data

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties

Journal of Computer and System Sciences
Incomplete information and certain answers in general data models

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Querying graph patterns

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Querying Regular Graph Patterns

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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.