Techniques for making a replica of a group of database objects
    1.
    发明申请
    Techniques for making a replica of a group of database objects 审中-公开
    制作一组数据库对象的副本的技术

    公开(公告)号:US20060149799A1

    公开(公告)日:2006-07-06

    申请号:US11366039

    申请日:2006-03-01

    IPC分类号: G06F17/30

    摘要: Techniques for making a replica of a particular group of database objects on a particular node of a network include receiving, during a transfer period, a first copy of the particular group of objects at the particular node from a first node on the network. The particular node receives, from a second node on the network, data indicating changes to the particular group of database objects on the second node, where the changes indicated in the data are changes that were made at the second node during the transfer period. The first copy of the particular group of database objects is modified based on the data indicating changes.

    摘要翻译: 用于在网络的特定节点上制作数据库对象的特定组的副本的技术包括在传输周期期间从网络上的第一节点在特定节点处接收特定对象组的第一副本。 特定节点从网络上的第二节点接收指示对第二节点上的特定数据库对象组的改变的数据,其中在数据中指示的改变是在传送周期期间在第二节点进行的改变。 数据库对象的特定组的第一个副本将根据指示更改的数据进行修改。

    Techniques for replicating groups of database objects
    2.
    发明申请
    Techniques for replicating groups of database objects 有权
    复制数据库对象组的技术

    公开(公告)号:US20060155789A1

    公开(公告)日:2006-07-13

    申请号:US11366300

    申请日:2006-03-01

    IPC分类号: G06F17/30

    摘要: Techniques for making a replica of a particular group of database objects of a database on a particular node that does not initially have the particular group of database objects include determining whether conditions for copying a full database from a first node are satisfied. If conditions for copying the full database from the first node are not satisfied, then a database-object-copy routine is employed for each database object in the particular group of database objects. If conditions for copying the full database from the first node are satisfied, then a full-database-copy routine for performing a copy of an entire database is employed.

    摘要翻译: 用于制作特定节点上数据库的特定数据库对象的副本的技术,该数据库对象最初不具有特定的数据库对象组,包括确定是否满足从第一个节点复制完整数据库的条件。 如果不满足从第一个节点复制完整数据库的条件,则对数据库对象的特定组中的每个数据库对象采用数据库对象复制例程。 如果满足从第一个节点复制完整数据库的条件,则采用用于执行整个数据库副本的全数据库复制例程。

    Parallel queue propagation
    3.
    发明授权
    Parallel queue propagation 失效
    并行队列传播

    公开(公告)号:US5870761A

    公开(公告)日:1999-02-09

    申请号:US770573

    申请日:1996-12-19

    IPC分类号: G06F17/30

    摘要: A method and system are provided for duplicating at a destination site changes made to data at a source site. According to the method a plurality of streams are established between the source site and the destination site. The plurality of streams are used in parallel to propagate changes made at the source site to the destination site. A record of transactions that made changes that need to be propagated from the source site to the destination site is maintained at the source site. Before propagating changes made by a transaction to the destination site on a stream of the plurality of streams, the record of transactions is inspected to identify a set of transactions whose changes are not known to have been made permanent at the destination site. It is then determined whether the transaction could possibly depend on any transaction in the set of transactions. If the transaction could not possibly depend on any transaction in the set of transactions, then the changes made by the transaction are propagated to the destination site using one of the plurality of streams.

    摘要翻译: 提供了一种方法和系统,用于在目的地站点复制源站点上的数据。 根据该方法,在源站点和目的站点之间建立多个流。 多个流并行使用,以将源站点处的更改传播到目标站点。 源站点上保留了需要从源站点传播到目标站点的更改事务记录。 在将交易所做的改变传播到多个流的流之前的目的地站点之前,检查事务的记录以识别一组事务,其变化不知道已经在目的地站点被永久化。 然后确定交易是否可能依赖于该组交易中的任何交易。 如果事务不可能依赖于事务集合中的任何事务,则事务所做的更改使用多个流中的一个传播到目标站点。

    Multi-tier caching system
    4.
    发明授权
    Multi-tier caching system 有权
    多层缓存系统

    公开(公告)号:US06732237B1

    公开(公告)日:2004-05-04

    申请号:US09650498

    申请日:2000-08-29

    IPC分类号: G06F1200

    CPC分类号: G06F12/0897

    摘要: A multi-tier caching system is provided for a computing device. The system comprises a first cache implemented in operating system or kernel space (e.g., in memory managed by or allocated to an operating system). The system also comprises a second cache implemented in application or user space (e.g., in memory managed by or allocated to an application program). Also provided is a method of operating the multi-tier caching system to serve one type of data from the first cache and a second type of data from the second cache. The first cache may store frequently requested data items and/or those that require little processing of a data request in order to identify a responsive data item. The first cache may also store data items that can be served in response to data requests having different forms, types, parameters, qualifiers or other indicia. Data that may vary according to the form or content of a data request, and data items that are responsive to data requests that must be fully parsed, examined or processed may be stored in the second cache. A content analysis engine may be configured to determine which of said first cache and said second cache a data item should be stored in. Such determinations may be made by analyzing data requests and/or data items served in response to the requests, guidelines set by a system administrator, and other criteria.

    摘要翻译: 为计算设备提供了多层缓存系统。 该系统包括在操作系统或内核空间中实现的第一缓存(例如,在由操作系统管理或分配给操作系统的存储器中)。 该系统还包括在应用程序或用户空间中实现的第二缓存(例如,在由应用程序管理或分配给应用程序的存储器中)。 还提供了一种操作多层缓存系统以从第一高速缓存提供一种类型的数据和来自第二高速缓存的第二类型的数据的方法。 第一缓存可以存储经常请求的数据项和/或需要很少处理数据请求的数据项,以便识别响应数据项。 第一缓存还可以存储可以响应于具有不同形式,类型,参数,限定符或其他标记的数据请求而被服务的数据项。 可以根据数据请求的形式或内容而变化的数据以及响应于必须被完全解析,检查或处理的数据请求的数据项可以存储在第二高速缓存中。 内容分析引擎可以被配置为确定所述第一高速缓存和所述第二高速缓存中的哪一个应该被存储在数据项中。这样的确定可以通过分析响应于请求而服务的数据请求和/或数据项,由 系统管理员等标准。

    Minimum leaf spanning tree
    5.
    发明授权
    Minimum leaf spanning tree 失效
    最小叶生成树

    公开(公告)号:US6105018A

    公开(公告)日:2000-08-15

    申请号:US049285

    申请日:1998-03-26

    IPC分类号: G06F17/30

    摘要: An efficient set of indexes to cover a plurality of anticipated query types is determined by building a directed acyclic graph whose nodes correspond to anticipated query types. A minimum leaf spanning tree for the equivalent graph is determined by repeatedly finding an augmenting path for a current spanning tree and producing a reduced leaf spanning tree based on the current spanning tree and the augmenting path until an augmenting path can no longer be found. The leaves of the minimum leaf spanning tree indicate which indexes should be built.

    摘要翻译: 通过构建其节点对应于预期查询类型的有向无环图来确定覆盖多个预期查询类型的有效索引集合。 通过重复地找到当前生成树的扩充路径并且基于当前生成树和增强路径生成减少的叶生成树来确定等效图的最小叶生成树,直到不再能够找到扩展路径。 最小叶生成树的叶指示应构建哪些索引。

    Dequeuing using queue batch numbers
    6.
    发明授权
    Dequeuing using queue batch numbers 失效
    使用队列批号排队

    公开(公告)号:US5870760A

    公开(公告)日:1999-02-09

    申请号:US769740

    申请日:1996-12-19

    IPC分类号: G06F17/30

    摘要: A method and system are provided for processing records from a set of records, where records are repeatedly being added to the set of records, and where each record in the set of records has to be processed once for each of a plurality of entities. According to the method, each record that is added to the set of records is marked with a default batch value. For each entity of the plurality of entities, a batch of the records is processed by performing the steps of: reading a last batch value associated with the entity, processing the records in the set of records that are marked with batch values that are more recent than the last batch value associated with the entity, and updating the last batch value associated with the entity to a most recent batch value of the records processed for the entity. Between processing consecutive batches for an entity of the plurality of entities, the set of records are marked by performing the steps of: updating a batch counter value to reflect a more recent batch number; and marking all records in the set of records that have the default batch value with the batch counter value.

    摘要翻译: 提供了一种方法和系统,用于处理来自一组记录的记录,其中记录被重复地添加到记录集合中,并且记录集合中的每个记录必须对于多个实体中的每一个进行一次处理。 根据该方法,添加到记录集中的每个记录都标有默认批次值。 对于多个实体中的每个实体,通过执行以下步骤来处理一批记录:读取与该实体相关联的最后批次值,处理标记有较新近的批次值的记录集中的记录 而不是与该实体相关联的最后一个批次值,并将与实体关联的最后一个批次值更新为为该实体处理的记录的最新批次值。 在处理多个实体的实体的连续批次之间,通过执行以下步骤来标记该组记录:更新批计数器值以反映更新的批次号; 并将具有默认批次值的记录集中的所有记录标记为批计数器值。

    Recoverable data replication between source site and destination site
