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

1. 发明申请

US20060218123A1 System and Methodology for Parallel Query Optimization Using Semantic-Based Partitioning 有权
标题翻译：使用基于语义分割的并行查询优化的系统和方法
公开(公告)号：US20060218123A1
公开(公告)日：2006-09-28
申请号：US10908956
申请日：2005-06-02
申请人： Sudipto Chowdhuri , Mihnea Andrei
发明人： Sudipto Chowdhuri , Mihnea Andrei
IPC分类号： G06F17/30
CPC分类号： G06F17/30445
摘要： A system and methodology for parallel query optimization using semantic-based partitioning is described. In one embodiment, for example, in a database system comprising a database storing data in database tables, a method is described for improving query performance by dynamically partitioning the data, the method comprises steps of: receiving a query requesting data from the database; generating a plurality of subplans for executing the query, each subplan including one or more operators for performing relational operations; adding operators for partitioning data and performing a given relational operation in parallel to at least some of the plurality of subplans; and building a plan for execution of the query based, at least in part, upon selecting subplans having favorable execution costs
摘要翻译：描述了使用基于语义的分区的并行查询优化的系统和方法。在一个实施例中，例如，在包括在数据库表中存储数据的数据库的数据库系统中，描述了通过动态划分数据来提高查询性能的方法，所述方法包括以下步骤：从数据库接收请求数据的查询; 生成用于执行查询的多个子程序，每个子程序包括用于执行关系操作的一个或多个操作符; 添加用于划分数据的操作符并且与所述多个子计划中的至少一些并行执行给定的关系操作; 并且至少部分地基于选择具有有利执行成本的子计划来构建用于执行查询的计划

2. 发明授权

US10725987B2 Forced ordering of a dictionary storing row identifier values 有权
公开(公告)号：US10725987B2
公开(公告)日：2020-07-28
申请号：US14553892
申请日：2014-11-25
申请人： David Wein , Ivan Schreter , Mihnea Andrei , Martin Heidel , Frank Benkstein
发明人： David Wein , Ivan Schreter , Mihnea Andrei , Martin Heidel , Frank Benkstein
IPC分类号： G06F16/22 , G06F17/22 , G06F16/84 , G06F16/28 , G06F16/2455
摘要： The subject matter disclosed herein provides methods for the forced ordering of a dictionary based on row identifier values. A plurality of concurrent transactions can be handled in an in-memory database. At least one of the transactions can include at least one write operation to a dictionary. Each write operation can be assigned a row identifier (ID). At least one of the write operations can be written to the dictionary out of sequence. The sequence can be based on the row ID. Each row ID in the dictionary can be mapped to a corresponding value identifier in the dictionary. The dictionary can position the value identifiers so that the corresponding row IDs are in a sorted sequential order based on the row ID. Related apparatus, systems, techniques, and articles are also described.

3. 发明授权

US10089342B2 Main memory database management using page index vectors 有权
公开(公告)号：US10089342B2
公开(公告)日：2018-10-02
申请号：US14328511
申请日：2014-07-10
申请人： Reza Sherkat , Guenter Radestock , Ivan Schreter , Colin Florendo , Mihnea Andrei , Anil Kumar Goel
发明人： Reza Sherkat , Guenter Radestock , Ivan Schreter , Colin Florendo , Mihnea Andrei , Anil Kumar Goel
IPC分类号： G06F17/30
摘要： A compression manager may store, within an index vector, a plurality of value identifiers (IDs), each value ID representing a value within a database. A page generator may designate a number of the value IDs as defining a page within the index vector, so that the index vector includes a plurality of pages, each page including the number of value IDs. The page generator may store the index vector in a secondary memory of a main memory database. An iterator may access a requested value ID, and a page loader may load a corresponding page of the index vector that contains the requested value ID into the main memory database.

4. 发明授权

