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

1. 发明授权

US09262457B2 On-demand hash index 有权
标题翻译：按需散列索引
公开(公告)号：US09262457B2
公开(公告)日：2016-02-16
申请号：US13965552
申请日：2013-08-13
申请人： Muhammed Sharique , Anil Kumar Goel , Mihnea Andrei , Rolando Blanco , Harshada Chavan
发明人： Muhammed Sharique , Anil Kumar Goel , Mihnea Andrei , Rolando Blanco , Harshada Chavan
IPC分类号： G06F17/30
CPC分类号： G06F17/3033
摘要： Disclosed herein are system, method, and computer program product embodiments for populating a hash index and returning a handle to the hash index. An embodiment operates by determining, by at least one processor, during query optimization that a first database query has a query execution plan comprising a sub-query which executes N times a correlated predicate having an operator being one of equal and not equal to a base column. A cost of creating and probing the hash index N times and a cost of fully scanning the base column N times are compared based on the correlated predicate. Based on the comparing, it is determined whether to create on-demand a hash index.
摘要翻译：这里公开了用于填充散列索引并将句柄返回到散列索引的系统，方法和计算机程序产品实施例。实施例通过至少一个处理器在查询优化期间确定第一数据库查询具有查询执行计划，该查询执行计划包括执行N次相关谓词的子查询，其中操作符是相等且不等于基数的相关谓词柱。基于相关谓词比较创建和探测散列索引N次的成本以及完全扫描基列N次的成本。基于比较，确定是否按需创建散列索引。

2. 发明申请

US20150052150A1 On-Demand Hash Index 有权
标题翻译：按需散列索引
公开(公告)号：US20150052150A1
公开(公告)日：2015-02-19
申请号：US13965552
申请日：2013-08-13
申请人： Muhammed SHARIQUE , Anil Kumar Goel , Mihnea Andrei , Rolando Blanco , Harshada Chavan
发明人： Muhammed SHARIQUE , Anil Kumar Goel , Mihnea Andrei , Rolando Blanco , Harshada Chavan
IPC分类号： G06F17/30
CPC分类号： G06F17/3033
摘要： Disclosed herein are system, method, and computer program product embodiments for populating a hash index and returning a handle to the hash index. An embodiment operates by determining, by at least one processor, during query optimization that a first database query has a query execution plan comprising a sub-query which executes N times a correlated predicate having an operator being one of equal and not equal to a base column. A cost of creating and probing the hash index N times and a cost of fully scanning the base column N times are compared based on the correlated predicate. Based on the comparing, it is determined whether to create on-demand a hash index.
摘要翻译：这里公开了用于填充散列索引并将句柄返回到散列索引的系统，方法和计算机程序产品实施例。实施例通过至少一个处理器在查询优化期间确定第一数据库查询具有查询执行计划，该查询执行计划包括执行N次相关谓词的子查询，其中操作符是相等且不等于基数的相关谓词柱。基于相关谓词比较创建和探测散列索引N次的成本以及完全扫描基列N次的成本。基于比较，确定是否按需创建散列索引。

3. 发明授权

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.

4. 发明申请

