6 search results - page 1 / 2 » The Semijoin Algebra |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
In the 1970s Codd introduced the relational algebra, with operators selection, projection, union, difference and product, and showed that it is equivalent to first-order logic. In ...
PODS
2005
ACM
14 years 5 months ago
2005
ACM
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
FOIKS
2006
Springer
13 years 8 months ago
2006
Springer
ICDT
2007
ACM
13 years 11 months ago
2007
ACM
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
SIGMOD
1996
ACM
13 years 9 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...