Answering bounded continuous search queries in the world wide web

16th International World Wide Web Conference, WWW2007

Volumn , Issue , 2007, Pages 551-560

  Kukulenz, Dirk ^a   Ntoulas, Alexandros ^b  

^a UNIVERSITY OF LÜBECK   (Germany)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Continuous queries; Monitoring search; Optimal stopping

Indexed keywords

DATA ACQUISITION; ONLINE SEARCHING; OPTIMIZATION; WEB SERVICES; WEBSITES;

CONTINUOUS QUERIES; SEARCH QUERIES; THRESHOLD CLASSIFICATION;

QUERY LANGUAGES;

EID: 35348889034     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1242572.1242647     Document Type: Conference Paper

References (41)

1. ACM Table-of-Contents Alert. URL: http://portal.acm.org, 2006.
2. J. Allan, J. Carboneil, G. Doddington, J. Yamron, and Y. Yang. Topic detection and tracking pilot study: Final report. In Proc. of the DARPA Broadcast News Transcription and Understanding Workshop, pages 194-218, 1998.
3. J. Allan, R. Papka, and V. Lavrenko. On-line new event detection and tracking. In SIGIR '98: Proc. of the 21st annual international. ACM SIGIR conf. on Research and development in information retrieval, pages 37-45, New York, NY, USA, 1998. ACM Press.
4. A. Arampatzis and A. van Hameran. The score-distributional threshold optimization for adaptive binary classification tasks. In SIGIR '01: Proc. of the 24th annual international ACM SIGIR conf. on Research and development in information retrieval, pages 285-293, New York, NY, USA, 2001. ACM Press.
5. A. Arasu, S.Babu, and J.Widom. The cql continuous query language: semantic foundations and query execution. VLDB J., 15(2):121-142,2006.
6. S. Babu and J.Widom. Continuous queries over data streams. SIGMOD Rec., 30(3): 109-120, 2001.
7. K. Collins-Thompson, P. Ogilvie, Y. Zhang, and J. Callan. Information filtering, novelty detection, and named-page finding. In TREC 2002. Gaithersburg, 2002.
8. Elsevier contents direct. URL: http://www.sciencedirect.com/, 2006.
9. P. T. Eugster, P. A. Felber, R. Guerraoui, and A.-M. Kermarrec. The many faces of publish/subscribe. ACM Comput. Surv., 35(2):114-131, 2003.
10. 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 '01: Proc. of the 2001 ACM SIGMOD international conf. on Management of data, pages 115-126, New York, NY, USA, 2001. ACM Press.
11. D. Faensen, L. Faulstich, H. Schweppe, A. Hinze, and A. Steidinger. Hermes: a notification service for digital libraries. In JCDL '01: Proc. of the 1st ACM/IEEE-CS joint conf. on digital libraries, pages 373-380, New York, NY, USA, 2001. ACM Press.
12. T. Ferguson. Who solved the secretary problem? Statistical Science, 4(3):282-289, 1988.
13. P. Foltz and S. Dumais. Personalized information delivery: an analysis of information filtering methods. Commun. ACM, 35(12):51-60, 1992.
14. P. Freeman. The secretary problem and its extensions: a review. Int. Statistical Review, 51:189-206, 1983.
15. K. S. Glasser, R.Holzsager, and A. Barron. The d choice secretary problem. Comm. Statist. -Sequential Anal., 2(3): 177-199, 1983.
16. Google alert. URL: http://www.googlealert.com, 2006.
17. A. Hinze. Efficient filtering of composite events. In Proc. of the 20th British National Database Conf, 2003.
18. D. Hull. The TREC 6 filtering track: Description and analysis. In The Sixth Text Retrieval Conf. (TREC-6), pages 45-68. Gaithersburg, 1997.
19. R. Kadison. Strategies in the secretary problem. Expo. Math., 12(2): 125-144, 1994.
20. J. Kekalainen and K.Jarvelin. Using graded relevance assessments in IR evaluation. J. of the American Society for Information Science and Technology, 53(13), 2002.
21. J. Kendall, and K. Kendall. Information delivery systems: an exploration of web pull and push technologies. Commun. AIS, 1(4es):1-43, 1999.
22. M. Koubarakis, T. Koutris, C. Tryfonopoulos, and P. Raftopoulou. Information alert in distributed digital libraries: The models, languages, and architecture of DIAS. In ECDL '02: Proc. of the 6th European Conf. on Research and Advanced Technology for Digital Libraries, pages 527-542, London, UK, 2002. Springer.
23. L. Liu, C.Pu, and W.Tang. Continual queries for internet scale event-driven information delivery. Knowledge and Data Engineering, 11(4):610-628, 1999.
24. L. Liu, C.Pu, and W.Tang. Webcq-detecting and delivering information changes on the web. In CIKM '00: Proc. of the 9th int. conf. on Information and knowledge management, pages 512-519, New York, NY, USA, 2000. ACM Press.
25. R.-L. Liu and W.-J. Lin. Adaptive sampling for thresholding in document filtering and classification. Inf. Process. Manage., 41(4):745-758, 2005.
26. Windows live alerts. URL: http://alerts.live.com/Alerts/Default.aspx, 2006.
27. G. Mühl. Large-Scale Content-Based Publish /Subscribe Systems. PhD thesis, Darmstadt University of Technology, 2002.
28. S. Pandey, K. Ramamritham, and S. Chakrabarti. Monitoring the dynamic web to respond, to continuous queries. In WWW '03: Proc. of the 12th international conf. on World Wide Web, pages 659-668. ACM Press, 2003.
29. J. Pereira, F. Fabret, F. Llirbat, R. Preotiuc-Pietro, K. A. Ross, and D. Shasha. Publish/subscribe on the web at extreme speed. In VLDB, pages 627-630, 2000.
30. J. Praeter. On multiple choice secretary problems. Mathematics of Operations Research, 19(3):597-602, 1994.
31. S. Robertson and I.Soboroff. The TREC 2002 filtering track report. In The Eleventh Text Retrieval Conf, 2002.
32. G. Salton and M.J.McGill. Introduction to modern information retrieval. McGraw-Hill, 1983.
33. U. Schreier, H.Pirahesh, R.Agrawal, and C Mohan. Alert: An architecture for transforming a passive dbms into an active dbms. In 17th Int. Conf. on Very Large Data Bases (VLDB), pages 469-478, 1991.
34. A. Shiryaev and G.Peskir. Optimal Stopping and Free-Boundary Problems (Lectures in Mathematics. ETH Zürich). Birkhauser, 2006.
35. Springer link alert. URL: http://www.springerlink.com, 2006.
36. T. W. Yan and H.Garcia-Molina. The SIFT information dissemination system. ACM Transactions on Database Systems, 24(4):529-565, 1999.
37. Y. Yang. A study on thresholding strategies for text categorization. In W. B. Croft, D. J. Harper, D. H. Kraft, and J. Zobel, editors, Proc. of SIGIR-01, 24th ACM International Conf. on Research and Development in Information Retrieval, pages 137-145, New Orleans, US, 2001. ACM Press, New York, US.
38. Y. Yang, T. Pierce, and J. Carbonell. A study of retrospective and on-line event detection. In SIGIR '98: Proc. of the 21st annual international ACM SIGIR conf. on Research and development in information retrieval, pages 28-36, New York, NY, USA, 1998. ACM Press.
39. B. Yuwono, S. L. Y. Lam, J. H. Ying, and D. L. Lee. A World Wide Web resource discovery system. In In Fourth International World Wide Web Conf, Boston, pages 145-158, 1995.
40. C. Zhai, P.Jansen, E.Stoica, N.Grot, and D.A.Evans. Threshold calibration in CLARIT adaptive filtering. In Text REtrieval Conf. 1998, pages 96-103, 1998.
41. Y. Zhang and J. Callan. Maximum likelihood estimation for filtering thresholds. In SIGIR '01: Proc. of the 24th annual international ACM SIGIR conf. on Research and development in information retrieval, pages 294-302, New York, NY, USA, 2001. ACM Press.