Continuous Temporal Top-k Query over Versioned Documents
The management of versioned documents has attracted researchers’ attentions in recent years. Based on the observation that decision-makers are often interested in finding the set of objects that have continuous behavior over time, we study the problem of continuous temporal top-k query. With a given a query, continuous temporal top-k search finds the documents that frequently rank in the top-k during a time period and take the weights of different time intervals into account. Existing works regarding querying versioned documents have focused on adding the constraint of time, however lacked to consider the continuous ranking of objects and weights of time intervals. We propose a new interval window-based method to address this problem. Our method can get the continuous temporal top-k results while using interval windows to support time and weight constraints simultaneously. We use data from Wikipedia to evaluate our method.
Unable to display preview. Download preview PDF.
- 1.Anand, A., Bedathur, S., Berberich, K., Schenkel, R.: Efficient temporal keyword search over versioned text. In: CIKM, pp. 699–708. ACM, New York (2010)Google Scholar
- 2.Anand, A., Bedathur, S., Berberich, K., Schenkel, R.: Index maintenance for time-travel text search. In: SIGIR, pp. 235–244. ACM, New York (2012)Google Scholar
- 3.Berberich, K., Bedathur, S., Neumann, T., Weikum, G.: A time machine for text search. In: SIGIR, pp. 519–526. ACM, New York (2007)Google Scholar
- 7.Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of top-k queries over sliding windows. In: SIGMOD, pp. 635–646. ACM, New York (2006)Google Scholar
- 8.Leong Hou, U., Mamoulis, N., Berberich, K., Bedathur, S.: Durable top-k search in document archives. In: SIGMOD, pp. 555–566. ACM, New York (2010)Google Scholar