4397 search results - page 47 / 880 » Relational Algebra Operations |
OTM
2005
Springer
14 years 1 months ago
2005
Springer
The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
DOCENG
2004
ACM
14 years 1 months ago
2004
ACM
With the wide adoption of XML as a standard data representation and exchange format, querying XML documents becomes increasingly important. However, relational database systems co...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
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...