观点转述 · 非原话引用

Web search involves matching many pages with many queries

Parag Agrawal describes web search as a matching problem involving hundreds of billions of pages and queries over time.

Parag Agrawal·已发布 2026年8月25日

观点背后的信息

译文仅辅助阅读；核查观点请以原始摘录为准。

Parallel’s Parag Agrawal: Building a New Web for AI Agents

原始摘录

So you have hundreds of billions of pages and hundreds of billions of queries over time, and you need to figure out how to matchmake across these two.

上下文

One way to think about it is it’s a billion-to-billion matching problem, right?

打开原始内容 · 5:10 查看这场访谈

打开该集并跳转至5:10。

时间点来自所提供的转录稿，尚待媒体回放核对。