147 search results - page 6 / 30 » Size Bounds and Query Plans for Relational Joins |
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
ER
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we present a model of functional access to data that, we argue, is suitable for modeling a class of data repositories characterized by functional access, such as web ...
DEXA
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
IDEAS
2010
IEEE
13 years 6 months ago
2010
IEEE
Even though an effective cost-based query optimizer is of utmost importance for the efficient evaluation of XQuery expressions in native XML database systems, such a component is...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...