736 search results - page 136 / 148 » Confidence-Aware Join Algorithms |
ESA
2005
Springer
15 years 5 months ago
2005
Springer
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
106
click to vote
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
WIDM
2004
ACM
15 years 5 months ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
114
Voted
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
130
click to vote
VECPAR
2004
Springer
15 years 5 months ago
2004
Springer
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...