US20150186448A1 SET-ORIENTED LOCKING BASED ON IN-MEMORY BITMAPS FOR A COLUMN-ORIENTED DATABASE 有权
标题翻译：基于面向对象数据库的内存比特的面向对象的锁定
公开(公告)号：US20150186448A1
公开(公告)日：2015-07-02
申请号：US14143874
申请日：2013-12-30
申请人： Mark DELAFRANIER , David Wein , Rolando Blanco , Anil Kumar Goel , Mihnea Andrei
发明人： Mark DELAFRANIER , David Wein , Rolando Blanco , Anil Kumar Goel , Mihnea Andrei
IPC分类号： G06F17/30
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 set-oriented locking based on in-memory bitmap for a column store database is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the delta store has a plurality of row-visibility lock bitmaps visible to transactions at various points in time. The lock bitmaps represent a bit encoding to indicate whether there are granted row locks tables in the database. A delete or an update statement is executed with a transaction on a table. A set of row locks on rows of the table manipulated by the delete or the update statement are requested to preclude other transactions from currently deleting or updating the same rows. Accordingly, set operations are performed on the lock bitmap to manage the set of row locks associated with the transaction.
摘要翻译：描述了基于列存储数据库的内存中位图的面向集合的锁定。示例性方法包括建立包括主存储和增量存储的基于列的存储器内数据库，其中增量存储具有在不同时间点对事务可见的多个行可见性锁定位图。锁定位图表示一个位编码，指示是否在数据库中授予了行锁表。用表上的事务执行删除或更新语句。请求由delete或update语句操纵的表的行上的一组行锁排除其他事务当前正在删除或更新相同的行。因此，在锁定位图上执行设置操作以管理与事务相关联的行锁集合。

5. 发明申请

US20150178329A1 MULTIPLE RID SPACES IN A DELTA-STORE-BASED DATABASE TO SUPPORT LONG RUNNING TRANSACTIONS 有权
标题翻译：一个基于三维存储的数据库中的多个RID空间来支持长时间的交易
公开(公告)号：US20150178329A1
公开(公告)日：2015-06-25
申请号：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分类号： G06F17/30
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.
摘要翻译：描述了向非行级版本化底层商店提供行级版本化语义的增量存储。示例性方法包括建立包括主存储和增量存储的基于列的存储器内数据库，其中主存储仅允许同一表上的非并发事务，并且增量存储具有多个行可见性位图，其实现行级版本控制机制允许同一个表上的并发事务。为表片段建立本地RID空间，对于数据库中的每个表，表的数据存储在主存储中的一个或多个主表片段中，以及delta存储中的一个或多个增量表片段中。每个表片段具有本地RID空间，并且本地RID空间是描述表片段的行的局部位置的基于一个的连续整数本地RID（行ID）的集合。

6. 发明授权

US09275097B2 Set-oriented locking based on in-memory bitmaps for a column-oriented database 有权
标题翻译：基于面向列的数据库的基于内存位图的面向集成锁定
公开(公告)号：US09275097B2
公开(公告)日：2016-03-01
申请号：US14143874
申请日：2013-12-30
申请人： Mark DeLaFranier , David Wein , Rolando Blanco , Anil Kumar Goel , Mihnea Andrei
发明人： Mark DeLaFranier , David Wein , Rolando Blanco , Anil Kumar Goel , Mihnea Andrei
IPC分类号： 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 set-oriented locking based on in-memory bitmap for a column store database is described. An example method includes establishing a column-based in-memory database including a main store and a delta store, where the delta store has a plurality of row-visibility lock bitmaps visible to transactions at various points in time. The lock bitmaps represent a bit encoding to indicate whether there are granted row locks tables in the database. A delete or an update statement is executed with a transaction on a table. A set of row locks on rows of the table manipulated by the delete or the update statement are requested to preclude other transactions from currently deleting or updating the same rows. Accordingly, set operations are performed on the lock bitmap to manage the set of row locks associated with the transaction.
摘要翻译：描述了基于列存储数据库的内存中位图的面向集合的锁定。示例性方法包括建立包括主存储和增量存储的基于列的存储器内数据库，其中增量存储具有在不同时间点对事务可见的多个行可见性锁定位图。锁定位图表示一个位编码，指示是否在数据库中授予了行锁表。用表上的事务执行删除或更新语句。请求由delete或update语句操纵的表的行上的一组行锁排除其他事务当前正在删除或更新相同的行。因此，在锁定位图上执行设置操作以管理与事务相关联的行锁集合。

7. 发明授权

