公开(公告)号：US08656020B1

公开(公告)日：2014-02-18

申请号：US12691369

申请日：2010-01-21

申请人： Pablo Rademacher ,  Joshua Harrison ,  Christopher Harrelson ,  Evan Parker

发明人： Pablo Rademacher ,  Joshua Harrison ,  Christopher Harrelson ,  Evan Parker

IPC分类号： G06F15/173

CPC分类号： G06F17/30902

摘要： A system and method provides secondary resource files in response to a request for a web page from a client device. In response to the request, a server provides an HTML file which identifies a secondary resource file, such as a javascript file, and the current version value of the secondary resource. The HTML file may be associated with a header which prevents the file from being cached. If there is no locally-cached version of the secondary resource file, the file is requested from the server. The server will transmit the secondary resource file with a header indicating that the file is to be stored indefinitely. If there is a locally-cached version of the secondary resource file, the client device compares the version value of the locally-cached version to the received current version value. If the values are different, the client requests the differences between the files. The server provides a difference file which the client device uses in conjunction with the locally-cached version of the secondary resource to generate the current version of the secondary resource.

摘要翻译： 响应于来自客户端设备的网页的请求，系统和方法提供辅助资源文件。 响应于该请求，服务器提供标识辅助资源文件（例如，javascript文件）和辅助资源的当前版本值的HTML文件。 HTML文件可能与头文件关联，从而阻止文件被高速缓存。 如果没有辅助资源文件的本地缓存版本，则从服务器请求该文件。 服务器将传送辅助资源文件，并带有一个头文件，指示该文件将被无限期存储。 如果存在辅助资源文件的本地缓存版本，则客户端设备将本地缓存版本的版本值与接收到的当前版本值进行比较。 如果值不同，则客户端请求文件之间的差异。 服务器提供客户端设备与本地缓存版本的辅助资源结合使用的差异文件，以生成辅助资源的当前版本。

公开(公告)号：US20060047416A1

公开(公告)日：2006-03-02

申请号：US10925751

申请日：2004-08-25

申请人： Andrew Goldberg ,  Christopher Harrelson

发明人： Andrew Goldberg ,  Christopher Harrelson

IPC分类号： G01C21/34

CPC分类号： G01C21/34

摘要： Methods and systems are described for computing shortest paths among a set of locations. A small set of landmarks is chosen and the distance between each location and each landmark is computed and stored. Given source and destination locations, the landmark distances are used to compute lower-bound estimates of distances from locations to the destination. The estimates are then used with a heuristic search to find the shortest path from source to destination.