| 主权项 |
1. A database performance estimation device for a database containing a tree-structured index block, comprising:
a processor; and an interface coupled to the processor; wherein the processor is configured to:
acquires configuration mode data for the index block from the interface, the data indicating any one of at least two configuration modes, and average number (m) of entries per block, an entry processing rime (a) indicating an average processing time per entry, a write ratio (w) indicating a ratio of an insert manipulation relative to all the manipulations of the tree-structured index block, a latency (L) concerning a storage medium storing the index block, and an average branch block height (h);calculate a searching time via at least two types of searching time calculation methods using the latency (L), the entry processing time (a), and the average number (m) of entries per block, wherein at least two searching methods related to the at least two configuration modes are supported;acquires, as a child block searching time (d) and a leaf block scanning time (s), an average time required for identifying a target entry in a block, the average time being calculated by switching the at least two types of searching time calculation methods according to the configuration mode data;calculate an entry insert (i) time via at least two types of inserting time calculation methods, wherein at least two entry inserting methods related to the at least two configuration modes are supported; wherein the at least two inserting time calculation methods include a calculation method using the latency (L) and the entry processing time (a), and a calculation method using the latency (L), the entry processing time (a), and the average number (m) of entries per block; acquires an entry inserting time (i) indicating an average time required for inserting a target entry in a leaf block by switching the at least two types of inserting time calculation methods according to the configuration mode data acquired by the data acquiring unit and performing the switched calculation method; and
calculates an average time required for identifying a target leaf block per one manipulation performed to the index block by multiplying the average branch block height (h) by the child block searching time (d);calculate an average time required for searching for a target entry in the identified leaf block per one manipulation performed to the index block using the leaf block scanning time (s) and the write ratio (w), andcalculates an average time required for inserting a target entry in the identified leaf block per one manipulation performed to the index block using the entry inserting time (i) and the write ratio (w), thereby estimating a total of the average times calculated as an average processing time per one manipulation performed to the index block. |
