论文信息 - On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs

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

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 co-graph-isomorphism hard and in co NP. The main result is also applied in providing a new characterization of the generic relational queries.

George H. L. Fletcher | Marc Gyssens | Dirk Van Gucht | Jan Paredaens

[1] Felix Naumann,et al. Schema matching using duplicates , 2005, 21st International Conference on Data Engineering (ICDE'05).

[2] George H. L. Fletcher,et al. Data Mapping as Search , 2006, EDBT.

[3] Georg Gottlob,et al. The Lixto data extraction project: back and forth between theory and practice , 2004, PODS.

[4] J. Köbler,et al. The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[5] Jacobo Torán,et al. The graph isomorphism problem , 2020, Commun. ACM.

[6] Jan Van den Bussche,et al. Expressiveness and Complexity of Generic Graph Machines , 1998, Theory of Computing Systems.

[7] François Bancilhon,et al. On the Completeness of Query Languages for Relational Data Bases , 1978, MFCS.

[8] Phokion G. Kolaitis. Schema mappings, data exchange, and metadata management , 2005, PODS '05.

[9] David Harel,et al. Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[10] Jan Paredaens,et al. On the Expressive Power of the Relational Algebra , 1978, Inf. Process. Lett..

[11] Georg Gottlob,et al. On the complexity of deriving schema mappings from database instances , 2008, PODS.

[12] Marc Gyssens,et al. A uniform approach toward handling atomic and structured information in the nested relational database model , 1989, JACM.

[13] George H. L. Fletcher,et al. Structural characterizations of the semantics of XPath as navigation tool on a document , 2006, PODS.