Sciweavers

306 search results - page 56 / 62
» Approximate Judgement Aggregation
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
13 years 6 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ICDE
2006
IEEE
148views Database» more  ICDE 2006»
14 years 8 months ago
Unifying the Processing of XML Streams and Relational Data Streams
Relational data streams and XML streams have previously provided two separate research foci, but their unified support by a single Data Stream Management System (DSMS) is very des...
Xin Zhou, Hetal Thakkar, Carlo Zaniolo
WWW
2007
ACM
14 years 7 months ago
The largest scholarly semantic network...ever
Scholarly entities, such as articles, journals, authors and institutions, are now mostly ranked according to expert opinion and citation data. The Andrew W. Mellon Foundation fund...
Johan Bollen, Marko A. Rodriguez, Herbert Van de S...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 6 months ago
Statistical analysis of sketch estimators
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
Florin Rusu, Alin Dobra
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 6 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...