Sciweavers

294 search results - page 22 / 59
» Approximate query processing using wavelets
Sort
View
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 9 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 7 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 7 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
CIKM
2003
Springer
14 years 29 days ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
DKE
2007
119views more  DKE 2007»
13 years 7 months ago
Error minimization in approximate range aggregates
Histogram techniques have been used in many commercial database management systems to estimate a query result size. Recently, it has been shown that they are very effective to su...
Xuemin Lin, Qing Zhang, Yidong Yuan, Qing Liu