公开(公告)号：US10803039B2

公开(公告)日：2020-10-13

申请号：US15606322

申请日：2017-05-26

Applicant: Oracle International Corporation

Inventor： Siddharth Teotia ,  Krishna Kunchithapadam ,  Jesse Kamp ,  Tirthankar Lahiri ,  Michael J. Gleeson ,  Juan R. Loaiza ,  Garret F. Swart ,  Neil J. S. MacNaughton ,  Kam Shergill

IPC: G06F12/1045 ,  G06F15/173 ,  G06F16/22 ,  G06F16/907

Abstract: Techniques are provided for enabling a requesting entity to retrieve data that is managed by a database server instance from the volatile memory of a server machine that is executing the database server instance. The techniques allow the requesting entity to retrieve the data from the volatile memory of the host server machine without involving the database server instance in the retrieval operation. Because the retrieval does not involve the database server instance, the retrieval may succeed even when the database server instance has stalled or become unresponsive. In addition, direct retrieval of data using the techniques described herein will often be faster and more efficient than retrieval of the same information through conventional interaction with the database server instance.

公开(公告)号：US20190294558A1

公开(公告)日：2019-09-26

申请号：US16435101

申请日：2019-06-07

Applicant: Oracle International Corporation

Inventor： Siddharth Teotia ,  Krishna Kunchithapadam ,  Tirthankar Lahiri ,  Jesse Kamp ,  Michael J. Gleeson ,  Juan R. Loaiza ,  Garret F. Swart ,  Neil J.S. MacNaughton ,  Kam Shergill

IPC: G06F12/1018 ,  G06F16/2453 ,  G06F16/22 ,  G06F12/126 ,  G06F12/0864 ,  G06F12/0868 ,  G06F12/128 ,  G06F16/901

Abstract: A hashing scheme includes a cache-friendly, latchless, non-blocking dynamically resizable hash index with constant-time lookup operations that is also amenable to fast lookups via remote memory access. Specifically, the hashing scheme provides each of the following features: latchless reads, fine grained lightweight locks for writers, non-blocking dynamic resizability, cache-friendly access, constant-time lookup operations, amenable to remote memory access via RDMA protocol through one sided read operations, as well as non-RDMA access.

公开(公告)号：US09559720B2

公开(公告)日：2017-01-31

申请号：US13631575

申请日：2012-09-28

Applicant: Oracle International Corporation

Inventor： Vineet Marwah ,  Vikram Kapoor ,  Amit Ganesh ,  Jesse Kemp ,  Sachin Kulkarni ,  Roger Macnicol ,  Kam Shergill ,  Manosiz Bhattacharyya

IPC: G06F17/30 ,  H03M7/30

CPC classification number: H03M7/30 ,  G06F17/30595

Abstract: Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data. After testing the candidate compression techniques against the samples, the resulting compression ratios are compared. The compression technique to use on the set of data is then selected based, in part, on the compression ratios achieved during the compression tests performed on the sample data.

Abstract translation: 这里描述了用于自动选择要在表格数据上使用的压缩技术的技术。 压缩分析仪为用户提供了对选择过程的高级控制，而不需要用户了解有关压缩分析器可用的特定压缩技术的细节。 用户可以为给定的数据集指定沿“最大性能”和“最大压缩”之间的“平衡点”。 所选择的点由压缩分析器以各种方式使用。 例如，在一个实施例中，压缩分析器使用用户指定的平衡点来确定哪个可用的压缩技术符合给定的数据集合的“候选技术”。 压缩分析仪通过对来自该组数据的样本实际测试候选压缩技术来选择对一组数据使用的压缩技术。 在针对样品测试候选压缩技术之后，比较所得到的压缩比。 然后，部分地基于在对样本数据执行的压缩测试期间实现的压缩比来选择在该组数据上使用的压缩技术。

公开(公告)号：US20130036101A1

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

申请号：US13631575

申请日：2012-09-28

Applicant: Oracle International Corporation

Inventor： Vineet Marwah ,  Vikram Kapoor ,  Amit Ganesh ,  Jesse Kemp ,  Sachin Kulkarni ,  Roger Macnicol ,  Kam Shergill ,  Manosiz Bhattacharyya

IPC: G06F17/30

CPC classification number: H03M7/30 ,  G06F17/30595

Abstract: Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data. After testing the candidate compression techniques against the samples, the resulting compression ratios are compared. The compression technique to use on the set of data is then selected based, in part, on the compression ratios achieved during the compression tests performed on the sample data.

Abstract translation: 这里描述了用于自动选择要在表格数据上使用的压缩技术的技术。 压缩分析仪为用户提供了对选择过程的高级控制，而不需要用户了解有关压缩分析器可用的特定压缩技术的细节。 用户可以为给定的数据集指定沿最大性能和最大压缩之间的平衡点。 所选择的点由压缩分析器以各种方式使用。 例如，在一个实施例中，压缩分析器使用用户指定的平衡点来确定哪些可用的压缩技术被鉴定为用于给定的一组数据的候选技术。 压缩分析仪通过对来自该组数据的样本实际测试候选压缩技术来选择对一组数据使用的压缩技术。 在针对样品测试候选压缩技术之后，比较所得到的压缩比。 然后，部分地基于在对样本数据执行的压缩测试期间实现的压缩比来选择在该组数据上使用的压缩技术。

公开(公告)号：US11520743B2

公开(公告)日：2022-12-06

申请号：US14079507

申请日：2013-11-13

Applicant: Oracle International Corporation

