
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
George H.L. Fletcher, Marc Gyssens, Jan Paredaens, Dirk Van Gucht, "On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 6, pp. 939942, June, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.221, author = {George H.L. Fletcher and Marc Gyssens and Jan Paredaens and Dirk Van Gucht}, title = {On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {6}, issn = {10414347}, year = {2009}, pages = {939942}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.221}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  On the Expressive Power of the Relational Algebra on Finite Sets of Relation Pairs IS  6 SN  10414347 SP939 EP942 EPD  939942 A1  George H.L. Fletcher, A1  Marc Gyssens, A1  Jan Paredaens, A1  Dirk Van Gucht, PY  2009 KW  Query languages KW  relational algebra KW  data mapping KW  data integration KW  definability KW  expressibility KW  BP completeness KW  graph isomorphism KW  genericity KW  monotonicity. VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] F. Bancilhon , “On the Completeness of Query Languages for Relational Data Bases,” Proc. Seventh Symp. Math. Foundations of Computer Science, pp.112123 1978.
[2] A. Bilke and F. Naumann , “Schema Matching Using Duplicates,” Proc. IEEE Int'l Conf. Data Eng., pp. 6980 2005.
[3] A.K. Chandra and D. Harel , “Computable Queries for Relational Data Bases,” J. Computer and System Sciences, vol. 21, no. 2, pp. 156178, 1980.
[4] G.H.L. Fletcher and C.M. Wyss , “Data Mapping as Search,” Proc. Int'l Conf. Extending Database Technology (EDBT '06), pp. 95111, 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. 231249, 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. 112, 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.318327, 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.6175, 2005.
[10] J. Paredaens , “On the Expressive Power of the Relational Algebra,” Information Processing Letters, vol. 7, no. 2, pp. 107111, 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. 2332, 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. 790825, 1989.