Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anand, A., Bedathur, S., Berberich, K., Schenkel, R.: Efficient temporal keyword search over versioned text. In: CIKM, pp. 699–708. ACM, New York (2010)
Anand, A., Bedathur, S., Berberich, K., Schenkel, R.: Index maintenance for time-travel text search. In: SIGIR, pp. 235–244. ACM, New York (2012)
Berberich, K., Bedathur, S., Neumann, T., Weikum, G.: A time machine for text search. In: SIGIR, pp. 519–526. ACM, New York (2007)
Huo, W., Tsotras, V.J.: A comparison of top-k temporal keyword querying over versioned text collections. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012, Part II. LNCS, vol. 7447, pp. 360–374. Springer, Heidelberg (2012)
Lee, M.L., Hsu, W., Li, L., Tok, W.H.: Consistent top-k queries over time. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol. 5463, pp. 51–65. Springer, Heidelberg (2009)
Li, F., Yi, K., Le, W.: Top-k queries on temporal data. VLDB J. 19(5), 715–733 (2010)
Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of top-k queries over sliding windows. In: SIGMOD, pp. 635–646. ACM, New York (2006)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Lan, C., Zhang, Y., Xing, C., Li, C. (2014). Continuous Temporal Top-k Query over Versioned Documents. In: Li, F., Li, G., Hwang, Sw., Yao, B., Zhang, Z. (eds) Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science, vol 8485. Springer, Cham. https://doi.org/10.1007/978-3-319-08010-9_55
Download citation
DOI: https://doi.org/10.1007/978-3-319-08010-9_55
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08009-3
Online ISBN: 978-3-319-08010-9
eBook Packages: Computer ScienceComputer Science (R0)