201 search results - page 15 / 41 » Extending the Relational Algebra to Capture Complex Objects |
CORR
1998
Springer
13 years 7 months ago
1998
Springer
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
DEXA
2000
Springer
14 years 3 days ago
2000
Springer
The relational model, as proposed by Codd, contained the concept of relations as tables composed of tuples of single valued attributes taken from a domain. In most of the early lit...
IJCAI
2003
13 years 9 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
Exploiting the complex structure of relational data enables to build better models by taking into account the additional information provided by the links between objects. We exten...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...