The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2009 vol.21)
pp: 939-942
Marc Gyssens , Hasselt University and the Transnational University of Limburg, Diepenbeek
George H.L. Fletcher , Washington State University, Vancouver
Dirk Van Gucht , Indiana University, Bloomington
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.
INDEX TERMS
Query languages, relational algebra, data mapping, data integration, definability, expressibility, BP completeness, graph isomorphism, genericity, monotonicity.
CITATION
Marc Gyssens, George H.L. Fletcher, Dirk Van Gucht, "On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 6, pp. 939-942, June 2009, doi:10.1109/TKDE.2008.221
REFERENCES
[1] F. Bancilhon , “On the Completeness of Query Languages for Relational Data Bases,” Proc. Seventh Symp. Math. Foundations of Computer Science, pp.112-123 1978.
[2] A. Bilke and F. Naumann , “Schema Matching Using Duplicates,” Proc. IEEE Int'l Conf. Data Eng., pp. 69-80 2005.
[3] A.K. Chandra and D. Harel , “Computable Queries for Relational Data Bases,” J. Computer and System Sciences, vol. 21, no. 2, pp. 156-178, 1980.
[4] G.H.L. Fletcher and C.M. Wyss , “Data Mapping as Search,” Proc. Int'l Conf. Extending Database Technology (EDBT '06), pp. 95-111, 2006.
[5] M. Gemis , J. Paredaens , P. Peelman , and J. Van den Bussche , “Expressiveness and Complexity of Generic Graph Machines,” Theory of Computing Systems, vol. 31, no. 3, pp. 231-249, 1998.
[6] G. Gottlob , C. Koch , R. Baumgartner , M. Herzog , and S. Flesca , “The Lixto Data Extraction Project—Back and Forth between Theory and Practice,” Proc. ACM Symp. Principles of Database Systems (PODS '04), pp. 1-12, 2004.
[7] M. Gyssens , J. Paredaens , D. Van Gucht , and G.H.L. Fletcher , “Structural Characterizations of the Semantics of XPath as Navigation Tool on a Document,” Proc. ACM Symp. Principles of Database Systems (PODS '06), pp.318-327, 2006.
[8] J. Köbler , U. Schöning , and J. Torán , The Graph Isomorphism Problem: Its Structural Complexity. Boston: Birkhäuser, 1993.
[9] P.G. Kolaitis , “Schema Mappings, Data Exchange, and Metadata Management,” Proc. ACM Symp. Principles of Database Systems (PODS '05), pp.61-75, 2005.
[10] J. Paredaens , “On the Expressive Power of the Relational Algebra,” Information Processing Letters, vol. 7, no. 2, pp. 107-111, 1978.
[11] P. Senellart and G. Gottlob , “On the Complexity of Deriving Schema Mappings from Database Instances,” Proc. ACM Symp. Principles of Database Systems (PODS '08), pp. 23-32, 2008.
[12] M. Gyssens , J. Paredaens , and D. Van Gucht , “A Uniform Approach Toward Handling Atomic and Structured Information in the Nested Relational Database Model,” J. ACM, vol. 36, no. 4, pp. 790-825, 1989.
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool