Transient and Persistent Representation of a Unified Table Metadata Graph

• US 20160147445A1
• Filed: 11/25/2014
• Published: 05/26/2016
• Est. Priority Date: 11/25/2014
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Schreter, Ivan, Wein, David, Glebe, Thorsten
• Granted Patent: US 9,965,504 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2282 Tablespace storage structures; Management thereof
• CPC Class Codes: G06F 16/278 Data partitioning, e.g. horizontal or vertical partitioning

Abstract

Loading of table metadata into memory of an in-memory database is initiated. The table metadata is persisted across pages in a page chain. Thereafter, a plurality of metadata objects are materialized into memory that each include an object handle pinning an underlying persisted page in the page chain. The objects are populated with data from the underlying persisted pages. Subsequently, for one to many object relationships, a vector of object handles is generated that comprises a plurality of transient handles that each point to a different instance of a respective transient object. Alternatively, for one to one object relationships or many to one object relationships, an object handle to point to a respective linked object is generated. Related apparatus, systems, techniques and articles are also described.

Claims

1. A method comprising:

initiating loading of table metadata into memory of an in-memory database, the table metadata being persisted across pages in a page chain;

materializing a plurality of metadata objects into memory that each comprise an object handle pinning an underlying persisted page in the page chain; and

generating, for one to many object relationships, a vector of object handles that comprises a plurality of transient handles that each point to a different instance of a respective transient object;

or

generating, for one to one object relationships or many to one object relationships, an object handle to point to a respective linked object.

2. The method of claim 1, wherein the metadata objects are selected from a group consisting of:

table fragments, table metadata, dictionary objects, columns, column fragments, and the page chain.

3. The method of claim 1, wherein modifications to the table metadata are performed solely in the page chain.

4. The method of claim 1, wherein a first page in the page chain comprises a table descriptor characterizing a metadata tree stored within the page chain.

5. The method of claim 4, wherein the metadata tree is formed within the page chain using links which specify a portion of the associated page that corresponds to the object pointed to by one of the links or transient object handles.

6. The method of claim 5, wherein the table descriptor forms a root of a tree represented by links between objects, forming a linked chain sequentially linking each descriptor for 1:

n relationships or storing a single link for 1;

0 . . . 1 or n;

1 relationships.

7. The method of claim 1, wherein each page in the page chain is linked.

8. The method of claim 1, wherein the in-memory database is a column-oriented database that stores data tables as sections of columns.

9. The method of claim 1, wherein the table metadata describes a relational table.

10. The method of claim 1, wherein the initializing, materializing, populating and generating are implemented by at least one hardware data processor forming part of at least one computing device.

11. A non-transitory computer program product storing instructions which, when executed by at least one hardware data processor forming part of at least one computing device, result in operations comprising:

initiating loading of table metadata into memory of an in-memory database, the table metadata being persisted across pages in a page chain; and

materializing a plurality of metadata objects into memory that each comprise an object handle pinning an underlying persisted page in the page chain;

generating, for one to many object relationships, a vector of object handles that comprises a plurality of transient handles that each point to a different instance of a respective transient object;

or

generating, for one to one object relationships or many to one object relationships, an object handle to point to a respective linked object.

12. The computer program product of claim 11, wherein the metadata objects are selected from a group consisting of:

columns, column fragments, table fragments, table metadata, dictionary objects, and the page chain.

13. The computer program product of claim 11, wherein modifications to the table metadata are performed solely in the page chain.

14. The computer program product of claim 11, wherein a first page in the page chain comprises a table descriptor characterizing a metadata tree stored within the page chain.

15. The computer program product of claim 14, wherein the metadata tree is formed within the page chain using links which specify a portion of the associated page that corresponds to the object pointed to by one of the links or transient object handles.

16. The computer program product of claim 15, wherein the table descriptor forms a root of a tree represented by links between objects, forming a linked chain sequentially linking each descriptor for 1:

n relationships or storing a single link for 1;

0 . . . 1 or n;

1 relationships.

17. The computer program product of claim 11, wherein each page in the page chain is linked.

18. The computer program product of claim 11, wherein the in-memory database is a column-oriented database that stores data tables as sections of columns.

19. The computer program product of claim 11, wherein the table metadata is to generate a unified table.

20. A system comprising:

at least one hardware data processor; and

memory storing instructions which, when executed by the at least one hardware data processor, result in operations comprising;

initiating loading of table metadata into memory of an in-memory database, the table metadata being persisted across pages in a page chain;

materializing a plurality of metadata objects into memory that each comprise an object handle pinning an underlying persisted page in the page chain; and

generating, for one to many object relationships, a vector of object handles that comprises a plurality of transient handles that each point to a different instance of a respective transient object;

or

generating, for one to one object relationships or many to one object relationships, an object handle to point to a respective linked object.