Sciweavers

5658 search results - page 7 / 1132
» An Efficient Counting Network
Sort
View
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
14 years 11 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...
KDD
2008
ACM
123views Data Mining» more  KDD 2008»
14 years 10 months ago
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Luca Becchetti, Paolo Boldi, Carlos Castillo, Aris...
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 10 months ago
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
Ping Li
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 1 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
14 years 11 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen