Sciweavers

2635 search results - page 198 / 527
» Algorithms for the Database Layout Problem
Sort
View
CIKM
2011
Springer
14 years 6 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 6 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
PODS
2003
ACM
104views Database» more  PODS 2003»
16 years 6 months ago
Maintaining time-decaying stream aggregates
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
Edith Cohen, Martin Strauss
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
FQAS
2009
Springer
125views Database» more  FQAS 2009»
16 years 1 months ago
Predicting Neighbor Goodness in Collaborative Filtering
Performance prediction has gained increasing attention in the IR field since the half of the past decade and has become an established research topic in the field. The present work...
Alejandro Bellogín, Pablo Castells