4397 search results - page 172 / 880 » Relational Algebra Operations |
196
click to vote
ESA
1997
Springer
15 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
179
Voted
CAISE
2004
Springer
16 years 14 days ago
2004
Springer
Many information systems store their objects in a relational database. If the object schema or the relational schema of an application can change often or in an independent way, it...
165
click to vote
ACL
1993
15 years 8 months ago
1993
We present an implemented unification-based parser for relational grammars developed within the stratified feature grammar (SFG) framework, which generalizes Kasper-Rounds logic t...
176
click to vote
RTA
1993
Springer
15 years 11 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
176
Voted
IJFCS
2010
15 years 5 months ago
2010
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (Ï...