On the complexity of division and set joins in the relational algebra

Journal of Computer and System Sciences

Volumn 73, Issue 4, 2007, Pages 538-549

  Leinders, Dirk ^a   Van den Bussche, Jan ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

Complexity; Database; Relational algebra; Semijoin algebra

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR ALGEBRA; MATHEMATICAL OPERATORS; THEOREM PROVING;

CONSTANT TAGGING; RELATIONAL ALGEBRA; SEMIJOIN ALGEBRA;

DATABASE SYSTEMS;

EID: 33947309404     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.10.011     Document Type: Article

References (19)

1. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley
2. Aho A., Hopcroft J.E., and Ullman J.D. Data Structures and Algorithms (1983), Addison-Wesley
3. Andréka H., Németi I., and van Benthem J. Modal languages and bounded fragments of predicate logic. J. Philos. Logic 27 3 (1998) 217-274
4. Beeri C., Fagin R., Maier D., and Yannakakis M. On the desirability of acyclic database schemes. J. ACM 30 3 (1983) 479-513
5. Bernstein P.A., and Chiu D.W. Using semi-joins to solve relational queries. J. ACM 28 1 (1981) 25-40
6. Bernstein P.A., and Goodman N. Power of natural semijoins. SIAM J. Comput. 10 4 (1981) 751-771
7. Codd E.F. Relational completeness of data base sublanguages. In: Rustin R. (Ed). Data Base Systems (1972), Prentice Hall 65-98
8. de Nivelle H., and de Rijke M. Deciding the guarded fragments by resolution. J. Symbolic Comput. 35 1 (2003) 21-58
9. Grädel E. On the restraining power of guards. J. Symbolic Logic 64 4 (1999) 1719-1742
10. Grädel E., Hirsch C., and Otto M. Back and forth between guarded and modal logics. ACM Trans. Comput. Logic 3 3 (2002) 418-463
11. Graefe G. Relational division: Four algorithms and their performance. Proceedings of the 5th International Conference on Data Engineering (1989), IEEE Computer Society 94-101
12. Graefe G., and Cole R.L. Fast algorithms for universal quantification in large databases. ACM Trans. Database Systems 20 2 (1995) 187-236
13. Helmer S., and Moerkotte G. Evaluation of main memory join algorithms for joins with set comparison join predicates. Proceedings of the 23rd International Conference on Very Large Data Bases (1997), Morgan Kaufmann 386-395
14. Leinders D., Marx M., Tyszkiewicz J., and Van den Bussche J. The semijoin algebra and the guarded fragment. J. Logic Language Inform. 14 3 (June 2005) 331-343
15. Mamoulis N. Efficient processing of joins on set-valued attributes. Proceedings of the ACM SIGMOD International Conference on Management of Data (2003), ACM Press 157-168
16. Ramasamy K., Patel J.M., Naughton J.F., and Kaushik R. Set containment joins: The good, the bad and the ugly. Proceedings of the 26th International Conference on Very Large Data Bases (2000), Morgan Kaufmann 351-362
17. Rao S.G., Badia A., and Van Gucht D. Providing better support for a class of decision support queries. Proceedings of the ACM SIGMOD International Conference on Management of Data (1996), ACM Press 217-227
18. Sarawagi S., and Kirpal A. Efficient set joins on similarity predicates. Proceedings of the ACM SIGMOD International Conference on Management of Data (2004), ACM Press 743-754
19. Ullman J.D. Principles of Database and Knowledge-Base Systems, vol. 1 (1988), Computer Science Press