A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Durable top-k search in document archives
2010
Proceedings of the 2010 international conference on Management of data - SIGMOD '10
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents in a web archive). Durable top-k search finds the set of objects that are consistently in the top-k results of a query (e.g., a keyword query) throughout a given time interval (e.g., from June 2008 to May 2009). Existing work on temporal top-k queries mainly focuses on finding the most representative top-k elements
doi:10.1145/1807167.1807228
dblp:conf/sigmod/UMBB10
fatcat:nhujkleyzvcmbmv44ow6qt5iie