Sciweavers

725 search results - page 9 / 145
» Approximate Join Processing Over Data Streams
Sort
View
ICDE
2009
IEEE
184views Database» more  ICDE 2009»
14 years 3 months ago
Scalable Keyword Search on Large Data Streams
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
NGITS
1997
Springer
14 years 23 days ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross
KAIS
2008
150views more  KAIS 2008»
13 years 8 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 8 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 2 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis