Sciweavers

291 search results - page 53 / 59
» Efficiently Processing Continuous k-NN Queries on Data Strea...
Sort
View
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 9 months ago
Online Anomaly Prediction for Robust Cluster Systems
In this paper, we present a stream-based mining algorithm for online anomaly prediction. Many real-world applications such as data stream analysis requires continuous cluster opera...
Xiaohui Gu, Haixun Wang
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 3 days ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
PVLDB
2008
116views more  PVLDB 2008»
13 years 7 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
CIKM
2008
Springer
13 years 9 months ago
Content-based filtering for efficient online materialized view maintenance
Real-time materialized view maintenance has become increasingly popular, especially in real-time data warehousing and data streaming environments. Upon updates to base relations, ...
Gang Luo, Philip S. Yu
DKE
1998
88views more  DKE 1998»
13 years 7 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng