Sciweavers

6905 search results - page 43 / 1381
» Querying Multidimensional Databases
Sort
View
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 4 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 1 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
90
Voted
SAC
2009
ACM
15 years 7 months ago
Enhancing XML data warehouse query performance by fragmentation
XML data warehouses form an interesting basis for decisionsupport applications that exploit heterogeneous data from multiple sources. However, XML-native database systems currentl...
Hadj Mahboubi, Jérôme Darmont
ACCV
1998
Springer
15 years 4 months ago
Adaptive Color-Image Embeddings for Database Navigation
Proceedings of the 1998 IEEE Asian Conference on Computer Vision, Hong Kong We present a novel approach to the problem of navigating through a database of color images for the pur...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas
CRIWG
2004
15 years 1 months ago
Ariane: An Awareness Mechanism for Shared Databases
Awareness is an essential requirement in collaborative activities. This paper presents Ariane, a generic and reusable awareness infrastructure, independent of a specific applicatio...
Vaninha Vieira, Marco A. S. Mangan, Cláudia...