A dual hashtables algorithm for durable top-k search

From WikiPapers
Jump to: navigation, search

A dual hashtables algorithm for durable top-k search is a 2012 conference paper written in English by Ming H., Zhang Y., Xing C., Yin H., Wang M. and published in Proceedings - 9th Web Information Systems and Applications Conference, WISA 2012.

[edit] Abstract

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.

[edit] References

This section requires expansion. Please, help!

Cited by

Probably, this publication is cited by others, but there are no articles available for them in WikiPapers.