On the expressive power of the relational algebra on finite sets of relation pairs

IEEE Transactions on Knowledge and Data Engineering

Volumn 21, Issue 6, 2009, Pages 939-942

  Fletcher, George H L ^a   Gyssens, Marc ^b,c   Paredaens, Jan ^d   Van Gucht, Dirk ^e  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b HASSELT UNIVERSITY   (Belgium)

^c HASSELT UNIVERSITY   (Belgium)

^d UNIVERSITY OF ANTWERP   (Belgium)

^e INDIANA UNIVERSITY   (United States)

Author keywords

BP completeness; Data integration; Data manipulation languages; Data mapping; Definability; Expressibility; Genericity; Graph isomorphism; Monotonicity; Query design and implementation languages; Query languages; Relational algebra

Indexed keywords

BP COMPLETENESS; DATA INTEGRATION; DATA MANIPULATION LANGUAGES; DATA MAPPING; DEFINABILITY; EXPRESSIBILITY; GENERICITY; GRAPH ISOMORPHISM; MONOTONICITY; QUERY DESIGN AND IMPLEMENTATION LANGUAGES; RELATIONAL ALGEBRA;

ALGEBRA; DATA HANDLING; LINGUISTICS; SET THEORY;

QUERY LANGUAGES;

EID: 66149179260     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2008.221     Document Type: Article

References (12)

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