Sciweavers

54 search results - page 9 / 11
» Efficient parallel set-similarity joins using MapReduce
Sort
View
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
14 years 9 months ago
Large-scale behavioral targeting
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
Ye Chen, Dmitry Pavlov, John F. Canny
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
14 years 19 days ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
PPOPP
2010
ACM
13 years 10 months ago
Helper locks for fork-join parallel programming
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
ICDT
2009
ACM
121views Database» more  ICDT 2009»
14 years 9 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz