利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

37 条记录 (耗时 0.031 秒)

    Method for efficient maintenance of XML indexes
    1.
    发明申请
    Method for efficient maintenance of XML indexes 失效
    有效维护XML索引的方法

    公开(公告)号：US20070005632A1

    公开(公告)日：2007-01-04

    申请号：US11171769

    申请日：2005-06-30

    申请人： Stefano Stefani ,  Denis Churin ,  Istvan Cseri

    发明人： Stefano Stefani ,  Denis Churin ,  Istvan Cseri

    IPC分类号： G06F7/00

    CPC分类号： G06F17/30911 ,  G06F17/30336 ,  Y10S707/99933 ,  Y10S707/99952

    摘要： An update to a primary table is received. The primary table is read to determine the set of rows to be updated. The primary table is updated and XML objects stored in XML columns are overwritten according to the update. A pre-update node table comprising the nodes corresponding to the updated rows is created from an XML index table corresponding to the primary table. A post-update node table is created by shedding the updated XML objects. The post-update table and the pre-update table are merged according to their node identifiers. The resulting merged table can be inspected to determine which nodes have been, added, deleted, or updated. Based on this inspection, the necessary additions and deletions can be efficiently made to the XML index table.

    摘要翻译： 接收到主表的更新。 读取主表以确定要更新的行集。 更新主表，并根据更新覆盖存储在XML列中的XML对象。 包括与更新的行相对应的节点的预更新节点表从与主表对应的XML索引表创建。 通过删除更新的XML对象来创建更新后节点表。 后更新表和更新前的表根据其节点标识符进行合并。 可以检查产生的合并表以确定哪些节点已被添加，删除或更新。 基于此检查，可以有效地对XML索引表进行必要的添加和删除。

    Method for efficient maintenance of XML indexes
    2.
    发明授权
    Method for efficient maintenance of XML indexes 失效
    有效维护XML索引的方法

    公开(公告)号：US07636739B2

    公开(公告)日：2009-12-22

    申请号：US11171769

    申请日：2005-06-30

    申请人： Stefano Stefani ,  Denis V. Churin ,  Istvan Cseri

    发明人： Stefano Stefani ,  Denis V. Churin ,  Istvan Cseri

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30911 ,  G06F17/30336 ,  Y10S707/99933 ,  Y10S707/99952

    摘要： An update to a primary table is received. The primary table is read to determine the set of rows to be updated. The primary table is updated and XML objects stored in XML columns are overwritten according to the update. A pre-update node table comprising the nodes corresponding to the updated rows is created from an XML index table corresponding to the primary table. A post-update node table is created by shredding the updated XML objects. The post-update table and the pre-update table are merged according to their node identifiers. The resulting merged table can be inspected to determine which nodes have been, added, deleted, or updated. Based on this inspection, the necessary additions and deletions can be efficiently made to the XML index table.

    摘要翻译： 接收到主表的更新。 读取主表以确定要更新的行集。 更新主表，并根据更新覆盖存储在XML列中的XML对象。 包括与更新的行相对应的节点的预更新节点表从与主表对应的XML索引表创建。 通过更新更新的XML对象来创建更新后节点表。 后更新表和更新前的表根据其节点标识符进行合并。 可以检查产生的合并表以确定哪些节点已被添加，删除或更新。 基于此检查，可以有效地对XML索引表进行必要的添加和删除。

    Locality based quorums
    6.
    发明授权
    Locality based quorums 有权
    基于地点的法定人数

    公开(公告)号：US08473775B1

    公开(公告)日：2013-06-25

    申请号：US12967187

    申请日：2010-12-14

    申请人： Michael T. Helmick ,  Jakub Kulesza ,  Timothy A. Rath ,  Stefano Stefani ,  David A. Lutz

    发明人： Michael T. Helmick ,  Jakub Kulesza ,  Timothy A. Rath ,  Stefano Stefani ,  David A. Lutz

    IPC分类号： G06F11/00

    CPC分类号： G06F11/2025 ,  G06F11/00 ,  G06F11/2028 ,  G06F11/2041 ,  G06F11/2046 ,  G06F11/2097

    摘要： Disclosed are various embodiments for distributing data items within a plurality of nodes. A data item update request is replicated from a master node in a plurality of nodes to a plurality of slave nodes within the plurality of nodes. The replicated data item update request is determined to be locality-based durable. Responsive to the determination that the replicated data item update request is locality-based durable, the data item update request is confirmed to a client, wherein the client had originated the data item update request. Upon failover of the master node to another node within the plurality of nodes, a fault-tolerant failover quorum ensures that all previously confirmed updates are found and recognized by the new master node.

    摘要翻译： 公开了用于在多个节点内分发数据项的各种实施例。 将数据项更新请求从多个节点中的主节点复制到多个节点内的多个从节点。 复制的数据项更新请求被确定为基于局部性的持久性。 响应于确定复制数据项更新请求是基于局部性的持久性，数据项更新请求被确认给客户端，其中客户端已经发起数据项更新请求。 在主节点故障转移到多个节点中的另一节点之前，容错故障转移仲裁确保所有先前确认的更新都被新的主节点找到并被识别。

    Efficient query processing of merge statement
    8.
    发明授权
    Efficient query processing of merge statement 有权
    合并语句的高效查询处理

    公开(公告)号：US07676525B2

    公开(公告)日：2010-03-09

    申请号：US11772495

    申请日：2007-07-02

    申请人： Stefano Stefani ,  Naveen Prakash ,  Craig S. Freedman ,  Marcel van der Holst

    发明人： Stefano Stefani ,  Naveen Prakash ,  Craig S. Freedman ,  Marcel van der Holst

    IPC分类号： G06F7/00

    CPC分类号： G06F17/30365 ,  G06F17/30471

    摘要： Disclosed are systems and methods for optimization and efficient processing of MERGE statements. MERGE allows performing a mix of inserts, updates, and deletes in a single statement, and introduces new challenges compared to legacy DML statements, where the kind of action to be performed is hard-coded and known at compile time. Such optimizations may include Halloween Protection detection for MERGE statements, optimized prevention of non-deterministic MERGE statements, in-place inserts for MERGE statements scanning the “Read Instance” of the target table, and optimized execution of MERGE statements seeking the “Read Instance” of the target table. Such optimizations may be fundamental in order to ensure proper performance and reliable processing times.

    摘要翻译： 公开了用于优化和有效处理MERGE语句的系统和方法。 MERGE允许在单个语句中执行插入，更新和删除的混合，并且与传统DML语句相比引入新的挑战，其中要执行的操作类型在编译时被硬编码和已知。 这种优化可能包括MERGE语句的万圣节保护检测，非确定性MERGE语句的优化预防，扫描目标表的“读取实例”的MERGE语句的就地插入以及寻求“读取实例”的MERGE语句的优化执行 的目标表。 为了确保正确的性能和可靠的处理时间，这种优化可能是至关重要的。

    SYSTEMS AND METHODS FOR FINE GRAINED ACCESS CONTROL OF DATA STORED IN RELATIONAL DATABASES
    9.
    发明申请
    SYSTEMS AND METHODS FOR FINE GRAINED ACCESS CONTROL OF DATA STORED IN RELATIONAL DATABASES 有权
    用于关联数据库中存储的数据的细粒度访问控制的系统和方法

    公开(公告)号：US20070174285A1

    公开(公告)日：2007-07-26

    申请号：US11696024

    申请日：2007-04-03

    申请人： Tanmoy Dutta ,  Conor Cunningham ,  Stefano Stefani ,  Girish Chander ,  Eric Hanson

    发明人： Tanmoy Dutta ,  Conor Cunningham ,  Stefano Stefani ,  Girish Chander ,  Eric Hanson

    IPC分类号： G06F17/30

    CPC分类号： G06F21/6227 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99939

    摘要： A system and method for facilitating secure access to database(s) is provided. The system relates to authorizing discriminatory access to relational database data. More particularly, the invention provides for an innovative technique of defining secured access to rows in relational database tables in a way that cannot be spoofed while preserving various optimization techniques. The invention affords a persistent scheme via providing for a security architecture whereby discriminatory access policies on persistent entities can be defined and enforced while preserving set based associative query capabilities. A particular aspect of the invention relates to the specification of such policies and the technique by which those policies are enforced. With respect to one particular implementation of the invention, creation, modification and deletion of access control lists called security descriptors is provided. The security descriptors can be provisioned independent of rows in tables of the database and can be shared and embody the policy on what permissions are granted to whom when associated with a row.

    摘要翻译： 提供了一种用于促进对数据库的安全访问的系统和方法。 该系统涉及授权对关系数据库数据的歧视性访问。 更具体地，本发明提供了一种创新技术，其以不能欺骗的方式定义对关系数据库表中的行的安全访问，同时保持各种优化技术。 本发明通过提供一种安全架构来提供持续方案，从而可以在保持基于集合的关联查询能力的同时定义和实施对持久性实体的区别性访问策略。 本发明的一个特定方面涉及这些策略的说明以及执行这些策略的技术。 关于本发明的一个具体实现，提供了称为安全描述符的访问控制列表的创建，修改和删除。 安全描述符可以独立于数据库表中的行进行配置，并且可以共享，并且包含与哪些权限相关联的权限被授予谁的策略。

    Reduced locking in a distributed data store
    10.
    发明授权
    Reduced locking in a distributed data store 有权
    减少分布式数据存储中的锁定

    公开(公告)号：US09020891B1

    公开(公告)日：2015-04-28

    申请号：US12913556

    申请日：2010-10-27

    申请人： Stefano Stefani ,  Jakub Kulesza

    发明人： Stefano Stefani ,  Jakub Kulesza

    IPC分类号： G06F7/00 ,  G06F9/445

    CPC分类号： G06F17/30362 ,  G06F8/65 ,  G06F17/30368 ,  G06F17/3048 ,  G06F17/30581 ,  G06F17/30864

    摘要： Disclosed are various embodiments for reducing locking in a distributed data store that includes a primary data store and one or more secondary data stores. An update to a data item that is to be applied to the distributed data store is obtained in one or more computing devices. The update is applied to a cached version of the data item when a lock is held. The update is replicated to the one or more data stores after the lock is released. It is determined that the update is durably persisted in the distributed data store after obtaining a replication confirmation from each of at least a predetermined number of the secondary data stores.

    摘要翻译： 公开了用于减少包括主数据存储和一个或多个次要数据存储在内的分布式数据存储中的锁定的各种实施例。 在一个或多个计算设备中获得对应用于分布式数据存储的数据项的更新。 当锁定时，更新应用于数据项的缓存版本。 在释放锁定后，将更新复制到一个或多个数据存储。 确定在从至少预定数量的辅助数据存储器中的每一个获得复制确认之后，更新持久地保持在分布式数据存储器中。