US10042552B2 N-bit compressed versioned column data array for in-memory columnar stores 有权
公开(公告)号：US10042552B2
公开(公告)日：2018-08-07
申请号：US14553435
申请日：2014-11-25
申请人： Rolando Blanco , Ivan Schreter , Chaitanya Gottipati , Mihnea Andrei , Reza Sherkat
发明人： Rolando Blanco , Ivan Schreter , Chaitanya Gottipati , Mihnea Andrei , Reza Sherkat
IPC分类号： G06F17/30 , G06F3/06
摘要： As part of a columnar in-memory database, value identifiers are inserted into a backing array in-memory until such time that it is determined that such backing array does not have sufficient capacity. A new backing array is then generated that includes the value identifiers in the old backing array and which has sufficient capacity. The old backing array can be flushed from memory when there are no active operations using such backing array. Such an arrangement allows for readers and non-structural writers to operate concurrently.

5. 发明申请

US20160147834A1 Set-Orientated Visibility State Retrieval Scheme 有权
标题翻译：面向可视性状态检索方案
公开(公告)号：US20160147834A1
公开(公告)日：2016-05-26
申请号：US14553226
申请日：2014-11-25
申请人： Juchang Lee , Mihnea Andrei , Colin Florendo , Ivan Schreter , Anil Kumar Goel
发明人： Juchang Lee , Mihnea Andrei , Colin Florendo , Ivan Schreter , Anil Kumar Goel
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30339 , G06F17/30345 , G06F17/30353 , G06F17/30548
摘要： Disclosed herein are system, method, and computer program product embodiments for determining row visibility states. An embodiment operates by initializing a result bitmap for rows based on visible row state values of row state bitmaps corresponding to the rows, wherein values of the result bitmap indicate whether the row are visible or not visible; determining one or more rows whose corresponding visible row state values indicate that the one or more rows are not visible; and determining whether to update the result bitmap to indicate that the one or more rows are visible based on one or more versioned row state values, wherein the one or more versioned row state values indicate whether the corresponding rows are not visible or possibly visible.
摘要翻译：这里公开了用于确定行可见性状态的系统，方法和计算机程序产品实施例。实施例通过基于与行对应的行状态位图的可见行状态值来初始化行的结果位图来进行操作，其中结果位图的值指示该行是可见还是不可见; 确定其对应的可见行状态值指示所述一行或多行不可见的一行或多行; 以及基于一个或多个版本化的行状态值来确定是否更新所述结果位图以指示所述一行或多行是可见的，其中所述一个或多个版本化行状态值指示相应行是否不可见或可见。

6. 发明申请

US20160147806A1 VERSIONED BLOOM FILTER 有权
公开(公告)号：US20160147806A1
公开(公告)日：2016-05-26
申请号：US14552905
申请日：2014-11-25
申请人： Rolando Blanco , Muhammed Sharique , Chaitanya Gottipati , Mihnea Andrei
发明人： Rolando Blanco , Muhammed Sharique , Chaitanya Gottipati , Mihnea Andrei
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , G06F17/30011 , G06F17/30336 , G06F17/30424
摘要： Disclosed herein are system, method, and computer program product embodiments for bloom filter versioning. A request to add a new value to a first bitmap is received, wherein the first bitmap includes a bit sequence corresponding to a most recently added value. It is determined that the first bitmap has exceeded a threshold. A second bitmap is generated, the second bitmap including more bits than the first bitmap. The first bitmap is deleted based upon a determination that a number of readers accessing the first bitmap is zero.
摘要翻译：这里公开了用于布隆过滤器版本控制的系统，方法和计算机程序产品实施例。接收向第一位图添加新值的请求，其中第一位图包括与最近添加的值对应的比特序列。确定第一位图已经超过阈值。生成第二位图，第二位图包括比第一位图更多的位。基于确定访问第一位图的读取器的数量为零的第一位图被删除。

7. 发明申请

