Method for managing a relational database of the SQL type
AssigneeInfovista SA
InventorsSerge Adda, Olivier Chedru
Life of this patent
Estimating the term…
Abstract
A method is provided for managing a relational database of the SQL type for information technology and network infrastructure service information, including a method in which the following are created, in a system for managing a database of the MySQL type, a read-only data storage engine, and unmodifiable tables, for example of WORM, defined as “Write Once Read Many” type managed by the storage engine; each table includes a column of digital counting data called a “timestamp”; each table is partitioned by time intervals; partition files are grouped in subdirectories of a file system, these directories forming a tree structure, each node of which is uniquely identified from a timestamp.
Claims8
A system, including a computer processor, for managing a relational database of the SQL type for information technology and network infrastructure service information, said system comprising:
- a read-only data storage engine;
- unmodifiable tables managed by the storage engine;
- each table comprises a column of digital counting data called a “timestamp”;
- each table is partitioned by time intervals;
- partition files are grouped in subdirectories of a file system, the subdirectories forming a tree structure, each node of which is uniquely identified from a timestamp;
- and
- each partition file comprises a data file and at least one index file enclosing a perfect binary tree, and a bijective function called TreeOrder is used for generating said perfect binary tree and to write values of said perfect binary tree sequentially in the index file according to an existing order relationship between the values of the perfect binary tree, wherein TreeOrder provides a position of a node in the perfect binary tree section of the index file according to a rank of a value associated with the node;
- wherein TreeOrder is used for establishing the correspondence between each node of the perfect binary tree, the nodes being numbered from top to bottom and from left to right, and the values of the perfect binary tree when stored in a section of the index file;
- wherein a correspondence consists of providing a position of each node in the section of the index file according to the position of a corresponding value in a list established according to said order relationship and according to a cardinality of the list;
- and
- wherein when the perfect binary tree is incomplete and has a cardinality equal to C, the values of the incomplete perfect binary tree are classified with respect to a smallest complete perfect binary tree of cardinal N containing C nodes as follows:
- starting from a position TreeOrderN(i) in the complete perfect binary tree for an I<C, with I an index of the table, a position TreeOrderN(i) is determined in the incomplete perfect binary tree as follows:
- Let L=C*2−N, with N=2roundup(log2(c))−1
- If TreeOrderN(i)>L then
- TreeOrderc(i)=TreeOrderN(i)−(TreeOrderN(i)−L)/2
- Else
- TreeOrderc(i)=TreeOrderN(i).
Dependencies are inferred from the claim text.