Sciweavers

110 search results - page 17 / 22
» Maintaining Data Cubes under Dimension Updates
Sort
View
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 8 months ago
Efficient incremental constrained clustering
Clustering with constraints is an emerging area of data mining research. However, most work assumes that the constraints are given as one large batch. In this paper we explore the...
Ian Davidson, S. S. Ravi, Martin Ester
FOCS
2002
IEEE
14 years 17 days ago
Implicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
Gianni Franceschini, Roberto Grossi, J. Ian Munro,...
SIGMOD
2000
ACM
159views Database» more  SIGMOD 2000»
13 years 12 months ago
DLFM: A Transactional Resource Manager
The DataLinks technology developed at IBM Almaden Research Center and now available in DB2 UDB 5.2 introduces a new data type called DATALINK for a database to reference and manag...
Hui-I Hsiao, Inderpal Narang
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
14 years 7 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
DSN
2008
IEEE
14 years 2 months ago
Enhancing data availability in disk drives through background activities
Latent sector errors in disk drives affect only a few data sectors. They occur silently and are detected only when the affected area is accessed again. If a latent error is detect...
Ningfang Mi, Alma Riska, Evgenia Smirni, Erik Ried...