MemCache-使用有向无环图表示数据的依赖关系？
MemCache-using directed acyclic graph representing the dependencies of data?
我正在阅读来自 facebook 的 memached 论文。其中一部分提到它通过同时获取最大数量的项目来减少延迟。这是引用：
"We structure our web- application code to minimize the number of network round trips necessary to respond to page requests. We construct a directed acyclic graph (DAG) representing the dependencies between data. A web server uses this DAG to maximize the number of items that can be fetched concurrently. On average these batches consist of 24 keys per request."
这里指的是什么数据？网页？图片？它如何依赖于其他数据？
显示网页所需的数据。 post 依赖于 poster、图像、评论和更多东西。并且评论依赖于poster等等
我正在阅读来自 facebook 的 memached 论文。其中一部分提到它通过同时获取最大数量的项目来减少延迟。这是引用：
"We structure our web- application code to minimize the number of network round trips necessary to respond to page requests. We construct a directed acyclic graph (DAG) representing the dependencies between data. A web server uses this DAG to maximize the number of items that can be fetched concurrently. On average these batches consist of 24 keys per request."
这里指的是什么数据？网页？图片？它如何依赖于其他数据？
显示网页所需的数据。 post 依赖于 poster、图像、评论和更多东西。并且评论依赖于poster等等