WO2012117438A1 - Dispositif de gestion de base de données, procédé de gestion de base de données et système de base de données - Google Patents

Dispositif de gestion de base de données, procédé de gestion de base de données et système de base de données Download PDF

Info

Publication number
WO2012117438A1
WO2012117438A1 PCT/JP2011/001154 JP2011001154W WO2012117438A1 WO 2012117438 A1 WO2012117438 A1 WO 2012117438A1 JP 2011001154 W JP2011001154 W JP 2011001154W WO 2012117438 A1 WO2012117438 A1 WO 2012117438A1
Authority
WO
WIPO (PCT)
Prior art keywords
index
path
storage area
stored
priority
Prior art date
Application number
PCT/JP2011/001154
Other languages
English (en)
Japanese (ja)
Inventor
五十嵐和人
矢田部英次
千田理路
Original Assignee
株式会社日立製作所
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 株式会社日立製作所 filed Critical 株式会社日立製作所
Priority to PCT/JP2011/001154 priority Critical patent/WO2012117438A1/fr
Publication of WO2012117438A1 publication Critical patent/WO2012117438A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/80—Information retrieval; Database structures therefor; File system structures therefor of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML
    • G06F16/81—Indexing, e.g. XML tags; Data structures therefor; Storage structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/80—Information retrieval; Database structures therefor; File system structures therefor of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML
    • G06F16/83—Querying
    • G06F16/835—Query processing
    • G06F16/8373—Query execution

Definitions

  • the present invention relates to a database management apparatus, a database management method, and a database system, and is suitably applied to, for example, a database management apparatus, a database management method, and a database system for managing an XML (Extensible Markup Language) database.
  • XML Extensible Markup Language
  • XML database does not define an XML schema for an XML type column in a relational database (RDB: Relational Data Base), it can be stored in any well-formed XML document. Is possible.
  • RDB Relational Data Base
  • the database administrator changes the schema or query. It is required to reorganize the index according to the situation.
  • Patent Document 1 when redesigning an index, the priority to be tuned can be determined based on the execution frequency of the inquiry from the business program, and the index can be reorganized based on the determined priority.
  • Technology is disclosed.
  • the tuning priority is calculated based on the frequency of execution of the query. Therefore, even if the frequency of execution is low, the effect of tuning on a query with a long processing time is low. There was a problem.
  • the present invention has been made in view of the above points, and intends to propose a database management apparatus, a database management method, and a database system that can exhibit high performance while effectively using a limited storage area.
  • the data storage area when accessing data stored in a database area in response to a query statement from a business program, the data storage area is stored using an index stored in the index storage area.
  • a statistical information acquisition unit that acquires statistical information about a path of data stored in the database storage area, and an inquiry time for the path
  • a query time reduction amount calculation unit that calculates a query time reduction amount that can be reduced when the index is used based on the acquired query time, and an index for the path is created.
  • the created index is stored in the index storage area.
  • a storage area consumption calculating unit for calculating a storage area consumption consumed in the case of the storage, and a priority for a plurality of the data paths to be indexed based on the inquiry time reduction amount and the storage area consumption
  • a priority calculating unit that calculates a degree
  • an index deletion creating unit that creates an index of the path based on the priority.
  • the data storage area is searched using an index stored in the index storage area
  • a first step in which a statistical information acquisition unit acquires statistical information on a path of data stored in the database storage area;
  • a query time reduction amount calculation unit obtains a query time for the path from the statistical information, and calculates a query time reduction amount that can be reduced when the index is used based on the acquired query time.
  • the storage area consumption calculation unit calculates an index for the path.
  • the database management device is configured so that the storage device When accessing data stored in a database area, the storage area of the data is searched using an index stored in the index storage area of the storage device, and the data is accessed based on the search result
  • a database management device a statistical information acquisition unit that acquires statistical information about a path of data stored in the database storage area, and an inquiry time for the path is acquired from the statistical information, and the acquired inquiry time
  • reduction when using the index A query time reduction amount calculation unit that calculates a query time reduction amount that can be stored, and a storage that calculates an index for the path and calculates a storage area consumption amount that is consumed when the created index is stored in the index storage area
  • An area consumption calculation unit; a priority calculation unit that calculates a priority for a plurality of paths of the data to be indexed based on the inquiry time reduction amount and the storage area consumption;
  • the present invention it is possible to provide a database management apparatus, a database management method, and a database system that can exhibit high performance while effectively using a limited storage area.
  • FIG. 1 indicates an XML database system according to this embodiment as a whole.
  • the XML database system 1 is configured such that a terminal device 10 and a database management device 20 are connected via a network N, and a secondary storage device 30 is connected to the database management device 20.
  • the terminal device 10 is an information processing device used by a user for performing business, and includes information processing resources such as a processor 11, a memory 12, and a communication interface 13.
  • the memory 12 stores a business program 12A corresponding to the business content of the user who uses the terminal device 10, and a predetermined business process is executed when the processor 11 executes the business program 12A. Then, at the time of executing this business process, a query statement for acquiring necessary information from the XML database managed by the database management apparatus 20 is issued to the database management apparatus 20 via the communication interface 13.
  • the communication interface 13 is composed of, for example, a NIC (Network Interface Card) or the like, and performs protocol control during communication with the database management apparatus 20.
  • the database management device 20 is a computer device provided with information processing resources such as a communication interface 21, a processor 22, a memory 23, and a disk interface 24, and is composed of, for example, a personal computer, a workstation, or a large computer.
  • the memory 23 is a primary storage device mainly used for holding various control programs.
  • a query execution program 23A, a statistical information acquisition program 23B, a priority calculation program 23C, and an index deletion creation program 23D, which will be described later, are also stored and held in the memory 23.
  • the processor 22 executes the above-described various programs stored in the memory 23, the database management apparatus 20 as a whole performs various processes as described below.
  • the disk interface 24 is composed of an adapter that performs protocol control during communication with the secondary storage device 30.
  • the communication interface 21 has the same function as the communication interface 13 of the terminal device 10.
  • the secondary storage device 30 includes, for example, a single hard disk device or optical disk device, or a disk array device in which a plurality of hard disk devices or optical disk devices are mounted in an array.
  • the secondary storage device 30 stores a database area 31, statistical information 32, system information 33, an index storage area 34, index definition information 35, and a priority table 36.
  • the database area 31, statistical information 32, system information 33, index storage area 34, index definition information 35, and priority table 36 will be described later.
  • FIG. 2 shows a logical configuration related to database management of the database system 1.
  • the query execution unit 230A, the statistical information acquisition unit 230B, the priority calculation unit 230C, and the index deletion creation unit 230D are respectively executed by the processor 22 of the database management device 20 with the query execution program 23A stored in the memory 23, the statistics It represents a function that is exhibited by executing the information acquisition program 23B, the priority calculation program 23C, and the index deletion creation program 23D.
  • an index reorganization process (described later with reference to FIG. 10) is performed by the priority calculation unit 230C and the index deletion creation unit 230D.
  • An index reorganization unit 232 that executes is configured.
  • the inquiry execution unit 230A searches the requested information from the data stored in the database area 31 provided in the secondary storage device 30 in accordance with the inquiry sentence given from the business program 12A of the terminal device 10, and the search result is the business program. 12A is notified. Further, the query execution unit 230A transfers the query sentence given from the business program 12A to the statistical information acquisition unit 230B.
  • the statistical information acquisition unit 230B acquires predetermined information about the inquiry sentence every time the inquiry sentence is transferred from the inquiry execution unit 230A, and accumulates the information in the secondary storage device 30 as the statistical information 32.
  • the priority calculation unit 230C executes a priority calculation process (see FIG. 10) as described later at regular intervals set by the user, and a priority column in a priority table as described later (see FIG. 6). The priority of each path stored in is calculated.
  • the “priority” is a value calculated based on the query time reduction amount, storage area consumption, path usage frequency, and magnification stored in the priority table (see FIG. 6). In this form, indexes are created in descending order of priority.
  • the index deletion creation unit 230D executes an index deletion creation process (see FIG. 12) described later at regular intervals set by the user, creates indexes in descending order of priority, and deletes unnecessary indexes. To do.
  • a database area 31 is a storage area for storing data related to an inquiry from the terminal device 10.
  • the index storage area 34 is one or a plurality of storage areas for storing indexes created by the database management apparatus 20.
  • FIG. 3 shows statistical information 32 acquired each time an inquiry is given from the business program 12A of the terminal device 10 to the database management device 20.
  • the statistical information 32 includes a time column 32A, an inquiry statement column 32B, a used path name column 32C, an inquiry time column 32D, and a CPU time column 32E.
  • the used path name column 32C stores the path name of the path in the XML document used when searching for the query
  • the query time column 32D stores the time taken to access the data to be queried.
  • the CPU time column 32E stores the processing time of the processor 22.
  • FIG. 4 shows system information 33 for managing the index storage area 34 provided in the database system 1.
  • the system information 33 includes an index storage area name column 33A, a capacity column 33B, and a maximum magnification column 33C.
  • the index storage area name column 33A stores the name of the index storage area 34 (index storage area name)
  • the capacity column 33B stores the capacity of the index storage area 34
  • the maximum magnification column 33C stores A maximum magnification preset by the user is stored in the index storage area 34. Details of the maximum magnification will be described later.
  • FIG. 5 shows index definition information 35 for managing an index existing in the database system 1.
  • the index definition information 35 includes an index name field 35A and a path name field 35B as shown in FIG. 5, for example.
  • Each index name (index name) is stored in the index name column 35A, and the path name of the path indexed by the index is stored in the path name column 35B.
  • FIG. 6 shows a priority table 36 used for calculating and managing the priority of each path registered in the statistical information 32.
  • the priority table 36 includes a path name column 36A, an inquiry time reduction amount column 36B, a storage area consumption amount column 36C, a frequency column 36D, a magnification column 36E, and a priority column 36F.
  • the path name column 36A the path name of each path registered in the statistical information 32 is stored.
  • the query time reduction amount column 36B stores the query time reduction amount when the index is created relative to the query time when the corresponding path index is not created, and the storage area consumption amount column 36C corresponds.
  • the consumption amount of the index storage area 34 when the path index is created is stored.
  • the frequency column 36D stores the usage frequency of the corresponding path per unit time acquired from the statistical information 32
  • the magnification column 36E stores the magnification calculated for the corresponding path.
  • the priority column 36F stores the priority calculated for the corresponding path.
  • magnification is a value that defines how much the use frequency of a path is added to the priority when the priority is calculated, that is, a value indicating a ratio of the use frequency reflected in the priority.
  • the magnification is calculated, for example, as in the following formula (1).
  • the value of the maximum magnification stored in the maximum magnification column 33C of the system information 33 is substituted for “maximum magnification” in the above formula (1), and “max (frequency of all paths)” and “min (all paths)
  • the maximum value and the minimum value among the use frequencies of all paths stored in the frequency column 36D of the priority table 36 are respectively substituted for “ Further, when the usage frequencies of all paths are the same, that is, when the minimum value is subtracted from the maximum value of the usage frequencies of all paths, the magnification is set to “1”.
  • the priority is calculated using, for example, the following formula (2) using the magnification calculated by the formula (1).
  • (Equation 2) Priority f (frequency) ⁇ ⁇ (query time reduction amount) / (storage area consumption amount) ⁇ (2)
  • the “query time reduction amount” in the above equation (2) includes the query time reduction amount of the path whose priority is to be calculated among the query time reduction amounts stored in the query time reduction amount column 36B of the priority table 36. Is substituted. In addition, the storage area consumption of the path for which the priority is calculated among the storage area consumption stored in the storage area consumption column 36C of the priority table 36 is substituted into “storage area consumption”. The priority calculated by the above equation (2) is stored in the priority column 36F of the priority table 36.
  • the ratio of path usage frequency to be reflected in the priority that is, the response time request such as batch processing and OLTP (On-Line Transaction Processing) by allowing the database administrator to arbitrarily set the magnification. It is possible to correspond to different database systems.
  • FIG. 7 shows a creation index table 37 for temporarily managing indexes that can be created in the index storage area 34 based on the priority and the storage capacity of the index storage area 34 by the index deletion creation unit 230D.
  • the creation index table 37 shows a list of indexes that can be created, and is temporarily stored in the memory 23, for example.
  • the creation index table 37 includes a creation target path name column 37A, and the creation target path name column 37A stores a path name of a path for which an index is to be created.
  • FIG. 8 shows a configuration example of the index reorganization setting screen 30 displayed on a display screen (not shown) of the terminal device 10 or the database management device 20.
  • the database administrator can set items necessary for reorganizing the index managed by the database management apparatus 20.
  • the index reorganization setting screen 30 includes an index reorganization function setting field 31, a maximum magnification setting field 32, an index storage area capacity setting field 33, and a save button 34 as shown in FIG.
  • the index reorganization function setting field 31 is a field for the database administrator to specify whether to use the index reorganization function
  • the maximum magnification setting field 32 is an index to be reorganized. This is a field for the database administrator to specify the maximum magnification used for the calculation of the priority.
  • the index storage area capacity setting field 33 is a field for the database administrator to specify the storage capacity of the index to be reorganized
  • the save button 34 is the index reorganization function setting field 31, the maximum magnification setting field. 32 and a button for saving the setting designated by the database manager in the index storage area capacity setting field 33.
  • FIG. 9 shows a configuration example of the index reorganization result screen 40 displayed on a display screen (not shown) of the terminal device 10 or the database management device 20.
  • the database administrator can grasp the execution of the index reorganization process and the execution result by browsing the index reorganization setting screen 40.
  • the index reorganization result screen 40 includes an index reorganization process execution notification field 41, a path name field 42, a path status field 43, a reduction time field 44, and a total reduction time field 45, as shown in FIG. Is done.
  • the index reorganization process execution notification field 41 displays the time when the index reorganization process was executed and a notification that the index reorganization process was executed, and the path name field 42 shows the path name of the path reorganized by the index reorganization process. Is displayed.
  • the index reorganization process indicates whether the path has been newly created (new), the index has been deleted (deletion), or before or after the index reorganization process is executed. Also, the path status indicating whether the index exists (existing) is displayed.
  • the inquiry time reduced by the index reorganization process is displayed for each path. If the displayed reduction time is positive (for example, “100”), it indicates that the query time for the path has been reduced by the index reorganization process, and the displayed reduction time is negative (for example, “ ⁇ ” 10 ”) indicates that the inquiry time for the path has increased due to the index reorganization processing.
  • the reduction time displayed in the total reduction time field 45 is a value obtained by adding all the reduction times displayed in the reduction time field 44.
  • FIG. 10 shows a processing procedure of the priority calculation process executed by the processor 22 of the database management apparatus 20 in cooperation with various programs stored in the memory 23.
  • the processor 22 first displays the priorities shown in FIG. 10 in order to reorganize the index. Execute the calculation process.
  • the processor 22 acquires the statistical information 32 stored in the secondary storage device 30, refers to the acquired statistical information 32, and selects any path registered in the statistical information 32 (S1). ).
  • the processor 22 acquires the index definition information 35 stored in the secondary storage device 30, refers to the acquired index definition information 35 and the path selected in step S1, and indexes the path selected in step S1. It is determined whether or not there exists (S2).
  • the processor 22 determines that the current index exists in the selected path, and uses or does not use the index for the query time for the data specified by this path. Compare with. Specifically, the processor 22 subtracts the query time stored in the query time column 32D of the statistical information 32 from the query time when the index is not used (S3).
  • the processor 22 obtains a negative result in the determination at step S2, it determines that there is no index currently in the selected path, and the data to be specified by this path when the index is used.
  • the inquiry time for the data specified by this path when the index is not used, specifically, the inquiry time stored in the inquiry time column 32D of the statistical information 32 is subtracted from the inquiry time (S4).
  • the processor 22 calculates the index storage area length required when an index is created for this path (S5). Since the index storage area length is calculated by a conventional method, a description thereof is omitted here.
  • the processor 22 performs a magnification calculation process to determine how much the use frequency of the path used for the calculation of the priority is reflected in the calculation of the priority. Execute (S6).
  • magnification calculation process will be described later with reference to FIG. 11.
  • the above formula (1) is used, and the magnification of the path usage frequency to be reflected in the priority is calculated by this magnification calculation process.
  • the processor 22 calculates the priority using the magnification calculated in step S6, and registers the calculated priority in the priority column 36F of the priority table 36 stored in the secondary storage device 30 (S7).
  • the specific calculation method of the priority calculated here is as shown in the above equation (2). That is, the processor 22 refers to the priority table 36, divides the inquiry time reduction amount by the storage area consumption amount, and calculates the priority by multiplying the divided value by a magnification.
  • the processor 22 determines whether or not all paths registered in the statistical information 32 have been selected (S8).
  • step S1 If the processor 22 obtains a negative result in this determination, it returns to step S1, selects another path registered in the statistical information 32, and executes the processes of steps S1 to S8 described above. The processor 22 repeats the loop of steps S1 to S8 described above until all the paths registered in the statistical information 32 are selected.
  • FIG. 11 shows a processing procedure of a magnification calculation process executed by the processor 22 of the database management apparatus 20 in cooperation with various programs stored in the memory 23.
  • the processor 22 shifts to the magnification calculation process (S6) in the priority calculation process shown in FIG. 10, the processor 22 executes the magnification calculation process shown in FIG.
  • the processor 22 acquires the system information 33 stored in the secondary storage device 30, and refers to the acquired system information 33 to acquire the maximum magnification of the path that is the target of the magnification calculation processing (S61). ).
  • the processor 22 creates a function f (frequency) for calculating the magnification with the use frequency of the path as an input value (S62).
  • the function f (frequency) created here is, for example, the above formula (1), but is not limited to this, and a function that represents an approximate curve that passes through a plurality of (frequency, magnification) specified in advance by the database administrator. It may be created.
  • the processor 22 acquires the statistical information 32 stored in the secondary storage device 30, and refers to the acquired statistical information 32 to acquire the use frequency of the path that is the target of the magnification calculation process (S63). ).
  • the processor 22 inputs the use frequency of the path acquired in step S63 to the function created in step S62 (for example, the above equation (1)) as an input value, and calculates the magnification for the path (S64).
  • the processor 22 determines whether or not the usage frequencies of all the paths registered in the statistical information 32 have been acquired (S65).
  • step S63 acquires the use frequency for the path that has been registered in the statistical information 32 and has not yet acquired the use frequency, and calculates the magnification of the path. Note that the processor 22 repeats the above steps S63 to S65 until the use frequency of all the paths registered in the statistical information 32 is obtained.
  • the processor 22 obtains a positive result in the determination at step S65, it ends this magnification calculation process.
  • FIG. 12 shows a processing procedure of index deletion creation processing executed by the processor 22 of the database management apparatus 20 in cooperation with various programs stored in the memory 23.
  • the processor 22 performs the process shown in FIGS. 10 and 11 described above to reorganize the index. After executing the processing shown, the index deletion creation processing shown in FIG. 12 is executed.
  • the processor 22 acquires the priority table 36 stored in the secondary storage device 30, and selects a path registered in the priority table 36 in descending order of priority (S11).
  • the processor 22 determines whether or not an index including the selected path with the highest priority can be created in the index storage area 34 (S12).
  • the processor 22 determines that an index can be created in the index storage area 34 when there is sufficient storage area in the secondary storage device 30, and determines that creation is impossible when the storage area is insufficient. To do.
  • the processor 22 When the processor 22 obtains a positive result in this determination, it registers this high priority path in the creation index table 37 (S13).
  • step S12 the process proceeds to step S14.
  • the processor 22 determines whether or not all paths registered in the priority table 36 have been selected (S14).
  • processor 22 If the processor 22 obtains a negative result in this determination, it returns to step S11 and selects another path with a higher priority. Then, the processor 22 repeats the processes of steps S11 to S14 until all the paths registered in the priority table 36 are selected.
  • the processor 22 obtains a positive result in the determination at step S ⁇ b> 14, it acquires the index definition information 35 stored in the secondary storage device 30 and is registered in the acquired index definition information 35. Is selected (S15).
  • the processor 22 determines whether or not the selected path is included in the creation index table 37 (S16).
  • the processor 22 obtains a negative result in this determination, it determines that the priority of the index previously defined and managed by the index definition information 35 is low, and this index does not need to be defined as it is.
  • the index is deleted from the index definition information 35 (S17).
  • step S16 when the processor 22 obtains a positive result in the determination in step S16, the priority of the index that has been defined and managed by the index is high, and it is determined that the index needs to be defined as it is. The process proceeds to step S18 while leaving this index without being deleted from the index definition information 35.
  • the processor 22 determines whether or not all paths registered in the index definition information 35 have been selected (S18).
  • the processor 22 If the processor 22 obtains a negative result in this determination, it returns to step S15 and selects another path registered in the index definition information 35. Then, the processor 22 repeats the processes of steps S15 to S18 until all the paths registered in the index definition information 35 are selected.
  • the processor 22 obtains a positive result in the determination at step S18, it selects any path registered in the created index table 37 (S19).
  • the processor 22 determines whether or not the selected path is included in the creation index table 37 (S20).
  • the processor 22 determines that the index to be defined and managed by the index definition information 35 is not defined in the current index definition information 35, and the index of the path selected in step S19. Is created (S21). When the processor 22 newly creates an index, the created index is defined by the index definition information 35 and managed.
  • the processor 22 obtains a positive result in the determination at step S20, it determines that the index to be defined and managed by the index definition information 35 is already defined and managed by the current index definition information 35. Then, the process proceeds to step S22.
  • the processor 22 determines whether all paths registered in the created index table 37 have been selected (S22).
  • processor 22 If the processor 22 obtains a negative result in this determination, it returns to step S19 and selects another path registered in the created index table 37. The processor 22 repeats the processing from step S19 to S22 until all the paths registered in the created index table 37 are selected.
  • the processor 22 obtains a positive result in the determination at step S22, it determines that indexes have been created for all paths registered in the created index table 37, and performs this index deletion creation process. finish.
  • the processor 22 executes the above-described various processes shown in FIGS. 10 to 12.
  • a control unit that integrates the functions of the processor 22 on one chip performs various processes. May be executed.
  • the control unit acquires a function as the statistical information acquisition unit 230B that acquires the statistical information 32 regarding the path of the data stored in the database storage area 31, the query time for the path from the statistical information 32, A function as a query time reduction amount calculation unit that calculates a query time reduction amount that can be reduced when an index is used based on the query time created, an index for the path is created, and the created index is stored in the index storage area 34
  • Priority for multiple data paths to be indexed based on the function of the storage area consumption calculation unit that calculates the consumption of storage area consumed when stored, query time reduction, and storage area consumption
  • a function as an index deletion creating section 230D to create the index.
  • the creation of the index is periodically executed at an appropriate timing after the save button 34 on the index reorganization setting screen 30 is pressed. It may be executed substantially simultaneously with being pressed. In this case, the database administrator can explicitly instruct the creation timing of the index.
  • the creation of the index may be executed with the timing when the storage capacity of the index storage area 34 is changed. In this case, if the storage capacity of the index storage area 34 is increased, an index with a low priority can be newly created and stored, and the query time can be reduced extensively. On the other hand, if the storage capacity of the index storage area 34 is reduced, an index having a low priority can be deleted to effectively use the storage area.
  • the creation of the index may be executed when the date or time specified in advance by the database administrator has passed. In this case, it is not necessary to press the save button 34 on the index reorganization setting screen 30 each time an index is to be created, and the convenience of the database administrator can be improved. In addition, it is possible to prevent the index from being reorganized over a long period of time.
  • the creation of the index may be executed when any of the inquiry times stored in the inquiry time column 32D of the statistical information 32 exceeds a predetermined threshold. In this case, it is possible to prevent a situation in which the inquiry time is extremely slow from continuing.
  • the storage capacity of the index storage area is specified by the database administrator in the index storage area capacity setting field 33 of the index reorganization setting screen 30. However, even if the ratio of the storage capacity is specified, not the storage capacity. Good. In this case, a storage area for a newly created index can be secured.
  • a value obtained by subtracting a free area specified in advance by the database administrator may be used as the actual index storage area on the assumption that a new index will be created later. Also in this case, a storage area for a newly created index can be secured.
  • the present invention can be widely applied to database management apparatuses having various configurations equipped with a management function for managing an XML database.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention porte sur un dispositif de gestion de base de données par lequel il est possible, lors d'un accès à des données conformément à une interrogation de programme de travail, lesdites données étant stockées dans une région de base de données, de raccourcir un temps nécessaire pour accéder aux données par utilisation d'un index qui est stocké dans une région de stockage d'index. Le dispositif de gestion de données comprend une unité de commande qui, lors de la création de l'index, calcule, sur la base du degré par lequel le temps d'accès peut être raccourci par utilisation de l'index et de la capacité de stockage de la région de stockage d'index qui est consommée par la création de l'index, des priorités pour une pluralité de trajets des données pour lesquelles des index peuvent être créés, et crée uniquement l'index des trajets sur la base des priorités calculées.
PCT/JP2011/001154 2011-02-28 2011-02-28 Dispositif de gestion de base de données, procédé de gestion de base de données et système de base de données WO2012117438A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2011/001154 WO2012117438A1 (fr) 2011-02-28 2011-02-28 Dispositif de gestion de base de données, procédé de gestion de base de données et système de base de données

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2011/001154 WO2012117438A1 (fr) 2011-02-28 2011-02-28 Dispositif de gestion de base de données, procédé de gestion de base de données et système de base de données

Publications (1)

Publication Number Publication Date
WO2012117438A1 true WO2012117438A1 (fr) 2012-09-07

Family

ID=46757414

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2011/001154 WO2012117438A1 (fr) 2011-02-28 2011-02-28 Dispositif de gestion de base de données, procédé de gestion de base de données et système de base de données

Country Status (1)

Country Link
WO (1) WO2012117438A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2016177691A (ja) * 2015-03-20 2016-10-06 富士通フロンテック株式会社 データ処理プログラム、データ処理方法および情報処理装置
CN113569508A (zh) * 2021-09-18 2021-10-29 芯行纪科技有限公司 基于id进行数据索引与访问的数据库模型构建方法及设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04310144A (ja) * 1991-04-09 1992-11-02 Shikoku Nippon Denki Software Kk データベースシステム
JP2008204141A (ja) * 2007-02-20 2008-09-04 Nec Corp インデックス構成提案システムおよび方法ならびにデータ解析装置およびプログラム
JP2009245351A (ja) * 2008-03-31 2009-10-22 Nomura Research Institute Ltd 情報処理システムおよび情報処理方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04310144A (ja) * 1991-04-09 1992-11-02 Shikoku Nippon Denki Software Kk データベースシステム
JP2008204141A (ja) * 2007-02-20 2008-09-04 Nec Corp インデックス構成提案システムおよび方法ならびにデータ解析装置およびプログラム
JP2009245351A (ja) * 2008-03-31 2009-10-22 Nomura Research Institute Ltd 情報処理システムおよび情報処理方法

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2016177691A (ja) * 2015-03-20 2016-10-06 富士通フロンテック株式会社 データ処理プログラム、データ処理方法および情報処理装置
CN113569508A (zh) * 2021-09-18 2021-10-29 芯行纪科技有限公司 基于id进行数据索引与访问的数据库模型构建方法及设备
CN113569508B (zh) * 2021-09-18 2021-12-10 芯行纪科技有限公司 基于id进行数据索引与访问的数据库模型构建方法及设备
US11500828B1 (en) 2021-09-18 2022-11-15 X-Times Design Automation Co., LTD Method and device for constructing database model with ID-based data indexing-enabled data accessing

