Efficient query subscription processing for prospective search engines

Authors:
Utku Irmak;Svilen Mihaylov;Torsten Suel;Samrat Ganguly;Rauf Izmailov
Affiliations:
Polytechnic University, Brooklyn, NY;University of Pennsylvania, Philadelphia, PA;Polytechnic University, Brooklyn, NY;NEC Laboratories America, Inc., Princeton, NJ;NEC Laboratories America, Inc., Princeton, NJ
Venue:
Proceedings of the 15th international conference on World Wide Web
Year:
2006

Citing 5
Cited 2

The SIFT information dissemination system

ACM Transactions on Database Systems (TODS)
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Filtering algorithms and implementation for very fast publish/subscribe systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Forwarding in a content-based network

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient query subscription processing for prospective search engines

ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference

Fostering knowledge sharing by inverse search

Proceedings of the 4th international conference on Knowledge capture
Closing Information Gaps with Inverse Search

PAKM '08 Proceedings of the 7th International Conference on Practical Aspects of Knowledge Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current web search engines are retrospective in that they limit users to searches against already existing pages. Prospective search engines, on the other hand, allow users to upload queries that will be applied to newly discovered pages in the future. We study and compare algorithms for efficiently matching large numbers of simple keyword queries against a stream of newly discovered pages.