专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050091256A1 SQL language extensions for modifying collection-valued and scalar valued columns in a single statement 有权
标题翻译：用于在单个语句中修改集合值和标量值的SQL语言扩展
公开(公告)号：US20050091256A1
公开(公告)日：2005-04-28
申请号：US10693302
申请日：2003-10-24
申请人： Balaji Rathakrishnan , Stefano Stefani , Aleksandras Surna , Jose Blakeley , Oliver Seeliger
发明人： Balaji Rathakrishnan , Stefano Stefani , Aleksandras Surna , Jose Blakeley , Oliver Seeliger
IPC分类号： G06F20060101 , G06F1/00 , G06F17/00
CPC分类号： G06F17/30365 , G06F17/30342 , G06F17/30607 , Y10S707/99931 , Y10S707/99932 , Y10S707/99934 , Y10S707/99944
摘要： A technique for updating collection-valued and other complex structured columns in a nested table using a nested extension of an UPDATE statement that uses syntax and semantics to modify collection-valued columns in a way that is analogous to the syntax and semantics of the UPDATE statement that is used to modify scalar-valued columns of the table (called the outer UPDATE). Using the same syntactic and semantic constructs as the table at the outer level allows an existing implementation that processes modifications to relational tables to reuse its implementation techniques for processing outer updates to modify collection-valued columns as well. The UPDATE extensions enable the specification of updates to nested collections embedded at arbitrary levels of depth in the object model. The new syntax is embedded inside the outer UPDATE statement in a way that parallels the structure of the data itself and thus maps more directly to the user's conceptual model of the data. The method for implementing the UPDATE extensions uses a change descriptor, which is a data structure that aggregates substantially all changes, both scalar and collection-valued into a single value that can be applied to the changed collection-valued column. This technique can also be used for modifications to other kinds of complex-structured columns such as objects or xml. The change descriptor includes hierarchical information for the cell, thereby enabling efficient application of multiple updates at various granularity levels in a single operation and enabling the implementation of efficient index maintenance algorithms by updating only the indexes affected by the UPDATE operation and updating only those index rows that were affected by the UPDATE operation.
摘要翻译：一种用于使用UPDATE语句的嵌套扩展来更新嵌套表中的集合值和其他复杂结构化列的技术，该语法使用语法和语义来以类似于UPDATE语句的语法和语义的方式修改集合值列用于修改表的标量值列（称为外部UPDATE）。使用与外层相同的句法和语义结构允许处理对关系表的修改的现有实现，以重用其实现技术来处理外部更新以修改集合值列。 UPDATE扩展使得能够对对象模型中嵌套在任意深度深度的嵌套集合进行更新。新的语法以外部UPDATE语句的方式嵌入到数据本身的结构中，从而更直接地映射到用户的数据概念模型。实现UPDATE扩展的方法使用一个更改描述符，该描述符是一个数据结构，它将基本上所有的变量（标量和收集值）聚合成一个可以应用到更改的收集值列的值。此技术也可用于修改其他类型的复杂结构列（如对象或xml）。更改描述符包括小区的分层信息，从而能够在单个操作中在各种粒度级别高效地应用多个更新，并且通过仅更新受UPDATE操作影响的索引并仅更新那些索引行，从而实现高效的索引维护算法受UPDATE操作的影响。

2. 发明申请

US20050177551A1 Systems and methods for the implementation of unordered and ordered collections in a data store 有权
标题翻译：在数据存储中实现无序和有序集合的系统和方法
公开(公告)号：US20050177551A1
公开(公告)日：2005-08-11
申请号：US11027416
申请日：2004-12-30
申请人： Balaji Rathakrishnan , Beysim Sezgin , Denis Altudov , Jose Blakeley , Oliver Seeliger , Ramachandran Venkatesh , Wei Yu , Dragan Tomic , Denis Churin , Bruno Denuit , Conor Cunningham , Stefano Stefani
发明人： Balaji Rathakrishnan , Beysim Sezgin , Denis Altudov , Jose Blakeley , Oliver Seeliger , Ramachandran Venkatesh , Wei Yu , Dragan Tomic , Denis Churin , Bruno Denuit , Conor Cunningham , Stefano Stefani
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , G06F17/30607 , Y10S707/99934
摘要： Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.
摘要翻译：本发明的几个实施例涉及用于扩展扩展关系数据存储（ERDS）的UDT框架以包括对无序集合（多集）和有序集合（列表）的支持的系统和方法。更具体地，本发明的几个实施例使用UDT基础设施，CLR泛型和新的UNNEST运算符来创建并利用同时是标量和关系的集合的特殊类型抽象。作为一个标量，这种集合类型可以由数据存储引擎的所有部分进行处理，这些数据存储引擎能够理解标量（包括但不限于客户端堆栈），作为一种关系，该集合类型可以像任何其他类型的关系一样被查询。

3. 发明授权

US07433886B2 SQL language extensions for modifying collection-valued and scalar valued columns in a single statement 有权
标题翻译：用于在单个语句中修改集合值和标量值的SQL语言扩展
公开(公告)号：US07433886B2
公开(公告)日：2008-10-07
申请号：US10693302
申请日：2003-10-24
申请人： Balaji Rathakrishnan , Stefano Stefani , Aleksandras Surna , Jose A. Blakeley , Oliver Nicholas Seeliger
发明人： Balaji Rathakrishnan , Stefano Stefani , Aleksandras Surna , Jose A. Blakeley , Oliver Nicholas Seeliger
IPC分类号： G06F17/30
CPC分类号： G06F17/30365 , G06F17/30342 , G06F17/30607 , Y10S707/99931 , Y10S707/99932 , Y10S707/99934 , Y10S707/99944
摘要： A system and method for updating collection-valued and other complex structured columns in a nested table using a nested extension of an UPDATE statement that is analogous to the syntax and semantics of the UPDATE statement that is used to modify scalar-valued columns of the table (called the outer UPDATE). Using the same syntactic and semantic constructs as the table at the outer level allows an existing implementation that processes modifications to relational tables to reuse its implementation techniques for processing outer updates to modify collection-valued columns as well. The UPDATE extensions enable the specification of updates to nested collections embedded at arbitrary levels of depth in the object model. The new syntax is embedded inside the outer UPDATE statement in a way that parallels the structure of the data itself and thus maps more directly to the user's conceptual model of the data.
摘要翻译：用于使用类似于用于修改表的标量值列的UPDATE语句的语法和语义的UPDATE语句的嵌套扩展来更新嵌套表中的集合值和其他复杂结构化列的系统和方法（称为外部UPDATE）。使用与外层相同的句法和语义结构允许处理对关系表的修改的现有实现，以重用其实现技术来处理外部更新以修改集合值列。 UPDATE扩展使得能够对对象模型中嵌套在任意深度深度的嵌套集合进行更新。新的语法以外部UPDATE语句的方式嵌入到数据本身的结构中，从而更直接地映射到用户的数据概念模型。

4. 发明申请

US20050187893A1 Systems and methods for a large object infrastructure in a database system 有权
标题翻译：数据库系统中大对象基础架构的系统和方法
公开(公告)号：US20050187893A1
公开(公告)日：2005-08-25
申请号：US10776664
申请日：2004-02-10
申请人： Shrinivas Ashwin , Jose Blakeley , Peter Carlin , Jun Fang , Ajay Kalhan , Christian Kleinerman , Stefano Stefani , Aleksandras Surna , Honggang Zhang
发明人： Shrinivas Ashwin , Jose Blakeley , Peter Carlin , Jun Fang , Ajay Kalhan , Christian Kleinerman , Stefano Stefani , Aleksandras Surna , Honggang Zhang
IPC分类号： G06F7/00
CPC分类号： G06F17/30504 , Y10S707/99931 , Y10S707/99936 , Y10S707/99943
摘要： Various embodiments of the present invention are direct to the utilization of Blob Handles (BHs) which are an internal representation of a large value. BHs are immutable and stateless references to a large data object. The structure of a BH contains enough information to return an ILockBytes interface in order to provide access to the corresponding large data block, and a BH can also return information regarding its own lifetime description. A BH can be completely described using (a) a pointer to the beginning of BH data and (b) the byte-length of the BH.
摘要翻译：本发明的各种实施例直接利用作为大值的内部表示的Blob句柄（BH）。 BH是不可变的和无状态的引用大型数据对象。 BH的结构包含足够的信息来返回ILockBytes接口，以便提供对相应的大数据块的访问，并且BH还可以返回关于其自身寿命描述的信息。可以使用（a）指向BH数据的开始的指针和（b）BH的字节长度来完全描述BH。

5. 发明授权

US07437346B2 Systems and methods for a large object infrastructure in a database system 有权
标题翻译：数据库系统中大对象基础架构的系统和方法
公开(公告)号：US07437346B2
公开(公告)日：2008-10-14
申请号：US10776664
申请日：2004-02-10
申请人： Shrinivas Ashwin , Jose A. Blakeley , Peter Carlin , Jun Fang , Ajay Kalhan , Christian Kleinerman , Stefano Stefani , Aleksandras Surna , Honggang Zhang
发明人： Shrinivas Ashwin , Jose A. Blakeley , Peter Carlin , Jun Fang , Ajay Kalhan , Christian Kleinerman , Stefano Stefani , Aleksandras Surna , Honggang Zhang
IPC分类号： G06F7/00
CPC分类号： G06F17/30504 , Y10S707/99931 , Y10S707/99936 , Y10S707/99943
摘要： Various embodiments of the present invention are direct to the utilization of Blob Handles (BHs) which are an internal representation of a large value. BHs are immutable and stateless references to a large data object. The structure of a BH contains enough information to return an ILockBytes interface in order to provide access to the corresponding large data block, and a BH can also return information regarding its own lifetime description. A BH can be completely described using (a) a pointer to the beginning of BH data and (b) the byte-length of the BH.
摘要翻译：本发明的各种实施例直接利用作为大值的内部表示的Blob句柄（BH）。 BH是不可变的和无状态的引用大型数据对象。 BH的结构包含足够的信息来返回ILockBytes接口，以便提供对相应的大数据块的访问，并且BH还可以返回关于其自身寿命描述的信息。可以使用（a）指向BH数据的开始的指针和（b）BH的字节长度来完全描述BH。

6. 发明授权

US07437371B2 Systems and methods for the implementation of unordered and ordered collections in a data store 有权
标题翻译：在数据存储中实现无序和有序集合的系统和方法
公开(公告)号：US07437371B2
公开(公告)日：2008-10-14
申请号：US11027416
申请日：2004-12-30
申请人： Balaji Rathakrishnan , Beysim Sezgin , Denis Y. Altudov , Jose A. Blakeley , Oliver Nicholas Seeliger , Ramachandran Venkatesh , Wei Yu , Dragan Tomic , Denis Churin , Bruno H. M. Denuit , Conor J. Cunningham , Stefano Stefani
发明人： Balaji Rathakrishnan , Beysim Sezgin , Denis Y. Altudov , Jose A. Blakeley , Oliver Nicholas Seeliger , Ramachandran Venkatesh , Wei Yu , Dragan Tomic , Denis Churin , Bruno H. M. Denuit , Conor J. Cunningham , Stefano Stefani
IPC分类号： G06F17/00
CPC分类号： G06F17/30595 , G06F17/30607 , Y10S707/99934
摘要： Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.
摘要翻译：本发明的几个实施例涉及用于扩展扩展关系数据存储（ERDS）的UDT框架以包括对无序集合（多集）和有序集合（列表）的支持的系统和方法。更具体地，本发明的几个实施例使用UDT基础设施，CLR泛型和新的UNNEST运算符来创建并利用同时是标量和关系的集合的特殊类型抽象。作为一个标量，这种集合类型可以由数据存储引擎的所有部分进行处理，这些数据存储引擎能够理解标量（包括但不限于客户端堆栈），作为一种关系，该集合类型可以像任何其他类型的关系一样被查询。

7. 发明授权

US08572091B1 System and method for partitioning and indexing table data using a composite primary key 有权
标题翻译：使用复合主键分区和索引表数据的系统和方法
公开(公告)号：US08572091B1
公开(公告)日：2013-10-29
申请号：US13169990
申请日：2011-06-27
申请人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Grant A. M. McAlister , Jakub Kulesza , Wei Xiao , Raymond S. Bradford
发明人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Grant A. M. McAlister , Jakub Kulesza , Wei Xiao , Raymond S. Bradford
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/3033 , G06F17/30584 , G06F17/30628 , G06F17/30949 , Y10S707/968 , Y10S707/972
摘要： A system that implements a scaleable data storage service may maintain tables in a non-relational data store on behalf of service clients. Each table may include multiple items. Each item may include one or more attributes, each containing a name-value pair. The system may provide an API through which clients can query tables maintained by the service. Items may be partitioned and indexed in a table according to a simple or composite primary key contained in all items in the table. A composite primary key may include a hash key attribute, and a range key attribute. The range key attribute may be usable to order items having the same hash key attribute value, and to partition them dependent on a range of range key attribute values. A query request may specify a logical or mathematical expression dependent on range key attribute values and may be directed to multiple partitions.
摘要翻译：实现可扩展数据存储服务的系统可以代表服务客户端在非关系数据存储中维护表。每个表可以包括多个项目。每个项目可以包括一个或多个属性，每个属性包含名称 - 值对。该系统可以提供一种API，通过该API，客户端可以查询由服务维护的表。项目可以根据表中所有项目中包含的简单或复合主键在表中进行分区和索引。复合主键可以包括散列键属性和范围键属性。范围键属性可以用于对具有相同散列键属性值的项进行排序，并且根据范围键属性值的范围对它们进行分区。查询请求可以指定取决于范围键属性值的逻辑或数学表达式，并且可以被引导到多个分区。

8. 发明授权

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

9. 发明申请

US20120330954A1 System And Method For Implementing A Scalable Data Storage Service 有权
标题翻译：用于实现可扩展数据存储服务的系统和方法
公开(公告)号：US20120330954A1
公开(公告)日：2012-12-27
申请号：US13170031
申请日：2011-06-27
申请人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Raymond S. Bradford , Grant A.M. McAlister , Jakub Kulesza , James Hamilton , Luis Felipe Cabrera
发明人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Raymond S. Bradford , Grant A.M. McAlister , Jakub Kulesza , James Hamilton , Luis Felipe Cabrera
IPC分类号： G06F17/30
CPC分类号： G06F17/30584 , G06F9/5061 , G06F12/0848 , G06F17/30286 , G06F17/30289 , G06F17/30303 , G06F17/30306 , G06F17/30321 , G06F17/30339 , G06F17/3056 , H04L67/02 , H04L67/1097 , H04L67/2804 , Y10S707/968 , Y10S707/972
摘要： A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies.
摘要翻译：实现可扩展数据存储服务的系统可以代表客户端在非关系数据存储中维护表。系统可以提供接收服务请求的Web服务接口，以及可用于请求创建，删除或描述表的API; 存储，检索，删除或修改其属性的项目; 或者查询（或扫描）已过滤的项目和/或返回的属性。可以调用异步工作流来创建或删除表。存储在表中的项目可以使用简单或复合主键进行分区和索引。系统可能不会对表大小强加预定义的限制，并且可以采用灵活的模式。该服务可以提供尽力而为或者承诺的吞吐量模型。响应于检测到工作负载变化，节点故障或其他条件或异常，系统可以自动缩放和/或重新分区表。

10. 发明授权

US07676525B2 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语句的优化执行的目标表。为了确保正确的性能和可靠的处理时间，这种优化可能是至关重要的。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式