Sciweavers

5221 search results - page 847 / 1045
» An On-line Problem Database
Sort
View
VLDB
2005
ACM
126views Database» more  VLDB 2005»
16 years 3 hour ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
15 years 12 months ago
Clustering time series from ARMA models with clipped data
Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. In this paper we focus on clustering...
Anthony J. Bagnall, Gareth J. Janacek
VLDB
2004
ACM
100views Database» more  VLDB 2004»
15 years 12 months ago
Resilient Rights Protection for Sensor Streams
Today’s world of increasingly dynamic computing environments naturally results in more and more data being available as fast streams. Applications such as stock market analysis,...
Radu Sion, Mikhail J. Atallah, Sunil Prabhakar
VLDB
2004
ACM
118views Database» more  VLDB 2004»
15 years 12 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 11 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan