Sciweavers

1091 search results - page 117 / 219
» Approximation in Databases
Sort
View
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 6 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
16 years 6 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
16 years 6 months ago
SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data
The Discrete Wavelet Transform is a proven tool for a wide range of database applications. However, despite broad acceptance, some of its properties have not been fully explored a...
Mehrdad Jahangiri, Dimitris Sacharidis, Cyrus Shah...
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
16 years 6 months ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang
EDBT
2008
ACM
99views Database» more  EDBT 2008»
16 years 6 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan