G06F16/2308

Automatic repair of corrupted blocks in a database

A distributed data warehouse system maintains data blocks on behalf of clients, and stores primary and secondary copies of data blocks on different disks or nodes in a cluster. The data warehouse system may back up data blocks in a key-value backup storage system. In response to a query targeting a data block previously stored in the cluster, the data warehouse system may determine whether a consistent, uncorrupted copy of the data block is available in the cluster (e.g., by applying a consistency check). If not (e.g., if a disk or node failed), the data warehouse system may automatically initiate an operation to restore the data block from the backup storage system, using a unique identifier of the data block to access a backup copy. The target data may be returned in a query response prior to restoring primary and secondary copies of the data block in the cluster.

Updating metadata in hardware transactional memory user aborts

A system for managing abort events of Hardware Transactional Memory (HTM) transactions to an in-memory database, comprising a processor adapted to control a plurality of abort events of a plurality of database transactions held concurrently to a shared in-memory database and a method for managing abort events comprising analyzing a metadata record associated with each potential abort event, where the metadata record comprises a row ID value and a row version value of a certain one of a plurality of rows of a database that is concurrently accessed by an aborting HTM transaction and another HTM transaction, comparing the row ID value and the row version value to a local ID value and a local version value of the aborting HTM transaction and determining a contention condition between the aborting HTM transaction and the other HTM transaction.

System and Method for Lock-free Shared Data Access for Processing and Management Threads
20230128503 · 2023-04-27 ·

A method, computer program product, and computing system for defining a first flow for one or more processing threads with access to shared data within the storage system. The one or more processing threads may be executed using the first flow. A processing thread reference count may be determined for the one or more processing threads being executed using the first flow. One or more management threads may be executed on the shared data within the storage system based upon, at least in part, the processing thread reference count.

Method, electronic device and computer program product for data management

A data management method comprises: receiving, at a first node of a plurality of nodes for collaboratively data processing, a request to perform a target operation at the first node from a second node of the plurality of nodes; obtaining a privilege of the second node from a third node of the plurality of nodes; determining a threshold privilege for performing the target operation based on a type of the target operation; and performing the target operation in accordance with a determination that the privilege of the second node is higher than the threshold privilege. In this manner, the security of data may be improved.

DYNAMIC MULTIPLE DATABASE MANAGEMENT FOR LEARNING AND PLAYING BACK ELECTROMAGNETIC SIGNALS
20230121898 · 2023-04-20 · ·

Dynamically enabling and disabling databases containing one or more representations of learned or known electromagnetic signals. The databases can be dynamically enabled or disabled in software, firmware, and/or in hardware. Enabling or disabling databases in software can be accomplished using a customized application external to the device. Enabling or disabling databases in firmware can be accomplished using a profile stored on the device, or external circuitry stored on the device. Enabling or disabling databases in hardware can be accomplished using specialized external hardware through infrared, or other type of electromagnetic interface.

REAL TIME METHOD AND SYSTEM FOR ANALYZING DATA STREAMS

Data analysis plays a crucial role to get significant information out of the data. A real time system and method for analyzing data streams have been provided. The system can utilize many different types of data formats such as numeric, text, video, audio, image, or combination thereof. The analysis takes place as per the requirement using an analytical engine and an intermediate output is generated. The intermediate output is further processed using a distributed real time business rule processing engine to determine required conditions in the data. The business rules comprise one or more set of meta data. On match of the business rule, the system triggers an alert or propagates the required information to integrating solution for required actions. The system and method are technology and communication protocol agnostic, and designed with highly efficient load balanced technique, thereby facilitating highly concurrent data processing with minimal latency.

DATA SYNCHRONIZATION IN CLOUD PLATFORMS WITHOUT DATABASE LOCKING
20230124068 · 2023-04-20 ·

Methods, systems, and computer-readable storage media for receiving, by a messaging system, a message having a key, the key indicating a tenant of a set of tenants, providing, by the messaging system, the message in a partition of a messaging queue, reading, by a service instance, the message from the partition, the service instance being in a set of services instances, each service instance executing a service of a service-based application, and in response to the message, updating, by the service instance, at least a portion of data stored within a database system, the portion of data being associated with the tenant, the database system storing data of each tenant of the set of tenants.

SHARED DATA FOR NETWORK TENANTS
20230068864 · 2023-03-02 ·

Systems and methods provide a common data container storing common data, a first data container storing first data associated with a first tenant, where the first container is accessible only to the first tenant, and where the first container is associated with read access to the common data of the common data container, and a second data container storing second data associated with a second tenant, where the second container is accessible only to the second tenant, and where the second container is associated with read access to the common data of the common data container, and where the common data container is not accessible to the first tenant or to the second tenant.

Data migration planning and scheduling based on data change rate analysis
11630846 · 2023-04-18 · ·

Data migration based on data change rate analysis is provided. A minimum data replication duration is calculated for each respective data migration event of a set of data migration events in an existing data migration wave plan by adjusting a planned data replication duration until a data change rate per day of servers is equal to an estimated server data replication rate per day when the existing data migration wave plan is not feasible. A new data replication start date, a new data replication end date, and a new data migration cutover date is determined for each respective data migration event based on the minimum data replication duration for each respective data migration event. A new data migration wave plan is generated based on the new data replication start date, the new data replication end date, and the new data migration cutover date for each respective data migration event.

MECHANISMS FOR TRUNCATING TENANT DATA
20230060733 · 2023-03-02 ·

Techniques are disclosed relating to truncating a tenant's data from a table. A database node may maintain a multi-tenant table having records for tenants. Maintaining the table may include writing a record for a tenant into an in-memory cache and performing a flush operation to flush the record to a shared storage. The database node may write a truncate record into the in-memory cache that truncates a tenant from the table such that records of the tenant having a timestamp indicating a time before the truncate record cannot be accessed as part of a record query. While the truncate record remains in the in-memory cache, the database node may receive a request to perform a record query for a key of the tenant, make a determination on whether a record was committed for the key after the truncate record was committed, and return a response based on the determination.