147 search results - page 12 / 30 » Size Bounds and Query Plans for Relational Joins |
BTW
2007
Springer
13 years 11 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
SSDBM
2003
IEEE
14 years 23 days ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
TKDE
1998
13 years 7 months ago
1998
—When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a ...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...