147 search results - page 25 / 30 » Size Bounds and Query Plans for Relational Joins |
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
The goal of data fusion is to combine several representations of one real world object into a single, consistent representation, e.g., in data integration. A very popular operator...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...