公开(公告)号：US20160147748A1

公开(公告)日：2016-05-26

申请号：US14549806

申请日：2014-11-21

Applicant: Colin Florendo ,  Ivan Schreter

Inventor： Colin Florendo ,  Ivan Schreter

IPC: G06F17/30

CPC classification number: G06F17/303 ,  G06F17/30339 ,  G06F17/30958

Abstract: The present disclosure involves systems, software, and computer implemented methods for moving a table from a source node to a destination node. In one example, the method includes receiving metadata associated with an in-memory database table stored at a source node. A table container is created responsive to receiving the metadata. The destination node sequentially requests, from the source node, portions of the table, wherein the table is serialized at the source node to provide a serialized sequence of table portions. Sequentially requesting comprises sending a request for a next portion of the table after processing a received portion, which includes receiving a portion of the serialized table, deserializing the received portion, adding the deserialized portion to the created table container, and in response to an end of file indication associated with the received portion, ending the requests and finalizing the table.

Abstract translation: 本公开涉及用于将表从源节点移动到目的地节点的系统，软件和计算机实现的方法。 在一个示例中，该方法包括接收与存储在源节点处的存储器内数据库表相关联的元数据。 响应于接收元数据创建表容器。 目的地节点从源节点顺序地请求表的部分，其中表在源节点被序列化以提供表部分的序列化序列。 顺序请求包括在处理接收到的部分之后发送对表的下一部分的请求，其包括接收序列化表的一部分，对接收到的部分进行反序列化，将反序列化部分添加到创建的表容器中，并响应于结束 与所接收的部分相关联的文件指示，结束请求并完成表格。

公开(公告)号：US09268810B2

公开(公告)日：2016-02-23

申请号：US14143864

申请日：2013-12-30

Applicant: Mihnea Andrei ,  Anil Goel ,  Colin Florendo ,  Rolando Blanco ,  David DeHaan

Inventor： Mihnea Andrei ,  Anil Goel ,  Colin Florendo ,  Rolando Blanco ,  David DeHaan

IPC: G06F17/30 ,  G06F11/14

CPC classification number: G06F17/30362 ,  G06F11/1448 ,  G06F17/30309 ,  G06F17/30312 ,  G06F17/30315 ,  G06F17/30339 ,  G06F17/30368 ,  G06F17/30371 ,  G06F2201/80 ,  G06F2201/825 ,  G06F2201/84 ,  G06F2201/87

Abstract: A locking mechanism in a delta-store-based database to support long running transactions across multiple RID spaces is described. An example method includes establishing a column-based in-memory database including a main store and a delta store. A delete or an update statement is executed with a transaction on a table having plurality of table versions. The table versions are represented by bitmaps in the delta store and the bitmaps and table fragments corresponding to the table versions implement RID spaces for the table. A lock on a row of the table manipulated by the delete or the update statement is requested to preclude other transaction from deleting or updating an obsolete version of data. Upon a successful validation that the row to be locked is not the obsolete version in the RID spaces of the table, a lock is granted to the transaction.

Abstract translation: 描述了基于增量存储的数据库中的锁定机制，以支持跨多个RID空间的长时间运行的事务。 示例性方法包括建立包括主存储和增量存储的基于列的存储器内数据库。 在具有多个表版本的表上的事务执行删除或更新语句。 表版本由delta存储中的位图表示，与表版本对应的位图和表片段实现了表的RID空格。 请求由delete或update语句操纵的表的一行上的锁，以排除其他事务删除或更新过时版本的数据。 成功验证要锁定的行不是表的RID空间中的过时版本，则会向该事务授予一个锁。

公开(公告)号：US20140279961A1

公开(公告)日：2014-09-18

申请号：US13797676

申请日：2013-03-12

Applicant: Ivan Schreter ,  Dirk Thomsen ,  Colin Florendo ,  Blaine French

Inventor： Ivan Schreter ,  Dirk Thomsen ,  Colin Florendo ,  Blaine French

IPC: G06F17/30

CPC classification number: G06F3/0661 ,  G06F3/0608 ,  G06F3/0673 ,  G06F17/30153 ,  G06F17/30312 ,  G06F17/30315 ,  G06F17/30339 ,  G06F17/30345 ,  G06F17/30486

Abstract: Data records of a data set can be stored in multiple main part fragments retained in on-disk storage. Each fragment can include a number of data records that is equal to or less than a defined maximum fragment size. Using a compression that is optimized for each fragment, each fragment can be compressed. After reading at least one of the fragments into main system memory from the on-disk storage, an operation can be performed on the fragment or fragments while the in the main system memory.

Abstract translation: 数据集的数据记录可以存储在保留在磁盘存储中的多个主要部分片段中。 每个片段可以包括等于或小于所定义的最大片段大小的多个数据记录。 使用针对每个片段优化的压缩，可以压缩每个片段。 在从磁盘存储器读入主系统存储器中的至少一个片段之后，可以在主系统存储器中对片段或片段执行操作。

公开(公告)号：US09659050B2

公开(公告)日：2017-05-23

申请号：US13960335

申请日：2013-08-06

Applicant: Mihnea Andrei ,  Colin Florendo ,  Anil Kumar Goel

Inventor： Mihnea Andrei ,  Colin Florendo ,  Anil Kumar Goel

IPC: G06F17/30 ,  G06F11/14

