Sap Se

Friedrich Keller

Mihnea Andrei

Juchang Lee

Kyu Hwan Kim

Hyejeong Lee

Gerrit Graefe

Provided is a database system and method in which storage is partitioned in an unbalanced format for faster access. In one example, the method may include one or more of receiving a request to store a data record, identifying a partition from among a plurality of partitions of a database based on a shard identifier in the request, automatically determining a unique range of data identifiers designated to the partition from the plurality of partitions, respectively, based on an unbalanced partitioning, determining whether the data identifier is available within the unique range of data identifiers of the identified partition, and storing the data record at the identified partition in response to determining the data identifier is available. The unbalanced partitioning according to various embodiments reduces the partitions that need to be checked during a data insert/access operation of the database.

Unbalanced partitioning of database for application data

Implementations of the present disclosure include providing, at each node in a set of nodes of a database system, a table partition of a plurality of table partitions, the plurality of table partitions being provided by partitioning a table using a primary key, providing, at each node in the set of nodes of the database system, a secondary index partition of a plurality of secondary index partitions, each secondary index partition including a replicate table of at least a portion of the table, the plurality of secondary index partitions being provided by partitioning the table using one or more secondary keys, and for at least one operation executed on a table partition, executing a replication protocol to replicate the at least one operation on a secondary index partition that corresponds to the table partition.

Supporting scalable distributed secondary index using replication engine for high-performance distributed database systems

A method and a system for querying partitioned tables in a distributed database is disclosed. In one aspect, a method includes receiving a request to access multiple data elements, identified by record identifiers from a partitioned and distributed database table. The method further includes mapping record identifiers to partitions. The method further includes sorting the record identifiers by database node and partition. The method further includes generating, for each database node and partition, at least one statement including at least one request to access a data element stored in the corresponding partition. The method further includes responding to the request by routing the at least one statement generated for each database node and partition.

Querying partitioned tables in a distributed database

A method of modifying a database architecture to improve database performance is disclosed. A replication database table is generated from an original database table. The original database table is divided into a first plurality of partitions optimized for handling accesses for satisfying a first type of query. The replication database table is divided into a second plurality of partitions optimized for handling accesses for satisfying a second type of database query. Based on receiving the database query of the first type, the query of the first type is routed to one host of a plurality of hosts to satisfy the query, the one host hosting one of the first plurality of partitions; based on receiving the database query of the second type, the query is routed to the same or another host of the plurality of hosts to satisfy the query, the second host hosting one of the second plurality of partitions.

Growing community of inventors

Karlsruhe, Germany

Friedrich Keller