486 search results - page 29 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
PVLDB
2010
13 years 6 months ago
2010
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper explores the relation between the structured parallelism exposed by the Decomposable BSP (DBSP) model through submachine locality and locality of reference in multi-lev...
FOCS
2002
IEEE
14 years 19 days ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
SIGMOD
1997
ACM
13 years 12 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...