430 search results - page 4 / 86 » An Efficient Parallel Join Algorithm Based On Hypercube-Part... |
83
Voted
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
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...
168
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
176
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...