Similar Documents

Publication Publication Date Title
US7814072B2 (en) Management of database statistics
EP3748515B1 (fr) Placement des données et gestion du cycle de vie d'informations prédéterminés par politiques
US8380702B2 (en) Loading an index with minimal effect on availability of applications using the corresponding table
EP2811792B1 (fr) Procédé pour faire fonctionner un dispositif de télécommunication mobile
US20140280280A1 (en) Estimating error propagation for database optimizers
US10452629B2 (en) Automatic maintenance of a set of indexes with different currency characteristics in a database management system
US8380703B2 (en) Feedback loop between a query optimizer and a cache manager
US20110055201A1 (en) System, method, and computer-readable medium for automatic index creation to improve the performance of frequently executed queries in a database system
EP2849089A1 (fr) Mécanisme d'indexation de table virtuelle et méthode capable de réaliser une requête conditionnelle composée multi-attribut
US20090204566A1 (en) Processing of Deterministic User-Defined Functions Using Multiple Corresponding Hash Tables
US9734176B2 (en) Index merge ordering
US9785695B2 (en) Providing multiple concurrent transactions on a single database schema using a single concurrent transaction database infrastructure
US20210263930A1 (en) Partial group by for eager group by placement query plans
KR20150098660A (ko) 활성 데이터베이스 쿼리의 유지
CN110807145A (zh) 查询引擎获取方法、设备和计算机可读存储介质
US11249962B2 (en) Column loadable and page loadable load unit recommendation system
WO2012117438A1 (fr) Dispositif de gestion de base de données, procédé de gestion de base de données et système de base de données
US20140258216A1 (en) Management of searches in a database system
US8161054B2 (en) Dynamic paging model
Suganya et al. Efficient fragmentation and allocation in distributed databases
CN103353891B (zh) 数据库管理系统及其数据处理方法
US7974955B2 (en) Inhibiting non-critical access based on measured performance in a database system
Arnaut et al. Phoenix: A relational storage component for the cloud
US11868261B2 (en) Prediction of buffer pool size for transaction processing workloads
CN111538713B (zh) 面向Hive的多模式数据处理方法、装置及电子设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11859970

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11859970

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP