808 search results - page 19 / 162 » On the Estimation of Join Result Sizes |
175
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
113
click to vote
PODS
2005
ACM
15 years 9 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the algorithm rapidly gives a good estimate for many join-agg...
EDBTW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
CIKM
2006
Springer
15 years 1 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-...