Sciweavers

483 search results - page 59 / 97
» Evaluating Top-k Selection Queries
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 8 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
ADC
2008
Springer
135views Database» more  ADC 2008»
14 years 2 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
CVPR
2008
IEEE
14 years 9 months ago
Lost in quantization: Improving particular object retrieval in large scale image databases
The state of the art in visual object retrieval from large databases is achieved by systems that are inspired by text retrieval. A key component of these approaches is that local ...
James Philbin, Ondrej Chum, Michael Isard, Josef S...
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 7 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava