Sciweavers

1653 search results - page 147 / 331
» Efficient Multidimensional Sampling
Sort
View
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 5 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 5 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
134
Voted
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
16 years 5 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
VLDB
2007
ACM
137views Database» more  VLDB 2007»
16 years 4 months ago
Fast Data Anonymization with Low Information Loss
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
Gabriel Ghinita, Panagiotis Karras, Panos Kalnis, ...
EDBT
2006
ACM
255views Database» more  EDBT 2006»
16 years 4 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald