301 search results - page 9 / 61 » Efficient Sketches for the Set Query Problem |
ADBIS
2009
Springer
14 years 8 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
STOC
2005
ACM
15 years 11 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
193
Voted
ICDE
2009
IEEE
16 years 18 days ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
201
click to vote
STOC
2003
ACM
15 years 11 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
163
Voted
ICDE
2003
IEEE
16 years 7 days ago
2003
IEEE
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...