589 search results - page 83 / 118 » Optimized Query Evaluation Using Cooperative Sorts |
NIS
1998
14 years 9 months ago
1998
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
BMCBI
2005
14 years 9 months ago
2005
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
To understand the performance of modern Java systems one must observe execution in the context of specific architectures. It is also important that we make these observations usi...
IMC
2005
ACM
15 years 3 months ago
2005
ACM
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
155
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...