without distributed transactions
    7.
    发明授权
    Recoverable data replication between source site and destination site without distributed transactions 失效
    源站点和目标站点之间的可恢复数据复制,无需分布式事务

    公开(公告)号:US5781912A

    公开(公告)日:1998-07-14

    申请号:US772003

    申请日:1996-12-19

    IPC分类号: G06F11/14 G06F11/00 G06F13/00

    摘要: A method and system are provided for recovering after a failure in a data replication environment. According to the method, a transaction is executed at a source site that makes changes that must be replicated at a destination site. The changes are made permanent at the source site. The changes are made permanent at the source site without the source site being informed as to whether the changes were successfully applied at the destination site. The changes are sent to the destination site. The changes are applied at the destination site. If the changes are successfully applied before the failure, then the changes are made permanent at the destination site and a record is added to a set of records at the destination site. The record indicates that the changes where made permanent at the destination site. After a failure, the set of records at the destination site are used to determine which changes must be sent from the source site to the destination site after the failure.

    摘要翻译: 提供了一种用于在数据复制环境中的故障​​之后进行恢复的方法和系统。 根据该方法,在源站点执行事务,进行必须在目标站点复制的更改。 更改在源站点永久保存。 更改在源站点永久存在,而不会通知源站点是否在目标站点成功应用更改。 更改将发送到目标站点。 更改应用于目标站点。 如果更改在故障之前成功应用,则更改将在目标站点永久保留,并将记录添加到目标站点上的一组记录。 记录表明在目的地站点永久存在的变化。 发生故障后,目标站点上的记录集用于确定在发生故障后哪些更改必须从源站点发送到目标站点。