Efficient query subscription processing for prospective search engines

Utku Irmak; Svilen Mihaylov; Torsten Suel; Samrat Ganguly; Rauf Izmailov

doi:10.1145/1135777.1136003

Efficient query subscription processing for prospective search engines

Utku Irmak, Svilen Mihaylov, Torsten Suel, Samrat Ganguly, Rauf Izmailov

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	Proceedings of the 15th International Conference on World Wide Web
Pages	1037-1038
Number of pages	2
DOIs	https://doi.org/10.1145/1135777.1136003
State	Published - 2006
Event	15th International Conference on World Wide Web - Edinburgh, Scotland, United Kingdom Duration: May 23 2006 → May 26 2006

Publication series

Name	Proceedings of the 15th International Conference on World Wide Web

Other

Other	15th International Conference on World Wide Web
Country/Territory	United Kingdom
City	Edinburgh, Scotland
Period	5/23/06 → 5/26/06

Keywords

Inverted index
Prospective search
Query processing

ASJC Scopus subject areas

Computer Networks and Communications
Software

Access to Document

10.1145/1135777.1136003

Cite this

Efficient query subscription processing for prospective search engines. / Irmak, Utku; Mihaylov, Svilen; Suel, Torsten et al.
Proceedings of the 15th International Conference on World Wide Web. 2006. p. 1037-1038 (Proceedings of the 15th International Conference on World Wide Web).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Irmak, U, Mihaylov, S, Suel, T, Ganguly, S & Izmailov, R 2006, Efficient query subscription processing for prospective search engines. in Proceedings of the 15th International Conference on World Wide Web. Proceedings of the 15th International Conference on World Wide Web, pp. 1037-1038, 15th International Conference on World Wide Web, Edinburgh, Scotland, United Kingdom, 5/23/06. https://doi.org/10.1145/1135777.1136003

@inproceedings{51f5c43bfa914429965fb2a6ea98b31b,

title = "Efficient query subscription processing for prospective search engines",

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.",

keywords = "Inverted index, Prospective search, Query processing",

author = "Utku Irmak and Svilen Mihaylov and Torsten Suel and Samrat Ganguly and Rauf Izmailov",

year = "2006",

doi = "10.1145/1135777.1136003",

language = "English (US)",

isbn = "1595933239",

series = "Proceedings of the 15th International Conference on World Wide Web",

pages = "1037--1038",

booktitle = "Proceedings of the 15th International Conference on World Wide Web",

}

TY - GEN

T1 - Efficient query subscription processing for prospective search engines

AU - Irmak, Utku

AU - Mihaylov, Svilen

AU - Suel, Torsten

AU - Ganguly, Samrat

AU - Izmailov, Rauf

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Inverted index

KW - Prospective search

KW - Query processing

UR - http://www.scopus.com/inward/record.url?scp=34250688757&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250688757&partnerID=8YFLogxK

U2 - 10.1145/1135777.1136003

DO - 10.1145/1135777.1136003

M3 - Conference contribution

AN - SCOPUS:34250688757

SN - 1595933239

SN - 9781595933232

T3 - Proceedings of the 15th International Conference on World Wide Web

SP - 1037

EP - 1038

BT - Proceedings of the 15th International Conference on World Wide Web

T2 - 15th International Conference on World Wide Web

Y2 - 23 May 2006 through 26 May 2006

ER -

Efficient query subscription processing for prospective search engines

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this