4397 search results - page 23 / 880 » Relational Algebra Operations |
SIGMOD
1987
ACM
13 years 11 months ago
1987
ACM
In this paper we discuss extensions to the conventional relatronal algebra to support transaction time We show that these extensions are applicable to hrstorlcal algebras that sup...
TACS
2001
Springer
14 years 1 days ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
STACS
1997
Springer
13 years 11 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
In this paper we considered the extension of the First-order Logic Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the tradit...
SIGMOD
1996
ACM
13 years 11 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...