2514 search results - page 190 / 503 » On the Computation of Approximations of Database Queries |
173
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
151
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper, the matching of SIFT-like features [5] between images is studied. The goal is to decide which matches between descriptors of two datasets should be selected. This m...
151
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Skyline queries ask for a set of interesting points from a potentially large set of data points. If we are traveling, for instance, a restaurant might be interesting if there is n...
174
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
254
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...