153 search results - page 3 / 31 » Efficient top-k processing over query-dependent functions |
114
click to vote
CIKM
2006
Springer
15 years 3 months ago
2006
Springer
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
103
click to vote
PVLDB
2008
14 years 11 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
110
click to vote
FOCS
2009
IEEE
15 years 3 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
103
click to vote
MIS
2004
Springer
15 years 5 months ago
2004
Springer
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
107
click to vote
PVLDB
2010
14 years 6 months ago
2010
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...