CPC classification number: G06F17/30362 ,  G06F11/1448 ,  G06F17/30309 ,  G06F17/30312 ,  G06F17/30315 ,  G06F17/30339 ,  G06F17/30368 ,  G06F17/30371 ,  G06F2201/80 ,  G06F2201/825 ,  G06F2201/84 ,  G06F2201/87

Abstract: 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 does not allow 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 transaction associated with the column-based in-memory database is received. For each table read by the transaction, a version of the table in the delta store that represents a transaction-consistent snapshot of the database visible to the transaction is determined. Each table is represented in the main store and the delta store; and each version of the table is represented by one or more bitmaps. Upon execution of a DML as part of the transaction, for each table written by the transaction, the data changes generated by the transaction is recorded in the one or more bitmaps that represent a private version of the table. Upon commit of the transaction, for each table written by the transaction, a new public version of the table is generated based on the private version of the table, and the public version represents a new transaction-consistent snapshot of the database visible to subsequent transactions.

公开(公告)号：US09348833B2

公开(公告)日：2016-05-24

申请号：US13797710

申请日：2013-03-12

Applicant: Ivan Schreter ,  Dirk Thomsen ,  Colin Florendo ,  Blaine French

Inventor： Ivan Schreter ,  Dirk Thomsen ,  Colin Florendo ,  Blaine French

IPC: G06F12/00 ,  G06F17/30

CPC classification number: G06F17/30153 ,  G06F17/30135 ,  G06F17/30162

Abstract: A plurality of data records of a data set can be stored in a plurality of main part fragments, at least one of which is an old fragment stored on-disk. A number of one or more data records in the old fragment that have been marked for deletion can be determined to be greater than a threshold number, and the old fragment can be loaded into main system memory. A merge of the old fragment can be performed to remove the one or more data records marked for deletion.

Abstract translation: 数据组的多个数据记录可以存储在多个主要部分片段中，其中至少一个是存储在磁盘上的旧片段。 已经标记为删除的旧片段中的一个或多个数据记录可以被确定为大于阈值数，并且旧片段可以被加载到主系统存储器中。 可以执行旧片段的合并，以删除标记为删除的一个或多个数据记录。

公开(公告)号：US20150186444A1

公开(公告)日：2015-07-02

申请号：US14143864

申请日：2013-12-30

Applicant: Mihnea Andrei ,  Anil Goel ,  Colin Florendo ,  Rolando Blanco ,  David DeHaan

Inventor： Mihnea Andrei ,  Anil Goel ,  Colin Florendo ,  Rolando Blanco ,  David DeHaan

IPC: G06F17/30 ,  G06F11/14

CPC classification number: G06F17/30362 ,  G06F11/1448 ,  G06F17/30309 ,  G06F17/30312 ,  G06F17/30315 ,  G06F17/30339 ,  G06F17/30368 ,  G06F17/30371 ,  G06F2201/80 ,  G06F2201/825 ,  G06F2201/84 ,  G06F2201/87

Abstract: A locking mechanism in a delta-store-based database to support long running transactions across multiple RID spaces is described. An example method includes establishing a column-based in-memory database including a main store and a delta store. A delete or an update statement is executed with a transaction on a table having plurality of table versions. The table versions are represented by bitmaps in the delta store and the bitmaps and table fragments corresponding to the table versions implement RID spaces for the table. A lock on a row of the table manipulated by the delete or the update statement is requested to preclude other transaction from deleting or updating an obsolete version of data. Upon a successful validation that the row to be locked is not the obsolete version in the RID spaces of the table, a lock is granted to the transaction.

Abstract translation: 描述了基于增量存储的数据库中的锁定机制，以支持跨多个RID空间的长时间运行的事务。 示例性方法包括建立包括主存储和增量存储的基于列的存储器内数据库。 在具有多个表版本的表上的事务执行删除或更新语句。 表版本由delta存储中的位图表示，与表版本对应的位图和表片段实现了表的RID空格。 请求由delete或update语句操纵的表的一行上的锁，以排除其他事务删除或更新过时版本的数据。 成功验证要锁定的行不是表的RID空间中的过时版本，则会向该事务授予一个锁。

公开(公告)号：US20140279962A1

公开(公告)日：2014-09-18

申请号：US13797710

申请日：2013-03-12

Applicant: Ivan Schreter ,  Dirk Thomsen ,  Colin Florendo ,  Blaine French

Inventor： Ivan Schreter ,  Dirk Thomsen ,  Colin Florendo ,  Blaine French

IPC: G06F17/30

CPC classification number: G06F17/30153 ,  G06F17/30135 ,  G06F17/30162

Abstract: A plurality of data records of a data set can be stored in a plurality of main part fragments, at least one of which is an old fragment stored on-disk. A number of one or more data records in the old fragment that have been marked for deletion can be determined to be greater than a threshold number, and the old fragment can be loaded into main system memory. A merge of the old fragment can be performed to remove the one or more data records marked for deletion.

Abstract translation: 数据组的多个数据记录可以存储在多个主要部分片段中，其中至少一个是存储在磁盘上的旧片段。 已经标记为删除的旧片段中的一个或多个数据记录可以被确定为大于阈值数，并且旧的片段可以被加载到主系统存储器中。 可以执行旧片段的合并，以删除标记为删除的一个或多个数据记录。