630 search results - page 1 / 126 » Optimized union of non-disjoint distributed data sets |
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
62
Voted
IPPS
1996
IEEE
15 years 2 months ago
1996
IEEE
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...
JSW
2008
14 years 10 months ago
2008
Abstract-- The computation of the union operator for different distributed datasets involves two challenges when participants are curious and can even act malicious: guaranteeing a...
172
click to vote
WEA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
111
click to vote
JACM
2012
13 years 1 months ago
2012
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...