Sciweavers

651 search results - page 91 / 131
» Algebraic Query Optimization for Distributed Top-k Queries
Sort
View
DAGM
2007
Springer
14 years 3 months ago
The Minimum Volume Ellipsoid Metric
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
Karim T. Abou-Moustafa, Frank P. Ferrie
VLDB
1993
ACM
152views Database» more  VLDB 1993»
14 years 1 months ago
Declustering Objects for Visualization
In this paper we propose a new declustering method which is particularly suitable for image and cartographic databases used for visualization. Our declustering method is based on ...
Ling Tony Chen, Doron Rotem
JCP
2007
118views more  JCP 2007»
13 years 9 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
CIDR
2009
181views Algorithms» more  CIDR 2009»
13 years 10 months ago
The Case for RodentStore: An Adaptive, Declarative Storage System
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
SIGMOD
2005
ACM
126views Database» more  SIGMOD 2005»
14 years 9 months ago
Cost-Sensitive Reordering of Navigational Primitives
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
Carl-Christian Kanne, Matthias Brantner, Guido Moe...