147 search results - page 11 / 30 » Size Bounds and Query Plans for Relational Joins |
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
VLDB
2004
ACM
14 years 25 days ago
2004
ACM
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...