173 search results - page 28 / 35 » Efficient Rank Based KNN Query Processing Over Uncertain Dat... |
IPM
2008
13 years 7 months ago
2008
Document similarity search (i.e. query by example) aims to retrieve a ranked list of documents similar to a query document in a text corpus or on the Web. Most existing approaches...
DMDW
2000
13 years 8 months ago
2000
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
PVLDB
2008
13 years 7 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
PVLDB
2010
13 years 5 months ago
2010
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Previous work has shown that current XML keyword search methods, although in...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...