On the expressive power of semijoin queries

Information Processing Letters

Volumn 91, Issue 2, 2004, Pages 93-98

  Leinders, Dirk ^a   Tyszkiewicz, Jerzy ^b   Van Den Bussche, Jan ^a  

^a HASSELT UNIVERSITY   (Belgium)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Databases; Ehrenfeucht Fra ss game; Relational algebra; Semijoin

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING; DATABASE SYSTEMS; GAME THEORY; MATHEMATICAL OPERATORS; SET THEORY;

RALATIONAL ALGEBRA; SEMIJOIN QUERIES;

DATA PROCESSING;

EID: 2942538457     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.03.011     Document Type: Article

References (8)

1. Abiteboul S., Hull R., Vianu V. Foundations of Databases. 1995;Addison-Wesley, Reading, MA.
2. Andreka H., Nemeti I., van Benthem J. Modal languages and bounded fragments of predicate logic. J. Philos. Logic. 27:(3):1998;217-274.
3. Beeri C., Fagin R., Maier D., Yannakakis M. On the desirability of acyclic database schemes. J. ACM. 30:(3):1983;479-513.
4. Bernstein P.A., Chiu D.W. Using semi-joins to solve relational queries. J. ACM. 28:(1):1981;25-40.
5. Bernstein P.A., Goodman N. Power of natural semijoins. SIAM J. Comput. 10:(4):1981;751-771.
6. Ebbinghaus H.-D., Flum J. Finite Model Theory. 1999;Springer-Verlag, Berlin/New York.
7. Garcia-Molina H., Ullman J.D., Widom J. Database Systems: The Complete Book. 2000;Prentice Hall, New York.
8. Yannakakis M. Algorithms for acyclic database schemes. Proc. of Internat. Conf. on Very Large Data Bases. 1981;82-94 IEEE Press, New York.