公开(公告)号：US20250094399A1

公开(公告)日：2025-03-20

申请号：US18885639

申请日：2024-09-14

Applicant: Oracle International Corporation

Inventor： Aurosish Mishra ,  Shasank Kisan Chavan ,  Tirthankar Lahiri ,  Agnivo Saha ,  Rohan Aggarwal ,  Weiwei Gong ,  Juan R. Loaiza

IPC: G06F16/22

Abstract: Techniques for automatically selecting a type of vector index are provided. In one technique, in response to determining to generate a vector index based on a base table that stores a plurality of vectors, a number of the plurality of vectors is identified. Based at least on the number of the plurality of vectors, a particular type of vector index is identified from among a plurality of types of vector indexes. Examples of the plurality of types include an HNSW index and an IVF index. A vector index of the particular type is generated for the base table. Another criterion in identifying a type of vector index to generate is the number of neighbors that is a parameter in generating a certain type of vector index.

公开(公告)号：US20240126763A1

公开(公告)日：2024-04-18

申请号：US18099034

申请日：2023-01-19

Applicant: Oracle International Corporation

Inventor： Tirthankar Lahiri ,  Juan R. Loaiza ,  Beda Christoph Hammerschmidt ,  Andrew Witkowski ,  Sankar Subramanian ,  Sabina Petride ,  Ajit Mylavarapu ,  Gerald Venzl

IPC: G06F16/2455 ,  G06F16/22

CPC classification number: G06F16/24565 ,  G06F16/221 ,  G06F16/24554

Abstract: Disclosed herein are techniques for storing, within a database system, metadata that indicates an intended usage (IU). Once created, an IU may be assigned to a column to (a) indicate how the column is intended to be used, and (b) affect how the database server behaves when database operations involve values from the column. The IU assigned to a column supplements, but does not replace, the datatype definition for the column. Each IU may have an IU-bundle. The IU-bundle of an IU indicates how the database server behaves with respect to any column that is assigned the IU. For example, the IU-bundle may indicate constraints that the database server must validate during operations on values from columns assigned to the IU. Techniques are also described for implementing multi-column IUs and flexible IUs.

公开(公告)号：US20240119041A1

公开(公告)日：2024-04-11

申请号：US18476207

申请日：2023-09-27

Applicant: Oracle International Corporation

Inventor： Juan R. Loaiza ,  Sachin Vijakumar Sonawane ,  Mahesh Baburao Girkar ,  Wei-Ming Hu

IPC: G06F16/23 ,  G06F16/22 ,  H04L9/08

CPC classification number: G06F16/2365 ,  G06F16/2282 ,  G06F16/2379 ,  H04L9/0894

Abstract: A blockchain object stores multiple user blockchains, each blockchain comprising an ordered set of records in the blockchain object. The records of a user blockchain have the same blockchain key value. Users can create multiple blockchains by establishing respective blockchain key values for the blockchains. Like blocks in a blockchain, the records in a user blockchain are ordered by a sequence of numbers that is specific to the user blockchain; each user blockchain has its own sequence of numbers. Each record in a user blockchain holds a sequence number in a field of the blockchain object. An efficient mechanism maintains and assigns a sequence number to a record when appended to a user blockchain.

公开(公告)号：US11550771B2

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

申请号：US17070277

申请日：2020-10-14

Applicant: Oracle International Corporation

Inventor： Jesse Kamp ,  Allison L. Holloway ,  Meichun Hsu ,  Hideaki Kimura ,  Boris Klots ,  Vasudha Krishnaswamy ,  Kartik Kulkarni ,  Teck Hua Lee ,  Yunrui Li ,  Aurosish Mishra ,  Ajit Mylavarapu ,  Sukhada Pendse ,  Garret F. Swart ,  Shasank K. Chavan ,  Tirthankar Lahiri ,  Juan R. Loaiza

IPC: G06F16/22 ,  G06F16/27 ,  G06F16/21 ,  G06F16/174 ,  G06F16/18 ,  G06F16/23 ,  G06F16/11

Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

公开(公告)号：US11514029B2

公开(公告)日：2022-11-29

申请号：US17136568

申请日：2020-12-29

Applicant: Oracle International Corporation

Inventor： Vasudha Krishnaswamy ,  Sukhada Pendse ,  Solmaz Kolahi ,  Ankita Kumar ,  Ajit Mylavarapu ,  Garret F. Swart ,  Tirthankar Lahiri ,  Juan R. Loaiza

IPC: G06F16/23 ,  G06F16/27 ,  G06F16/21

Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

公开(公告)号：US11256627B2

公开(公告)日：2022-02-22

申请号：US16907703

申请日：2020-06-22

Applicant: Oracle International Corporation

Inventor： Juan R. Loaiza ,  J. William Lee ,  Wei-Ming Hu ,  Kothanda Umamageswaran ,  Neil J. S. MacNaughton ,  Adam Y. Lee

IPC: G06F12/0873 ,  G06F12/0868 ,  G06F12/0866 ,  G06F16/13 ,  G06F16/172

Abstract: A method and an apparatus for implementing a buffer cache for a persistent file system in a non-volatile memory is provided. A set of data is maintained in one or more extents in a non-volatile random-access memory (NVRAM) of a computing device. At least one buffer header is allocated in a dynamic random-access memory (DRAM) of the computing device. In response to a read request by a first process executing on the computing device to access one or more first data blocks in a first extent of the one or more extents, the first process is granted direct read access of the first extent in the NVRAM. A reference to the first extent in the NVRAM is stored in a first buffer header. The first buffer header is associated with the first process. The first process uses the first buffer header to directly access the one or more first data blocks in the NVRAM.

公开(公告)号：US10956335B2

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

申请号：US15720972

申请日：2017-09-29

Applicant: Oracle International Corporation

Inventor： Zuoyu Tao ,  Jia Shi ,  Kothanda Umamageswaran ,  Juan R. Loaiza

IPC: G06F12/0873 ,  G06F12/0864 ,  G06F16/22 ,  G06F16/2455 ,  G06F12/02 ,  G06F12/0868 ,  G06F12/0871 ,  G06F15/173

Abstract: Data blocks are cached in a persistent cache (“NV cache”) allocated from as non-volatile RAM (“NVRAM”). The data blocks may be accessed in place in the NV cache of a “source” computing element by another “remote” computing element over a network using remote direct memory access (“RMDA”). In order for a remote computing element to access the data block in NV cache on a source computing element, the remote computing element needs the memory address of the data block within the NV cache. For this purpose, a hash table is stored and maintained in RAM on the source computing element. The hash table identifies the data blocks in the NV cache and specifies a location of the cached data block within the NV cache.

公开(公告)号：US20210073209A1

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

申请号：US16923279

申请日：2020-07-08

Applicant: Oracle International Corporation

Inventor： Juan R. Loaiza ,  Wei-Ming Hu ,  Amrish Srivastava ,  Mahesh Baburao Girkar ,  James W. Stamos

IPC: G06F16/23 ,  G06F16/22 ,  H04L9/06

Abstract: Herein are high throughput techniques for incorporating cryptographic blockchains into relational data. In an embodiment, a computer indicates, in a database dictionary in a database, that a relational table is for blockchain storage. The relational table contains application column(s). In response to that indication, the relational table is associated with system column(s) that are unmodifiable by administrators and clients of the database. The system column(s) include a cryptographic hash column. A request to store a particular value in a particular application column is received from a client. In response to receiving the request, a cryptographic hash value is calculated for a new row for the relational table. In the relational table, the computer stores the new row that contains: the particular value in the particular application column, and the cryptographic hash value in the cryptographic hash column.

公开(公告)号：US20200042489A1

公开(公告)日：2020-02-06

申请号：US16055978

申请日：2018-08-06

Applicant: Oracle International Corporation

Inventor： Tirthankar Lahiri ,  Juan R. Loaiza ,  Garret F. Swart ,  Jesse Kamp ,  Avneesh Pant ,  Hideaki Kimura

IPC: G06F15/167 ,  G06F15/173 ,  G06F9/54 ,  G06F9/455

Abstract: Techniques are provided to allow more sophisticated operations to be performed remotely by machines that are not fully functional. Operations that can be performed reliably by a machine that has experienced a hardware and/or software error are referred to herein as Remote Direct Memory Operations or “RDMOs”. Unlike RDMAs, which typically involve trivially simple operations such as the retrieval of a single value from the memory of a remote machine, RDMOs may be arbitrarily complex. The techniques described herein can help applications run without interruption when there are software faults or glitches on a remote system with which they interact.

公开(公告)号：US10380021B2

公开(公告)日：2019-08-13

申请号：US13801319

申请日：2013-03-13

Applicant: Oracle International Corporation

Inventor： Juan R. Loaiza ,  Kothanda Umamageswaran ,  David Friedman ,  Jia Shi ,  Zuoyu Tao ,  Alex Tsukerman

IPC: G06F12/0868 ,  G06F12/0804 ,  G06F11/20 ,  G06F12/12

Abstract: No-loss rapid recovery performs resynchronization efficiently while concurrently allowing availability to mirrored data on the storage device. No-loss rapid recovery has two stages and involves storage devices that have both a non-volatile cache and primary storage and that operate as mirror buddies. The first stage is referred to herein as the buddy-retention stage. During the buddy-retention stage, writes to mirrored data are not performed on the offline mirror buddy but are performed on the online mirror buddy. The mirrored data changed in the online mirrored buddy is retained in the non-volatile cache of the retention buddy. The next stage is referred to herein as the rapid resynchronization stage. In this stage, the changed mirrored data retained by the retention buddy for no-loss rapid recovery is used to resynchronize the offline buddy. The storage device is resynchronized using the changed mirrored data retained in the cache of the mirror buddy.