Sciweavers

2070 search results - page 193 / 414
» Regret-Minimizing Representative Databases
Sort
View
243
Voted
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 4 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
225
Voted
GIS
2003
ACM
16 years 4 months ago
Indexing of network constrained moving objects
With the proliferation of mobile computing, the ability to index efficiently the movements of mobile objects becomes important. Objects are typically seen as moving in two-dimensi...
Dieter Pfoser, Christian S. Jensen
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 4 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SIGMOD
2007
ACM
195views Database» more  SIGMOD 2007»
16 years 3 months ago
Effective variation management for pseudo periodical streams
Many database applications require the analysis and processing of data streams. In such systems, huge amounts of data arrive rapidly and their values change over time. The variati...
Lv-an Tang, Bin Cui, Hongyan Li, Gaoshan Miao, Don...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 3 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller