Sap Se

Sybase, Inc.

Salesforce Com, Inc.

Aditya Gurajada

Amit Pathak

Amarnadh Sai Eluri

Swati Sharma

Graham Ivey

Fei Zhou

Paresh Manhar Rathod

Yanhong Wang

Dheren Gala

Daniel Alan Wood

Pushkar Khadilkar

Shampa Chakravarty

Rahul Mittal

Vaibhav A Nalawade

Zhi-ping Xiong

Carlos Ruiz

Zhan-feng Ma

Jian Wu

A system for an in-memory row storage architecture can be provided. In some implementations, the system performs operations comprising monitoring access to a plurality of rows in a database partition, a first portion of the plurality of rows stored in a persistent page store and a second portion of the plurality of rows stored in an in-memory row store. The operations can further comprise determining workload parameters based on the monitoring, selecting a location for performing a database operation on the database partition based on the workload parameters, and performing the database operation on the database partition within the selected location (e.g., the persistent page store or the in-memory row store). Related systems, methods, and articles of manufacture are also described.

Information life cycle management of in-memory row storage

Data recovery in a database includes performing a backward scan of a transaction log that records transactions made on the database. The backward scan includes traversing log records starting from a latest-in-time log record toward the beginning of the transaction log. Each log record can be replayed to recover data for a database row associated with the log record. An earlier-in-time log record is skipped if the associate database row has been recovered by later-in-time log record.

Recovery of in-memory databases from log records

Recovery of in-memory databases after a system crash

Example methods and systems are directed to existence checks on rows within a database. A page data structure stores bitmap data for the rows in the page. A row within the page corresponds to a single bit in the bitmap data. To determine if a row has been deleted, the page data structure for the page containing the row is located and the bit for the row in the page data structure is checked. An array of page data structures is created, indexed by a hash of the page identifier. In the event of a hash collision, a linked list of page data structures is used, sorted by page identifier.

Existence checks on rows within a database

A system for an in-memory row storage architecture can be provided. In some implementations, the system performs operations comprising adding a data row to an in-memory row store at a row location based on a database operation, indexing the row location in an index table comprising a plurality of nodes for a plurality of rows in the in-memory row store, the plurality of nodes organized across a plurality of buckets, and accessing the data row at the row location in the in-memory row store based on the index table to perform another database operation on the data row Related systems, methods, and articles of manufacture are also described.

Lock-free hash indexing

Methods, systems and computer program products for tracking, encoding and decoding the code-location of runtime events. The system receives an encoded identifier function call as a parameter for a first function included in at least one file in a plurality of files of a source code base. The system returns a compact encoded identifier generated by the encoded identifier function call during compilation of the plurality of files of the source code base. In response to receiving a runtime event's identifier from execution of the source code base, the system decodes the encoded identifier to trace back to a unique location of the first function in the source code base, thereby identifying the filename and line number where the event occurred.

Efficiently tracking code location of run-time events in system software

A system for an in-memory row storage architecture can be provided. In some implementations, the system performs operations comprising processing a database transaction affecting at least a first row in an in-memory row store and at least a second row in a persistent page store, logging changes to the second row within a page store transaction log as part of the processing and prior to committing the database transaction, logging a final aggregated result of the first row as part of committing the database transaction within a row store transaction log that is separate and distinct from the page store transaction log, and altering at least a portion of the in-memory row store based on accessing the row store transaction log. Related systems, methods, and articles of manufacture are also described.

In-memory row storage durability

Recovery of in-memory databases using a backward scan of the database transaction log

A system for an in-memory row storage architecture can be provided. In some implementations, the system performs operations comprising determining that data stored at a first location in a persistent page store is active, copying the data to a second location in an in-memory row store in response to determining that the data is active, indexing the data in an index table in response to determining that the data is active, accessing the data at the second location in the in-memory row store based on the index table, and performing an update of the data in the in-memory row store. Related systems, methods, and articles of manufacture are also described.

In-memory row storage architecture

A system, method and a computer-readable medium for reducing a contentious access of data in memory system storage by simulating an online transaction processing business lifecycle, are provided. The memory storage system determines a type of data, where the type of data corresponds to access frequency of data. The data is stored in a row-based format in a row-based storage, a page-based format in a page-based storage and a compressed format in a compressed storage based on the determined type of data. The data is also transferred between the row-based storage, the page-based storage and the compressed storage according to predefined criteria.

Data row cache for an acid compliant in-memory row store in a page-based RDBMS engine

System, method, computer program product embodiments and combinations and sub-combinations thereof for managing data storage as an in-memory database in a database management system (DBMS) are provided. In an embodiment, a specialized database type is provided as a parameter of a native DBMS command. A database hosted entirely in-memory of the DBMS is formed when the specialized database type is specified.

Growing community of inventors

Hyderabad Telangana, India

Aditya Gurajada