Method for transferring and displaying data pages on a data network
    1.
    发明授权
    Method for transferring and displaying data pages on a data network 有权
    在数据网络上传输和显示数据页的方法

    公开(公告)号:US06910073B2

    公开(公告)日:2005-06-21

    申请号:US09852750

    申请日:2001-05-11

    摘要: The apparent speed of a connection between a browser at a user station and a proxy or gateway on a network such as the Internet is increased by providing a local proxy at the user station which interacts with a remote proxy. While the remote proxy is retrieving a newly requested World Wide Web page, for example, from the appropriate content provider, it may also be sending to the local proxy a stale cached version of that page. When the new version of the page is finally retrieved, the remote proxy determines the differences between the new version and the stale version, and, assuming the differences do not exceed the new page in size, sends the differences to the local proxy which then reconstructs the new page from the differences and the stale version. The local proxy delivers the new page to the browser, which need not even be aware that a local proxy exists; it is aware only that it received the page it requested. Because computational speed and power are frequently higher and cheaper than transmission speed, the apparent speed of the connection between the user station and the network has been increased at modest cost.

    摘要翻译: 通过在与远程代理进行交互的用户站处提供本地代理来增加在用户站处的浏览器与诸如因特网的网络上的代理或网关之间的连接的速度。 虽然远程代理正在检索新请求的万维网页面,例如,从适当的内容提供商,它也可能会向本地代理发送该页面的陈旧的缓存版本。 当最终检索到新版本的页面时,远程代理确定新版本和陈旧版本之间的差异,并且假设差异不超过新页面的大小,将差异发送到本地代理,然后重建 新页面的差异和陈旧的版本。 本地代理将新页面传递到浏览器,甚至不需要知道本地代理存在; 它只知道它收到了它要求的页面。 由于计算速度和功率通常比传输速度更高和便宜,所以用户站和网络之间的连接的速度已经以适度的成本增加。

    Method for reducing the delay between the time a data page is requested