US20160147786A1 Efficient Database Undo / Redo Logging 有权
标题翻译：高效数据库撤消/重做日志
公开(公告)号：US20160147786A1
公开(公告)日：2016-05-26
申请号：US14553833
申请日：2014-11-25
申请人： Mihnea Andrei , Ivan Schreter , David Wein , Shiping Chen , Panfeng Zhou , Steffen Geissinger
发明人： Mihnea Andrei , Ivan Schreter , David Wein , Shiping Chen , Panfeng Zhou , Steffen Geissinger
IPC分类号： G06F17/30 , G06F11/14
CPC分类号： G06F17/30162 , G06F11/1402 , G06F17/30185 , G06F17/30336 , G06F17/30368
摘要： Log records are accessed as part of a database operation in a database. The log records log insert, update, and delete operations in the database and include, for each row, a row position, a fragment identifier (ID), and a row ID. Thereafter, as part of the database operation, rows specified by the log records are located by: using the fragment identifier and the row position within the corresponding record of the log if the fragment with the corresponding fragment identifier is still available, otherwise, using the row identifier within the corresponding record of the log to look up the row position in an index of a corresponding row identifier column. The database operation is then finalized using the located rows. Related apparatus, systems, techniques and articles are also described.
摘要翻译：日志记录作为数据库中数据库操作的一部分进行访问。日志记录数据库中的日志插入，更新和删除操作，并为每行包括行位置，片段标识符（ID）和行ID。此后，作为数据库操作的一部分，由日志记录指定的行通过以下方式定位：如果具有相应分段标识符的片段仍然可用，则使用片段标识符和日志对应记录中的行位置，否则使用日志的相应记录中的行标识符，以查找相应行标识符列的索引中的行位置。然后使用定位的行完成数据库操作。还描述了相关设备，系统，技术和物品。

8. 发明授权

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序列和位向量之一的位规格。此外，该实施例包括使用位图执行数据库操作。

9. 发明申请

US20150178328A1 Client-Side Directed Commands to a Loosely Coupled Database 有权
标题翻译：客户端定向命令到松散耦合的数据库
公开(公告)号：US20150178328A1
公开(公告)日：2015-06-25
申请号：US14138487
申请日：2013-12-23
申请人： Dean Emerson Stephan, III , Mihnea Andrei
发明人： Dean Emerson Stephan, III , Mihnea Andrei
IPC分类号： G06F17/30 , G06F9/46
CPC分类号： G06F17/30584 , G06F17/30545
摘要： Dynamically directing a command to a node in a distributed database is described. An example method includes receiving the command from a client application to access data in the distributed database, where the command contains a set of parameters. A primary key is constructed from at least some of the parameters. The client further generates routing information from a node-partition table based on a comparison of the primary key with an entry in the node-partition table, where the node-partition table maps the primary key to a node in the distributed database. Accordingly, the command is directed to the node in the distributed database based on the routing information.
摘要翻译：描述了将命令动态地引导到分布式数据库中的节点。示例性方法包括从客户端应用接收命令以访问分布式数据库中的数据，其中命令包含一组参数。主键由至少一些参数构成。基于主键与节点分区表中的条目的比较，客户端还从节点分区表生成路由信息，其中节点分区表将主键映射到分布式数据库中的节点。因此，该命令基于路由信息被引导到分布式数据库中的节点。

10. 发明申请

US20150142819A1 LARGE STRING ACCESS AND STORAGE 有权
标题翻译：大量的访问和存储
公开(公告)号：US20150142819A1
公开(公告)日：2015-05-21
申请号：US14524998
申请日：2014-10-27
申请人： Colin Florendo , Ivan Schreter , Mihnea Andrei
发明人： Colin Florendo , Ivan Schreter , Mihnea Andrei
IPC分类号： G06F17/30
CPC分类号： G06F17/30312
摘要： Techniques for handling large string values in a string dictionary within an in-memory database system are presented. The string dictionary can be a paged-column main dictionary. For example, a value block of a dictionary may be loaded into memory, where the dictionary stores values for dictionary compression. The value block may include a first portion of a large string value and one or more logical pointers to one or more large string pages containing a remainder of the large string value. The large string value may be materialized into a contiguous location in memory, and a pointer to the materialized large string value may be created.
摘要翻译：介绍了在内存数据库系统中处理字符串字典中大字符串值的技术。字典字典可以是分页列主字典。例如，字典的值块可以被加载到存储器中，其中字典存储用于字典压缩的值。值块可以包括大字符串值的第一部分和包含大字符串值的余数的一个或多个大字符串页的一个或多个逻辑指针。大字符串值可以被实现到存储器中的连续位置，并且可以创建指向物化的大字符串值的指针。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式