Sciweavers

23988 search results - page 4720 / 4798
» Social Network Computing
Sort
View
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 3 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
PODS
2008
ACM
109views Database» more  PODS 2008»
16 years 3 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
ICFP
2003
ACM
16 years 3 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
WSDM
2010
ACM
315views Data Mining» more  WSDM 2010»
16 years 22 days ago
SBotMiner: Large Scale Search Bot Detection
In this paper, we study search bot traffic from search engine query logs at a large scale. Although bots that generate search traffic aggressively can be easily detected, a large ...
Fang Yu, Yinglian Xie, Qifa Ke
131
Voted
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
16 years 16 days ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...
« Prev « First page 4720 / 4798 Last » Next »