Durable top-k search in document archives

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 555-566

  Hou U, Leong ^a   Mamoulis, Nikos ^a   Berberich, Klaus ^b   Bedathur, Srikanta ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

document archives; temporal queries; top k search

Indexed keywords

ARCHIVED DATA; DOCUMENT ARCHIVES; EXECUTION PARADIGM; INDEXING TECHNIQUES; INTERNET ARCHIVE; K ELEMENTS; KEYWORD QUERIES; RANK AGGREGATION; RANKING PROBLEMS; SPACE PARTITIONING; TEMPORAL QUERIES; TIME INTERVAL; TOP-K QUERY; WEB ARCHIVES; WIKIPEDIA;

INFORMATION RETRIEVAL;

EID: 77954751022     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807228     Document Type: Conference Paper

References (26)

1. V. N. Anh and A. Moffat. Pruned query evaluation using pre-computed impacts. In SIGIR, pages 372-379, 2006.
2. V. N. Anh and A. Moffat. Pruning strategies for mixed-mode querying. In CIKM, pages 190-197, 2006.
3. N. Bansal, F. Chiang, N. Koudas, and F. W. Tompa. Seeking stable clusters in the blogosphere. In VLDB, pages 806-817, 2007.
4. N. Bansal and N. Koudas. Blogscope: a system for online analysis of high volume text streams. In VLDB, pages 1410-1413, 2007.
5. K. Berberich, S. J. Bedathur, T. Neumann, and G. Weikum. A time machine for text search. In SIGIR, pages 519-526, 2007.
6. K. Berberich, S. J. Bedathur, and G. Weikum. Efficient time-travel on versioned text collections. In BTW, pages 44-63, 2007.
7. A. Z. Broder, N. Eiron, M. Fontoura, M. Herscovici, R. Lempel, J. McPherson, R. Qi, and E. J. Shekita. Indexing shared content in information retrieval systems. In EDBT, pages 313-330, 2006.
8. G. M. D. Corso, A. Gulli, and F. Romani. Ranking a stream of news. In WWW, pages 97-106, New York, NY, USA, 2005. ACM Press.
9. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer, Berlin, 3rd ed. edition, 2008.
10. M. Dubinko, R. Kumar, J. Magnani, J. Novak, P. Raghavan, and A. Tomkins. Visualizing tags over time. ACM Trans. Web, 1(2):7, 2007.
11. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614-656, 2003.
12. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD Conference, pages 47-57, 1984.
13. J. He, H. Yan, and T. Suel. Compact full-text indexing of versioned document collections. In CIKM, pages 415-424, 2009.
14. M. Herscovici, R. Lempel, and S. Yogev. Efficient indexing of versioned document sequences. In ECIR, pages 76-87, 2007.
15. J. Kleinberg. Temporal Dynamics of On-Line Information Streams. In M. Garofalakis, J. Gehrke, and R. Rastogi, editors, Data Stream Management Processing High-Speed Data Streams. Springer-Verlag, 2006.
16. M.-L. Lee, W. Hsu, L. Li, and W. H. Tok. Consistent top-k queries over time. In DASFAA, pages 51-65, 2009.
17. X. Li and W. B. Croft. Time-based language models. In CIKM, pages 469-475, New York, NY, USA, 2003. ACM.
18. N. Mamoulis, M. L. Yiu, K. H. Cheng, and D. W. Cheung. Efficient top- aggregation of ranked inputs. ACM Trans. Database Syst., 32(3):19, 2007.
19. J. M. Ponte and W. B. Croft. A language modeling approach to information retrieval. In SIGIR, pages 275-281, New York, NY, USA, 1998. ACM.
20. S. E. Robertson and S. Walker. Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval. In SIGIR, pages 232-241, New York, NY, USA, 1994. Springer-Verlag New York, Inc.
21. S. Schleimer, D. S. Wilkerson, and A. Aiken. Winnowing: Local algorithms for document fingerprinting. In SIGMOD Conference, pages 76-85, 2003.
22. R. Sherkat and D. Rafiei. On efficiently searching trajectories and archival data for historical similarities. PVLDB, 1(1):896-908, 2008.
23. A. Singhal, C. Buckley, and M. Mitra. Pivoted document length normalization. In SIGIR, pages 21-29, 1996.
24. K. Sparck Jones. A statistical interpretation of term specificity and its application in retrieval. Journal of Documentation, 28(1):11-21, 1972.
25. J. Zhang and T. Suel. Efficient search in large textual collections with redundancy. In WWW, pages 411-420, New York, NY, USA, 2007. ACM.
26. M. Zhu, S. Shi, M. Li, and J.-R. Wen. Effective top-k computation with term-proximity support. Inf. Process. Manage., 45(4):401-412, 2009.