301 search results - page 13 / 61 » Efficient Sketches for the Set Query Problem |
219
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
122
click to vote
TKDE
2008
15 years 1 months ago
2008
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
207
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
206
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
134
click to vote
RR
2007
Springer
15 years 8 months ago
2007
Springer
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...