and the time the data page is displayed
    2.
    发明授权
    Method for reducing the delay between the time a data page is requested and the time the data page is displayed 失效
    用于减少请求数据页面的时间与显示数据页面的时间之间的延迟的方法

    公开(公告)号:US5931904A

    公开(公告)日:1999-08-03

    申请号:US729105

    申请日:1996-10-11

    摘要: The apparent speed of a connection between a browser at a user station and a proxy or gateway on a network such as the Internet is increased by providing a local proxy at the user station which interacts with a remote proxy. While the remote proxy is retrieving a newly requested World Wide Web page, for example, from the appropriate content provider, it may also be sending to the local proxy a stale cached version of that page. When the new version of the page is finally retrieved, the remote proxy determines the differences between the new version and the stale version, and, assuming the differences do not exceed the new page in size, sends the differences to the local proxy which then reconstructs the new page from the differences and the stale version. The local proxy delivers the new page to the browser, which need not even be aware that a local proxy exists; it is aware only that it received the page it requested. Because computational speed and power are frequently higher and cheaper than transmission speed, the apparent speed of the connection between the user station and the network has been increased at modest cost.

    摘要翻译: 通过在与远程代理进行交互的用户站处提供本地代理来增加在用户站处的浏览器与诸如因特网的网络上的代理或网关之间的连接的速度。 虽然远程代理正在检索新请求的万维网页面,例如,从适当的内容提供商,它也可能会向本地代理发送该页面的陈旧的缓存版本。 当最终检索到新版本的页面时,远程代理确定新版本和陈旧版本之间的差异,并且假设差异不超过新页面的大小,将差异发送到本地代理,然后重建 新页面的差异和陈旧的版本。 本地代理将新页面传递到浏览器,甚至不需要知道本地代理存在; 它只知道它收到了它要求的页面。 由于计算速度和功率通常比传输速度更高和便宜,所以用户站和网络之间的连接的速度已经以适度的成本增加。

    Method for reducing perceived delay between a time data is requested and a time data is available for display
    3.
    发明授权
    Method for reducing perceived delay between a time data is requested and a time data is available for display 有权
    减少请求时间数据和时间数据可用于显示的感知延迟的方法

    公开(公告)号:US06240447B1

    公开(公告)日:2001-05-29

    申请号:US09366345

    申请日:1999-08-02

    IPC分类号: G06F1730

    摘要: The apparent speed of a connection between a browser at a user station and a proxy or gateway on a network such as the Internet is increased by providing a local proxy at the user station which interacts with a remote proxy. While the remote proxy is retrieving a newly requested World Wide Web page, for example, from the appropriate content provider, it may also be sending to the local proxy a stale cached version of that page. When the new version of the page is finally retrieved, the remote proxy determines the differences between the new version and the stale version, and, assuming the differences do not exceed the new page in size, sends the differences to the local proxy which then reconstructs the new page from the differences and the stale version. The local proxy delivers the new page to the browser, which need not even be aware that a local proxy exists; it is aware only that it received the page it requested. Because computational speed and power are frequently higher and cheaper than transmission speed, the apparent speed of the connection between the user station and the network has been increased at modest cost.

    摘要翻译: 通过在与远程代理进行交互的用户站处提供本地代理来增加在用户站处的浏览器与诸如因特网的网络上的代理或网关之间的连接的速度。 虽然远程代理正在检索新请求的万维网页面,例如,从适当的内容提供商,它也可能会向本地代理发送该页面的陈旧的缓存版本。 当最终检索到新版本的页面时,远程代理确定新版本和陈旧版本之间的差异,并且假设差异不超过新页面的大小,将差异发送到本地代理,然后重建 新页面的差异和陈旧的版本。 本地代理将新页面传递到浏览器,甚至不需要知道本地代理存在; 它只知道它收到了它要求的页面。 由于计算速度和功率通常比传输速度更高和便宜,所以用户站和网络之间的连接的速度已经以适度的成本增加。

    Messaging system with application-defined states
    4.
    发明授权
    Messaging system with application-defined states 有权
    具有应用程序定义状态的消息系统

    公开(公告)号:US06442546B1

    公开(公告)日:2002-08-27

    申请号:US09222881

    申请日:1998-12-30

    IPC分类号: G06F1730

    摘要: A messaging system in which a core messaging infrastructure stores and manages messaging attributes, but applications external to the core infrastructure define and modify most attributes. Attribute types may be easily defined or modified, the manner in which attribute values are obtained may be easily defined or modified, and the entity types to which attributes are assigned may be easily defined or modified. The messaging system includes a plurality of messaging entities, such as messages, folders, and users, a plurality of attributes associated with the messaging entities, and a plurality of applications. Each application is operable to examine and modify at least some of the messaging entities and attributes. An application selection device is operable to examine at least some of the messaging entities and at least some of the attributes and to select an application to be invoked, from among the plurality of applications, based on values of the examined messaging entities and attributes. An application invocation device invokes the selected application. The applications may define and modify a type of an attribute and/or may define and modify an association of an attribute with a messaging entity.

    摘要翻译: 消息系统,其中核心消息传递基础设施存储和管理消息传递属性,但核心基础设施外部的应用程序定义和修改大多数属性。 可以容易地定义或修改属性类型,可以容易地定义或修改获得属性值的方式,并且可以容易地定义或修改分配给哪些属性的实体类型。 消息系统包括多个消息传送实体,诸如消息,文件夹和用户,与消息传递实体相关联的多个属性以及多个应用。 每个应用程序可操作以检查和修改至少一些消息传递实体和属性。 应用选择设备可操作以基于所检查的消息传送实体和属性的值,从多个应用程序中检查至少一些消息接发实体和至少一些属性并从多个应用中选择要被调用的应用。 应用程序调用设备调用所选的应用程序。 应用可以定义和修改属性的类型和/或可以定义和修改属性与消息传递实体的关联。

    Method and apparatus for analyzing co-evolving time sequences
    5.
    发明授权
    Method and apparatus for analyzing co-evolving time sequences 失效
    用于分析共同演进的时间序列的方法和装置

    公开(公告)号:US6055491A

    公开(公告)日:2000-04-25

    申请号:US953578

    申请日:1997-10-17

    IPC分类号: G06G7/02 G06G7/19

    CPC分类号: G06G7/02

    摘要: An analyzer system that analyzes a plurality of co-evolving time sequences to, for example, perform correlation or outlier detection on the time sequences. The plurality of co-evolving time sequences comprise a delayed time sequence and one or more known time sequences. A goal is to predict the delayed value given the available information. The plurality of time sequences have a present value and (N-1) past values, where N is the number of samples (time-ticks) of each time sequence. The analyzer system receives the plurality of co-evolving time sequences and determines a window size ("w"). The analyzer then assigns the delayed time sequence as a dependent variable and the present value of a subset of the known time sequences, and the past values of the subset of known time sequences and the delayed time sequence, as a plurality of independent variables. Past values delayed by up to "w" steps are considered. The analyzer then forms an equation comprising the dependent variable and the independent variables, and then solves the equation using a least squares method. The delayed time sequence is then determined using the solved equation.

    摘要翻译: 分析系统,其分析多个共同演进的时间序列,以便例如对时间序列执行相关或异常值检测。 多个共同演进的时间序列包括延迟时间序列和一个或多个已知时间序列。 一个目标是预测给定可用信息的延迟值。 多个时间序列具有当前值和(N-1)个过去值,其中N是每个时间序列的采样数(时间刻度)。 分析器系统接收多个共同演进的时间序列并确定窗口大小(“w”)。 然后,分析器将延迟的时间序列分配为因变量,将已知时间序列的子集的现值以及已知时间序列的子集的过去值和延迟的时间序列分配为多个独立变量。 考虑到延迟最多为“w”步的过去值。 然后,分析器形成包含因变量和独立变量的方程,然后使用最小二乘法求解方程。 然后使用求解的方程确定延迟时间序列。

    Method of performing approximate substring indexing
    6.
    发明授权
    Method of performing approximate substring indexing 有权
    执行近似子串索引的方法

    公开(公告)号:US07444326B1

    公开(公告)日:2008-10-28

    申请号:US11314759

    申请日:2005-12-21

    IPC分类号: G06F17/30

    摘要: Approximate substring indexing is accomplished by decomposing each string in a database into overlapping “positional q-grams”, sequences of a predetermined length q, and containing information regarding the “position” of each q-gram within the string (i.e., 1st q-gram, 4th q-gram, etc.). An index is then formed of the tuples of the positional q-gram data (such as, for example, a B-tree index or a hash index). Each query applied to the database is similarly parsed into a plurality of positional q-grams (of the same length), and a candidate set of matches is found. Position-directed filtering is used to remove the candidates which have the q-grams in the wrong order and/or too far apart to form a “verified” output of matching candidates. If errors are permitted (defined in terms of an edit distance between each candidate and the query), an edit distance calculation can then be performed to produce the final set of matching strings.

    摘要翻译: 通过将数据库中的每个字符串分解为重叠的“位置q-gram”,预定长度q的序列,并且包含关于字符串中每个q-gram的“位置”的信息(即,1 st q-gram,4 nd q-gram等)。 然后由位置q-gram数据(例如,B树索引或散列索引)的元组形成索引。 应用于数据库的每个查询也被类似地解析为多个位置q-gram(相同长度),并且找到候选的匹配集合。 位置定向滤波用于去除具有错误顺序的q-gram和/或相距太远的候选,以形成匹配候选的“验证”输出。 如果允许错误(根据每个候选者和查询之间的编辑距离定义),则可以执行编辑距离计算以产生最终匹配的字符串。

    Local logging in a distributed database management computer system
    8.
    发明授权
    Local logging in a distributed database management computer system 失效
    本地登录分布式数据库管理计算机系统

    公开(公告)号:US5966706A

    公开(公告)日:1999-10-12

    申请号:US803042

    申请日:1997-02-19

    IPC分类号: G06F11/14 G06F17/30

    摘要: A distributed database management computer system includes a plurality of nodes and a plurality of database pages. When a first node in the computer system updates a first database page, the first node generates a log record. The first node determines whether it manages the first database page. If the first node determines that it manages the first database page, the first node writes the log record to a log storage local to the first node. However, if the first node determines that it does not manage the first database page, the first node then determines whether it includes a local log storage. If the first node includes a local log storage, the first node writes the log record to the local log storage, even if the first node does not manage the first database page. If the first node does not include a local log storage, the first node sends the log record to a second node managing the first database page.

    摘要翻译: 分布式数据库管理计算机系统包括多个节点和多个数据库页面。 当计算机系统中的第一个节点更新第一个数据库页面时,第一个节点生成一个日志记录。 第一个节点确定它是否管理第一个数据库页面。 如果第一个节点确定它管理第一个数据库页面,则第一个节点将日志记录写入本地的第一个节点的日志存储。 然而,如果第一节点确定它不管理第一数据库页面,则第一节点然后确定其是否包括本地日志存储器。 如果第一个节点包括本地日志存储,则第一个节点将日志记录写入本地日志存储,即使第一个节点没有管理第一个数据库页面。 如果第一个节点不包括本地日志存储,则第一个节点将日志记录发送到管理第一个数据库页面的第二个节点。

    Distributed caching scheme for database systems
    10.
    发明授权
    Distributed caching scheme for database systems 失效
    数据库系统的分布式缓存方案

    公开(公告)号:US6154749A

    公开(公告)日:2000-11-28

    申请号:US7983

    申请日:1998-01-15

    IPC分类号: G06F17/30

    摘要: A caching scheme for spatially distributed databases in which a central database maintains all information to be stored. A plurality of local databases include copies of the information stored in the central database. For each data record in the central database, there is at most one copy of the data record in the set of local databases.The caching scheme includes a method for serving database requests in which a service request is made to a first local database located in the area from which the request originates. If the first local database fails to service the request, the central database services the request. After serving the request, a second local database that contains the data record is identified and the data record therein is destroyed. A new copy is written to the first local database.

    摘要翻译: 用于空间分布式数据库的缓存方案,其中中央数据库维护要存储的所有信息。 多个本地数据库包括存储在中央数据库中的信息的副本。 对于中央数据库中的每个数据记录,本地数据库集中的数据记录最多只有一个副本。 缓存方案包括一种用于服务数据库请求的方法,其中对位于请求发起的区域中的第一本地数据库进行服务请求。 如果第一个本地数据库无法对请求进行服务,则中央数据库将为请求提供服务。 在提供请求之后,识别包含数据记录的第二本地数据库,并且其中的数据记录被破坏。 新的副本将写入第一个本地数据库。