Sciweavers

36 search results - page 6 / 8
» sigmod 2012
Sort
View
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 8 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
11 years 8 months ago
Oracle in-database hadoop: when mapreduce meets RDBMS
Big data is the tar sands of the data world: vast reserves of raw gritty data whose valuable information content can only be extracted at great cost. MapReduce is a popular parall...
Xueyuan Su, Garret Swart
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
11 years 8 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
SIGMOD
2012
ACM
232views Database» more  SIGMOD 2012»
11 years 8 months ago
Large-scale machine learning at twitter
The success of data-driven solutions to difficult problems, along with the dropping costs of storing and processing massive amounts of data, has led to growing interest in largesc...
Jimmy Lin, Alek Kolcz
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 8 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...