US09268807B2 In-memory bitmap for column store operations 有权
标题翻译：列存储操作的内存位图
公开(公告)号：US09268807B2
公开(公告)日：2016-02-23
申请号：US13944196
申请日：2013-07-17
申请人： Rolando Blanco , Anil Kumar Goel , Mihnea Andrei
发明人： Rolando Blanco , Anil Kumar Goel , Mihnea Andrei
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , G06F17/30067 , G06F17/30315 , G06F17/30321 , G06F17/30563 , G06F17/30961
摘要： Disclosed herein are system, method, and computer program product embodiments for implementing a bitmap for a column store database. An embodiment operates by creating, by at least one processor, a bitmap identifying rows in a column store database. The bitmap may include a list of bit chunks, a bit chunk including an offset being a natural number indicating a chunk size, and a bit specification including one of an ordered row id list, a contiguous row id sequence, and a bit vector. In addition, the embodiment includes performing database operations using the bitmap.
摘要翻译：这里公开了用于实现列存储数据库的位图的系统，方法和计算机程序产品实施例。一个实施例通过由至少一个处理器创建识别列存储数据库中的行的位图来进行操作。位图可以包括位块的列表，包括指示块大小的自然数的偏移的位块，以及包括排序行id列表，连续行ID序列和位向量之一的位规格。此外，该实施例包括使用位图执行数据库操作。

8. 发明申请

US20150186433A1 STATIC ROW IDENTIFIER SPACE PARTITIONING FOR CONCURRENT DATA INSERTION IN DELTA MEMORY STORE 有权
标题翻译：在DELTA存储器存储器中进行同步数据插入的静态标识符空间分割
公开(公告)号：US20150186433A1
公开(公告)日：2015-07-02
申请号：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.
摘要翻译：当前的主题描述了与数据库的增量存储器存储器中的表相关联的行标识符空间的静态分区和子分区，以便允许数据被同时插入到由相应子分区标识的行中。与数据库相关联的服务器系统可以接收要插入数据库的数据。服务器系统可以选择行标识符空间的子片段，其标识存储在表的数据库中的行的标识符。可以基于由用于将数据插入到列数据库中的插入操作指定的偏好以及子片段的可用性来选择子片段。服务器系统可以将数据插入由所选择的子片段标识的行中，而其他数据被同时插入到由行标识符空间的其他一个或多个子片段标识的行中。

9. 发明授权

US09489409B2 Rollover strategies in a N-bit dictionary compressed column store 有权
标题翻译： N位字典压缩列存储中的翻转策略
公开(公告)号：US09489409B2
公开(公告)日：2016-11-08
申请号：US14056454
申请日：2013-10-17
申请人： Muhammed Sharique , Anil Kumar Goel , Minhnea Andrei
发明人： Muhammed Sharique , Anil Kumar Goel , Minhnea Andrei
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , G06F17/30091 , G06F17/30312
摘要： Disclosed herein are system, method, and computer program product embodiments for rollover strategies in an n-bit dictionary compressed column store. An embodiment operates by receiving a new value for addition to a compressed column store, determining that a current memory block of a most recently added token to the compressed column store is the insertion block. It is determined that the maximum token value has been reached for the current memory block. A new virtual memory block is created using the current insertion block, and a token corresponding to the new value is stored in the new virtual memory block. In another embodiment, when it is determined a maximum number of token values that may be stored in a compressed column store has been reached for a data dictionary, the compressed column store is converted into a composite store include a flat store where the new value is stored.
摘要翻译：这里公开了用于n位字典压缩列存储中的翻转策略的系统，方法和计算机程序产品实施例。实施例通过接收用于添加到压缩列存储的新值来操作，确定到压缩列存储的最近添加的令牌的当前存储块是插入块。确定当前内存块已达到最大令牌值。使用当前插入块创建新的虚拟内存块，并且与新值对应的令牌存储在新的虚拟内存块中。在另一个实施例中，当确定可以存储在数据字典中的压缩列存储中的令牌值的最大数目时，压缩列存储被转换为复合存储器，其中包括新值为存储。

10. 发明授权

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

热门服务

关于我们

友情链接

联系方式