Sciweavers

1416 search results - page 228 / 284
» Optimizing Write Performance for Read Optimized Databases
Sort
View
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
Scalable discovery of hidden emails from large folders
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 8 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
VLDB
2007
ACM
169views Database» more  VLDB 2007»
14 years 8 months ago
Staying FIT: Efficient Load Shedding Techniques for Distributed Stream Processing
In distributed stream processing environments, large numbers of continuous queries are distributed onto multiple servers. When one or more of these servers become overloaded due t...
Nesime Tatbul, Stanley B. Zdonik, Ugur Çeti...
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
14 years 7 months ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 7 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...