Inventor： Vikram Kapoor ,  Amit Ganesh ,  Jesse Kamp ,  Sachin Kulkarni ,  Vineet Marwah ,  Kam Shergill ,  Roger Macnicol ,  Manosiz Bhattacharyya

IPC: G06F16/174 ,  G06F16/2455 ,  G06F16/901

Abstract: A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user.

公开(公告)号：US10346315B2

公开(公告)日：2019-07-09

申请号：US15606327

申请日：2017-05-26

Applicant: Oracle International Corporation

Inventor： Siddharth Teotia ,  Krishna Kunchithapadam ,  Tirthankar Lahiri ,  Jesse Kamp ,  Michael J. Gleeson ,  Juan R. Loaiza ,  Garret F. Swart ,  Neil J. S. MacNaughton ,  Kam Shergill

IPC: G06F16/22 ,  G06F16/901 ,  G06F12/1018 ,  G06F16/2453

Abstract: A hashing scheme includes a cache-friendly, latchless, non-blocking dynamically resizable hash index with constant-time lookup operations that is also amenable to fast lookups via remote memory access. Specifically, the hashing scheme provides each of the following features: latchless reads, fine grained lightweight locks for writers, non-blocking dynamic resizability, cache-friendly access, constant-time lookup operations, amenable to remote memory access via RDMA protocol through one sided read operations, as well as non-RDMA access.

公开(公告)号：US11080204B2

公开(公告)日：2021-08-03

申请号：US16435101

申请日：2019-06-07

Applicant: Oracle International Corporation

Inventor： Siddharth Teotia ,  Krishna Kunchithapadam ,  Tirthankar Lahiri ,  Jesse Kamp ,  Michael J. Gleeson ,  Juan R. Loaiza ,  Garret F. Swart ,  Neil J. S. MacNaughton ,  Kam Shergill

IPC: G06F12/1018 ,  G06F16/22 ,  G06F16/2453 ,  G06F16/901 ,  G06F12/0864 ,  G06F12/0868 ,  G06F12/126 ,  G06F12/128

Abstract: A hashing scheme includes a cache-friendly, latchless, non-blocking dynamically resizable hash index with constant-time lookup operations that is also amenable to fast lookups via remote memory access. Specifically, the hashing scheme provides each of the following features: latchless reads, fine grained lightweight locks for writers, non-blocking dynamic resizability, cache-friendly access, constant-time lookup operations, amenable to remote memory access via RDMA protocol through one sided read operations, as well as non-RDMA access.

公开(公告)号：US10025820B2

公开(公告)日：2018-07-17

申请号：US14480009

申请日：2014-09-08

Applicant: Oracle International Corporation

Inventor： Vineet Marwah ,  Vikram Kapoor ,  Jesse Kamp ,  Kam Shergill ,  Roger MacNicol ,  Sachin Kulkarni ,  Amit Ganesh

IPC: G06F17/30

Abstract: A method and apparatus is provided for optimizing queries received by a database system that relies on an intelligent data storage server to manage storage for the database system. Storing compression units in hybrid columnar format, the storage manager evaluates simple predicates and only returns data blocks containing rows that satisfy those predicates. The returned data blocks are not necessarily stored persistently on disk. That is, the storage manager is not limited to returning disc block images. The hybrid columnar format enables optimizations that provide better performance when processing typical database workloads including both fetching rows by identifier and performing table scans.

公开(公告)号：US20140074805A1

公开(公告)日：2014-03-13

申请号：US14079507

申请日：2013-11-13

Applicant: Oracle International Corporation

Inventor： Vikram Kapoor ,  Amit Ganesh ,  Jesse Kamp ,  Sachin Kulkarni ,  Vineet Marwah ,  Kam Shergill ,  Roger Macnicol ,  Manosiz Bhattacharyya

IPC: G06F17/30

CPC classification number: G06F16/1744 ,  G06F16/24561 ,  G06F16/902

Abstract: A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user.

Abstract translation: 数据库服务器将压缩单位存储在数据库的数据块中。 使用各种各样的压缩技术中的任一种，首先将表（或其多行的数据）压缩为“压缩单位”。 然后，压缩单元被存储在跨越一个或多个数据块的一个或多个数据块行。 结果，单个数据块行可以包括在压缩单元内编码的多个表行的压缩数据。 数据块中的压缩单元的存储与现有的基于数据块的数据库保持兼容，从而允许在预先存在的数据库中使用压缩单元，而无需修改数据库的底层格式。 压缩单元可以例如与未压缩的表共存。 各种技术允许数据库服务器优化对压缩单元中的数据的访问，使得压缩对于用户实际上是透明的。

公开(公告)号：US11789923B2

公开(公告)日：2023-10-17

申请号：US15267759

申请日：2016-09-16

Applicant: Oracle International Corporation

Inventor： Kam Shergill ,  Ankita Kumar ,  Himanshu Chatterjee ,  Vineet Marwah ,  Srinivas Vemuri

IPC: G06F16/23 ,  G06F16/22

CPC classification number: G06F16/2343 ,  G06F16/2272

Abstract: A method and apparatus for compression units in an index block is provided. A particular leaf block of a database index for a table is generated. The particular leaf block corresponds to a particular range of key values. A compression scheme is determined for a plurality of index entries with key values within the particular range. A compression unit that includes a plurality of compressed index entries is generated by applying the compression scheme to the plurality of index entries. Compression metadata describing the compression scheme is generated. The compression unit and the compression metadata is stored in the particular leaf block. In response to a request, at least a portion of the compression unit is decompressed to access one or more index entries.