Top-k publish-subscribe for social annotation of news

Proceedings of the VLDB Endowment

Volumn 6, Issue 6, 2013, Pages 385-396

  Shraer, Alexander ^a   Gurevich, Maxim ^a   Fontoura, Marcus ^a   Josifovski, Vanja ^a  

^a GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE SOLUTIONS; CACHING TECHNIQUE; CONTENT-BASED PUBLISH SUBSCRIBE; NOVEL ARCHITECTURE; PUBLISH-SUBSCRIBE; REAL-TIME INDEXING; SOCIAL ANNOTATIONS; SOCIAL CONTENTS;

SOCIAL NETWORKING (ONLINE);

EID: 84881230657     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2536336.2536340     Document Type: Article

References (25)

1. M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra. Matching events in a content-based subscription system. In PODC, pages 53-61, 1999.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In PODS, pages 1-16, 2002.
3. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999.
4. G. Banavar, T. Chanra, B. Mukherjee, J. Nagarajarao, R. E. Strom, and D. C. Sturman. An efficient multicast protocol for content-based publish-subscribe systems. In ICDCS, pages 262-272, 1999.
5. R. Blanco, E. Bortnikov, F. Junqueira, R. Lempel, L. Telloli, and H. Zaragoza. Caching search engine results over incremental indices. In WWW, pages 82-89, 2010.
6. C. Bohm, B. C. Ooi, C. Plant, and Y. Yan. Efficiently processing continuous k-nn queries on data streams. In ICDE, pages 156-165, 2007.
7. A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Zien. Efficient query evaluation using a two-level retrieval process. In CIKM, pages 426-434, 2003.
8. C. Buckley and A. F. Lewit. Optimization of inverted vector searches. In SIGIR, pages 97-110, 1985.
9. D. Carmel and E. Amitay. Juru at 2006: Taat versus daat in the terabyte track. In TREC, 2006.
10. A. Carzaniga and A. L. Wolf. Forwarding in a content-based network. In SIGCOMM, pages 163-174, 2003.
11. Y. Diao, M. Altinel, M. J. Franklin, H. Zhang, and P. Fischer. Path sharing and predicate evaluation for high-performance xml filtering. TODS, 28:467-516, 2003.
12. F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe systems. In SIGMOD, pages 115-126, 2001.
13. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102-113, 2001.
14. Google Alerts. http://alerts.google.com/.
15. P. Haghani, S. Michel, and K. Aberer. Evaluating top-k queries over incomplete data streams. In CIKM, pages 877-886, 2009.
16. P. Haghani, S. Michel, and K. Aberer. The gist of everything new: personalized top-k processing over web 2.0 streams. In CIKM, pages 489-498, 2010.
17. B. Keane. Twitter v the msm: covering gaddafi's war against reality. http://www.crikey.com.au/2011/03/21/twitter-v-the-msm-covering-gaddafis-war-against-reality/, 2011.
18. P. Lacour, C. Macdonald, and I. Ounis. Efficiency comparison of document matching techniques. In Efficiency Issues in Information Retrieval Workshop; European Conference for Information Retrieval, 2008.
19. A. Machanavajjhala, E. Vee, M. N. Garofalakis, and J. Shanmugasundaram. Scalable ranked publish/subscribe. PVLDB, 1(1):451-462, 2008.
20. K. Pripuzic, I. P. Zarko, and K. Aberer. Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w. In DEBS, pages 127-138, 2008.
21. A. C. Snoeren, K. Conley, and D. K. Gifford. Mesh-based content routing using xml. In SOSP, pages 160-173, 2001.
22. T. Strohman, H. R. Turtle, and W. B. Croft. Optimization strategies for complex queries. In SIGIR, pages 219-225, 2005.
23. H. R. Turtle and J. Flood. Query evaluation: Strategies and optimizations. Information Processing and Management, 31(6):831-850, 1995.
24. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB, pages 194-205, 1998.
25. B. Yang and G. Jeh. Retroactive answering of search queries. In WWW, pages 457-466, 2006.