808 search results - page 17 / 162 » On the Estimation of Join Result Sizes |
VLDB
1990
ACM
15 years 1 months ago
1990
ACM
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
VLDB
1997
ACM
15 years 1 months ago
1997
ACM
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
87
Voted
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
DEXA
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Mobile devices are capable of retrieving and processing data from remote databases. In a wireless data transmission environment, users are typically charged by the size o...
DKE
2006
14 years 9 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....