Sciweavers

1091 search results - page 43 / 219
» Approximation in Databases
Sort
View
ICDT
2009
ACM
148views Database» more  ICDT 2009»
16 years 16 days ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
ICPR
2008
IEEE
15 years 6 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
ICDE
2004
IEEE
121views Database» more  ICDE 2004»
16 years 1 months ago
Online Amnesic Approximation of Streaming Time Series
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...
Themistoklis Palpanas, Michail Vlachos, Eamonn J. ...
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
16 years 1 months ago
Convoy Queries in Spatio-Temporal Databases
We introduce a convoy query that retrieves all convoys from historical trajectories, each of which consists of a set of objects that travelled closely during a certain time period....
Hoyoung Jeung, Heng Tao Shen, Xiaofang Zhou
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
15 years 6 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki