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

91. 发明授权

US09959312B2 High performance index creation on sorted data using parallel query plans 有权
公开(公告)号：US09959312B2
公开(公告)日：2018-05-01
申请号：US14019392
申请日：2013-09-05
申请人： Peter Schneider
发明人： Peter Schneider
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30336 , G06F17/30463
摘要： Creation of an index for a table of sorted data for use by a data storage application is initiated. Thereafter, N+1 logical partition of rows of the table are defined so that each logical partition has a corresponding worker process. Each worker process then builds a sub-index based on the corresponding logical partition which are later merged to form the index. Related apparatus, systems, techniques and articles are also described.

92. 发明授权

US09916341B2 Partition level operation with concurrent activities 有权
公开(公告)号：US09916341B2
公开(公告)日：2018-03-13
申请号：US15153102
申请日：2016-05-12
申请人： SYBASE, INC.
发明人： Amit Pathak , Paresh Rathod , Swati Sharma , Nikhil Jamadagni
IPC分类号： G06F17/30
CPC分类号： G06F17/30362 , G06F17/30171 , G06F17/30339 , G06F17/30371 , G06F17/30377 , G06F17/30584
摘要： Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition.

93. 发明授权

US09881041B2 Multiple RID spaces in a delta-store-based database to support long running transactions 有权
公开(公告)号：US09881041B2
公开(公告)日：2018-01-30
申请号：US14136724
申请日：2013-12-20
申请人： Mihnea Andrei , Anil Kumar Goel , Colin Florendo , Rolando Blanco , David Edward DeHaan
发明人： Mihnea Andrei , Anil Kumar Goel , Colin Florendo , Rolando Blanco , David Edward DeHaan
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30 , G06F11/14
CPC分类号： G06F17/30362 , G06F11/1448 , G06F17/30309 , G06F17/30312 , G06F17/30315 , G06F17/30339 , G06F17/30368 , G06F17/30371 , G06F2201/80 , G06F2201/825 , G06F2201/84 , G06F2201/87
摘要： A delta store giving row-level versioning semantics to a non-row-level versioning underlying store is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the main store allows only non-concurrent transactions on a same table and the delta store has a plurality of row-visibility bitmaps implementing a row-level versioning mechanism that allows concurrent transactions on the same table. A local RID space is established for a table fragment, that for each table in the database, the data of the table is stored in one or more main table fragment in the main store and in one or more delta table fragments in the delta store. Each table fragment has a local RID space, and the local RID space is a collection of one-based contiguous integer local RIDs (Row IDs) describing local positions of the rows of the table fragment.

94. 发明授权

US09684684B2 Index updates using parallel and hybrid execution 有权
公开(公告)号：US09684684B2
公开(公告)日：2017-06-20
申请号：US14326157
申请日：2014-07-08
申请人： Srinivasan Mottupalli , Xiaobin Ma , Peter Schneider
发明人： Srinivasan Mottupalli , Xiaobin Ma , Peter Schneider
IPC分类号： G06F17/30
CPC分类号： G06F17/30321 , G06F17/3038
摘要： A method can include receiving a request to execute a database command identifying a target table; identifying a plurality of rows to insert into the target table based in part on the database command; writing rows, from the plurality of rows, into a data page until the data page is full; determining, by an index thread manager, a number of threads to use for updating indexes defined for the target table; and upon determining the data page is full, updating, in parallel, the indexes defined for the target table using the number of threads.

95. 发明授权

US09600517B2 Convert command into a BULK load operation 有权
公开(公告)号：US09600517B2
公开(公告)日：2017-03-21
申请号：US14290013
申请日：2014-05-29
申请人： Xiaobin Ma , Srinivasan Mottupalli , Peter Schneider
发明人： Xiaobin Ma , Srinivasan Mottupalli , Peter Schneider
IPC分类号： G06F17/30
CPC分类号： G06F17/3038
摘要： A method for inserting rows into a target table can include receiving a database command, the database command associated with a base table with at least one row to copy to a target table; receiving an indication that use of a BULK insert mode is feasible for the database command; based on the indication, and determining that an insert mode for the database command has been converted from a non-bulk insert mode to the BULK insert mode: reading a row from the base table; building the row read from the base table into an allocated row buffer; inserting the row into the target table in the BULK insert mode; and if it is determined that the allocated row buffer is full, updating at least one index in parallel with the inserting.

96. 发明授权

US09594786B2 Append-only b-tree cursor 有权
标题翻译：仅附加b树游标
公开(公告)号：US09594786B2
公开(公告)日：2017-03-14
申请号：US14155315
申请日：2014-01-14
申请人： Nandan Marathe , Blaine French
发明人： Nandan Marathe , Blaine French
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , G06F17/30961
摘要： Existing algorithms to build balanced tree structures (“b-trees”) compare a data element (e.g., a key) to be inserted with the data elements that have already been inserted to find the correct position to insert the data element. Additionally, the algorithms balance and/or rebalance the b-tree when any individual node gets over-filled. As part of this balancing, data elements stored in the various nodes are moved to other nodes. These operations can incur both time and resource costs. We propose an algorithm to build a b-tree in a bottom up manner and a technique to modify trees built using the aforementioned algorithm so that they are balanced. We also propose a method to allow for adding more data into the thus-built b-tree as long as it follows a certain set of pre-conditions.
摘要翻译：用于构建平衡树结构（“b-tree”）的现有算法将要插入的数据元素（例如，密钥）与已经被插入的数据元素进行比较，以找到插入数据元素的正确位置。此外，当任何单个节点过度填充时，算法平衡和/或重新平衡b-tree。作为这种平衡的一部分，存储在各种节点中的数据元素被移动到其他节点。这些操作可能会导致时间和资源成本。我们提出一种以自下而上的方式构建b树的算法，以及一种用于修改使用上述算法构建的树以使它们平衡的技术。我们还提出了一种允许在如此构建的b树中添加更多数据的方法，只要它遵循一定的前提条件即可。

97. 发明授权

US09594781B2 Estimation of query input/output (I/O) cost in database 有权
标题翻译：数据库中查询输入/输出（I / O）成本的估计
公开(公告)号：US09594781B2
公开(公告)日：2017-03-14
申请号：US14301160
申请日：2014-06-10
申请人： Pedram Ghodsnia , Ivan Bowman
发明人： Pedram Ghodsnia , Ivan Bowman
IPC分类号： G06F17/30
CPC分类号： G06F17/30306
摘要： Disclosed herein are system, method, and computer program product embodiments for calibrating and using a stable storage model. An embodiment operates by generating, by a central computer, an access request for a stable storage, wherein the access request comprises a plurality of page accesses; measuring a cost to execute the access request on the stable storage; amortizing the cost over the plurality of page accesses; and calibrating, by the central computer, a stable storage model based on the amortized cost.
摘要翻译：这里公开了用于校准和使用稳定存储模型的系统，方法和计算机程序产品实施例。实施例通过由中央计算机生成用于稳定存储的访问请求来进行操作，其中所述访问请求包括多个页面访问; 测量在稳定存储上执行访问请求的成本; 在多页访问中摊销成本; 并通过中央计算机校准基于摊销成本的稳定存储模型。

98. 发明授权

US09558225B2 Event stream processor 有权
标题翻译：事件流处理器
公开(公告)号：US09558225B2
公开(公告)日：2017-01-31
申请号：US14228871
申请日：2014-03-28
申请人： Joe Skrzypczak , Andrzej Kucharczyk , Andrew Frantz , Gerald Wang , Mark Theiding
发明人： Joe Skrzypczak , Andrzej Kucharczyk , Andrew Frantz , Gerald Wang , Mark Theiding
IPC分类号： G06F17/30
CPC分类号： G06F17/30339 , G06F17/30345
摘要： In an example embodiment, a method for performing event stream processing is provided. An event stream is received, the event stream comprising a real time indication of one or more events occurring. Then it is determined that the event stream is identified in a streaming publish service inside a database. The event stream may then be inserted directly into one or more database tables in the database based on the determining.
摘要翻译：在一个示例实施例中，提供了一种用于执行事件流处理的方法。接收事件流，事件流包括发生的一个或多个事件的实时指示。然后确定在数据库内的流式发布服务中识别事件流。然后可以基于确定将事件流直接插入到数据库中的一个或多个数据库表中。

99. 发明授权

US09489411B2 High performance index creation 有权
标题翻译：高性能指标创建
公开(公告)号：US09489411B2
公开(公告)日：2016-11-08
申请号：US13953341
申请日：2013-07-29
申请人： Peter Schneider , Ming-li Rui , Santosh Pendap , Leon Xiong
发明人： Peter Schneider , Ming-li Rui , Santosh Pendap , Leon Xiong
IPC分类号： G06F17/30
CPC分类号： G06F17/30336 , G06F17/30321 , G06F17/30864
摘要： High performance index creation using parallel query plans with repartitioning scan and vector-based repartitioning scan is described. An example method includes extracting index key columns from data rows of the database table to build a set of index rows, wherein the index on the database table is defined by a plurality of index key columns including a first index key column and a second index key column. Partition boundary values are generated to divide up the index rows into range-partitioned sets, and the index rows are sorted based on values of the index key columns. A repartitioning scan, including a SARG-based or a vector-based partitioning scan is performed on the index rows, using a plurality of worker threads executing in parallel to build sub-indexes. Subsequently, each range-partitioned set of index rows are assigned to a worker thread in the plurality of worker threads. Accordingly, the sub-indexes generated from the plurality of work threads are merged to build the index for the database table.
摘要翻译：描述了使用重新分区扫描和向量重新分区扫描的并行查询计划的高性能索引创建。示例性方法包括从数据库表的数据行中提取索引关键字列以构建一组索引行，其中数据库表上的索引由包括第一索引关键字列和第二索引关键字的多个索引关键字列定义柱。生成分区边界值，以将索引行分成范围分区集，并根据索引键列的值对索引行进行排序。使用并行执行的多个工作线程来构建子索引，对索引行执行重新分区扫描，包括基于SARG或基于向量的分区扫描。随后，将每个范围分隔的索引行集合分配给多个工作线程中的工作线程。因此，从多个工作线程生成的子索引被合并以构建数据库表的索引。

100. 发明授权

US09477699B2 Static row identifier space partitioning for concurrent data insertion in delta memory store 有权
标题翻译：在delta存储器中并行数据插入的静态行标识符空间分区
公开(公告)号：US09477699B2
公开(公告)日：2016-10-25
申请号：US14143610
申请日：2013-12-30
申请人： Muhammed Sharique , Mihnea André , Rolando Maldonado Blanco , Anil Kumar Goel
发明人： Muhammed Sharique , Mihnea André , Rolando Maldonado Blanco , Anil Kumar Goel
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , G06F17/3038 , G06F17/30584
摘要： The current subject matter describes static partitioning and sub-partitioning of a row identifier space associated with a table in a delta memory store of a database so as to allow data to be concurrently inserted into rows identified by the corresponding sub-partitions. A server system associated with the database can receive data to be inserted into a database. The server system can select a sub-fragment of a row identifier space identifying identifiers of rows stored in the database for the table. The sub-fragment can be selected based on a preference specified by an insert operation used for insertion of the data into the columnar database and on availability of the sub-fragment. The server system can insert the data in rows identified by the selected sub-fragment while other data is being concurrently inserted in rows identified by other one or more sub-fragments of the row identifier space.
摘要翻译：当前的主题描述了与数据库的增量存储器存储器中的表相关联的行标识符空间的静态分区和子分区，以便允许数据被同时插入到由相应子分区标识的行中。与数据库相关联的服务器系统可以接收要插入数据库的数据。服务器系统可以选择行标识符空间的子片段，其标识存储在表的数据库中的行的标识符。可以基于由用于将数据插入到列数据库中的插入操作指定的偏好以及子片段的可用性来选择子片段。服务器系统可以将数据插入由所选择的子片段标识的行中，而其他数据被同时插入到由行标识符空间的其他一个或多个子片段标识的行中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式