Sap Se

Santosh Vijayan

Sumanth Hegde

Ajalesh Puthenparambil Gopi

Veit Bolik

Naveen Kolli

Examples of partitioning a group of related database tables are provided herein. A database table in a group of related database tables can be designated as a lead database table. A partitioning field can also be determined by which database tables in the group are partitioned. A data load, with respect to the partitioning field, of the lead database table can be calculated. The data load can include a data distribution across different values of the partitioning field. A group partitioning scheme can be determined based on the data load of the lead database table. The database tables of the group can then be partitioned according to the group partitioning scheme.

Efficient partitioning of related database tables

Various embodiments of systems and methods of optimizing a database are described herein. Database tables are rated based on at least one of table size and table growth rate. One or more of the database tables are then selected based on the rating of the database tables. Archiving objects for the one or more selected tables are obtained. An archiving object includes one or more archiving programs and defines data related to a business object. The archiving objects are ranked based on dependencies between them. Based on the ranking of the archiving objects, an archiving schedule including an archiving order for the archiving objects is generated. The archiving schedule is then displayed.

Growing community of inventors

Bengaluru, India

Santosh Vijayan