CoChat
Sign Up
Cited by 22

The DOI matches its Crossref record.

Batch query processing for web search engines

Ding, Shuai, Attenberg, Josh, Baeza-Yates, Ricardo, Suel, Torsten·2011·Proceedings of the fourth ACM international conference on Web search and data mining
DOI 10.1145/1935826.1935858
Open this paper in CoChat — free account

Abstract

Large web search engines are now processing billions of queries per day. Most of these queries are interactive in nature, requiring a response in fractions of a second. However, there are also a number of important scenarios where large batches of queries are submitted for various web mining and system optimization tasks that do not require an immediate response. Given the significant cost of executing search queries over billions of web pages, it is a natural question to ask if such batches of queries can be more efficiently executed than interactive queries.

Overview

Integrity signals

Registry

Crossref · 10.1145/1935826.1935858

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 36

  1. Agrawal R., 1994, Proceedings of the 20th VLDB Conference, 487
  2. 10.1145/1007912.1007925 · DOI
  3. 10.1145/290941.291011 · DOI
  4. 10.1145/1835804.1835859 · DOI
  5. 10.1145/1277741.1277775 · DOI
  6. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval Addison-Wesley 1999. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval Addison-Wesley 1999.
  7. 10.1147/sj.52.0078 · DOI
  8. 10.1145/1772690.1772710 · DOI
  9. 10.1145/1277741.1277855 · DOI
  10. 10.1016/j.ipm.2005.05.003 · DOI
  11. 10.1016/j.ipl.2008.03.017 · DOI
  12. 10.1145/1498759.1498761 · DOI
  13. Dean J., 2004, 6th Symposium on Operating System Design and Implementation, 137
  14. 10.1145/1772690.1772723 · DOI
  15. 10.5555/545381.545393 · DOI
  16. 10.1145/1526709.1526768 · DOI
  17. 10.1145/375663.375671 · DOI
  18. 10.1145/1272996.1273005 · DOI
  19. 10.1145/326440.326445 · DOI
  20. 10.1145/1498759.1498830 · DOI
  21. 10.1145/775152.775156 · DOI
  22. Lempel R., 2003, 12th International World Wide Web Conference
  23. 10.5555/1315451.1315464 · DOI
  24. 10.1145/1060745.1060785 · DOI
  25. Markatos E., 2000, 5th International Web Caching and Content Delivery Workshop
  26. 10.1145/1277741.1277776 · DOI
  27. 10.1002/(SICI)1097-4571(199610)47:10%3C749::AID-ASI3%3E3.3.CO;2-U · DOI
  28. 10.1145/1772690.1772771 · DOI
  29. 10.1145/383952.383959 · DOI
  30. 10.5555/876875.879017 · DOI
  31. 10.1145/1390334.1390359 · DOI
  32. I. H. Witten A. Moffat and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images Morgan Kaufmann second edition 1999. I. H. Witten A. Moffat and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images Morgan Kaufmann second edition 1999.
  33. Y. Xie and D. O'Hallaron. Locality in search engine queries and its implications for caching. In IEEE Infocom 2002. Y. Xie and D. O'Hallaron. Locality in search engine queries and its implications for caching. In IEEE Infocom 2002.
  34. 10.1145/1526709.1526764 · DOI
  35. 10.1145/1367497.1367550 · DOI
  36. 10.1145/1132956.1132959 · DOI

Cited by

Sorted by citations

See all 22

Metadata

Authors
Ding, S., Attenberg, J., Baeza-Yates, R., & Suel, T.
Venue
Proceedings of the fourth ACM international conference on Web search and data mining
Publisher
ACM
Published
2011-02-09
Pages
137-146
DOI
10.1145/1935826.1935858
Cited by
22
References
0
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Batch query processing for web search engines. https://app.cochat.ai/papers/10.1145/1935826.1935858
The paper
Ding, S., Attenberg, J., Baeza-Yates, R., & Suel, T. (2011). Batch query processing for web search engines. Proceedings of the fourth ACM international conference on Web search and data mining. https://doi.org/10.1145/1935826.1935858