A Dual Hashtables Algorithm for Durable Top-k Search
Hua Ming, Yong Zhang, Chunxiao Xing, Haiyan Yin, Minglu Wang · 2012
We propose a dual hash tables algorithm which can realize the durable top-k search. Two hash tables are constructed to keep the core information, such as score and time in the inverted lists. We use the key-value relationships between the two hash tables to calculate the scores which measure the correlations between a keyword and documents, and search the versioned objects that are consistent in the top-k results throughout a given query interval. Finally, we use data from Wikipedia to demonstrate the efficiency and performance of our algorithm.