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

DOI10.1016/j.jcss.2006.10.011zbMath1115.68066OpenAlexW2082271602MaRDI QIDQ882434

Dirk Leinders, Jan Van den Bussche

Publication date: 23 May 2007

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/954

zbMATH Keywords

complexitydatabaserelational algebrasemijoin algebra

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (3)

Database query processing using finite cursor machines ⋮ Unnamed Item ⋮ Repetitions and permutations of columns in the semijoin algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Modal languages and bounded fragments of predicate logic
• Deciding the guarded fragments by resolution
• The semijoin algebra and the guarded fragment
• On the Desirability of Acyclic Database Schemes
• Using Semi-Joins to Solve Relational Queries
• Power of Natural Semijoins
• On the Restraining Power of Guards
• Back and forth between guarded and modal logics

This page was built for publication: On the complexity of division and set joins in the relational algebra