On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs

Authors:
George H. L. Fletcher;Marc Gyssens;Jan Paredaens;Dirk Van Gucht
Affiliations:
Washington State University, Vancouver;Hasselt University and the Transnational University of Limburg, Diepenbeek;University of Antwerp, Antwerp;Indiana University, Bloomington
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2009

Citing 0
Cited 8

Positive higher-order queries

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Designing and refining schema mappings via data examples

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Learning schema mappings

Proceedings of the 15th International Conference on Database Theory
Definability problems for graph query languages

Proceedings of the 16th International Conference on Database Theory
Schema mappings and data examples

Proceedings of the 16th International Conference on Extending Database Technology
What we talk about when we talk about graphs

Proceedings of the Joint EDBT/ICDT 2013 Workshops
Learning queries for relational, semi-structured, and graph databases

Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
Learning schema mappings

ACM Transactions on Database Systems (TODS) - Invited papers issue

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a language-independent characterization of the expressive power of the relational algebra on finite sets of source-target relation instance pairs. The associated decision problem is shown to be cograph-isomorphism hard and in coNP. The main result is also applied in providing a new characterization of the generic relational queries.