WO2018070011A1 - Job specification program, job specification method and job specification device - Google Patents

Job specification program, job specification method and job specification device Download PDF

Info

Publication number
WO2018070011A1
WO2018070011A1 PCT/JP2016/080358 JP2016080358W WO2018070011A1 WO 2018070011 A1 WO2018070011 A1 WO 2018070011A1 JP 2016080358 W JP2016080358 W JP 2016080358W WO 2018070011 A1 WO2018070011 A1 WO 2018070011A1
Authority
WO
WIPO (PCT)
Prior art keywords
query
access method
job
search
online
Prior art date
Application number
PCT/JP2016/080358
Other languages
French (fr)
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/JP2016/080358 priority Critical patent/WO2018070011A1/en
Publication of WO2018070011A1 publication Critical patent/WO2018070011A1/en

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor

Definitions

  • the present invention relates to a job specifying program, a job specifying method, and a job specifying apparatus.
  • Businesses that use the database include online business, nighttime batch business, and online batch business.
  • FIG. 7 is a diagram for explaining the online business, the nighttime batch business, and the online batch business.
  • the online business is a business that is executed as an online job by a computer during business hours from 9 o'clock to 17 o'clock, for example. This is the job that requires the most performance. The amount of data handled in online operations is small.
  • a bank online system such as deposit withdrawal.
  • the nighttime batch job is a job that is executed as a nighttime batch job by a computer outside the business hours such as nighttime, and is a job that requires stable processing rather than performance.
  • the amount of data handled in nighttime batch operations is large. Examples of nighttime batch operations include aggregation processing and backup processing.
  • the online batch job is a job that is executed as an online batch job by the computer in parallel with the online job for information analysis of the online job, and is a job that requires higher performance than the night batch job.
  • the amount of data handled in online batch operations varies from small to large.
  • online batch operations there is a task of counting sales in the morning in order to determine time sale products in a supermarket. Since sales in the morning may fluctuate, the amount of data for summing up sales in the morning varies from small to large.
  • FIG. 8 is a diagram for explaining index search.
  • the TBL # 1 tuple is composed of an ID, a name, and an affiliation, and the ID is used as an index.
  • index values are searched using a tree structure, and a table is accessed based on position information associated with the searched index values.
  • the all table search the tuples in the table are searched one by one.
  • FIG. 9 is a diagram showing the relationship between business and database access methods. As shown in FIG. 9, in online work, since the amount of data is small to medium, index search is used. In the night batch operation, since the amount of data is large, a table all-case search is used.
  • index search is used when the amount of data is small to medium
  • full table search is used when the amount of data is large.
  • the database access method changes when the amount of data changes from small to medium.
  • JP 2012-150733 A Japanese Patent Laying-Open No. 2015-141574 JP-A-5-225132
  • the database access method can be changed from index search to full table search to increase the speed.
  • the performance deteriorates due to an increase in the data amount. Therefore, a parallel search is performed in order to speed up the search of all the tables.
  • FIG. 10 is a diagram for explaining a parallel search in the all table search.
  • IDX represents an index
  • TBL represents a table.
  • the processing amount is small and the processing time by the index search is small at the normal time when the data amount is small to medium.
  • the processing time for searching all the tables becomes longer, although it is shorter than the processing time for index searching. For this reason, speeding up of the whole table search is performed using parallel search.
  • the database query is a query for online batch operations and the database access It is necessary to identify that the method has changed. For this reason, the access method is stored as management information for each query.
  • FIG. 11 is a diagram showing an example of management information.
  • DBMS Data Base Management System
  • the present invention aims to reduce the amount of main memory used for storing management information.
  • the job identification program causes the computer to execute the following processing. That is, the job specifying program causes the computer to execute a process of extracting a query related to the online batch job based on connection time information related to the connection time from a query that makes a search request to the database management system. . Then, the job specifying program causes the computer to execute processing for accumulating information of the query when the access method to the extracted query database is an appropriate access method when the amount of data is small. The job specifying program causes the computer to execute processing for specifying a query of an online batch job whose access method has been changed based on the accumulated information.
  • the amount of main memory used to store management information can be reduced.
  • FIG. 1 is a diagram illustrating a functional configuration of the DBMS according to the embodiment.
  • FIG. 2 is a diagram for explaining a method for specifying a query that is an online batch query and whose access method has changed from index search to full table search.
  • FIG. 3 is a diagram illustrating an example of the management information storage unit.
  • FIG. 4 is a diagram for explaining parallel search control.
  • FIG. 5 is a flowchart showing a flow of processing for creating and executing a query execution plan.
  • FIG. 6 is a diagram illustrating a hardware configuration of a computer that executes the execution planning program according to the embodiment.
  • FIG. 7 is a diagram for explaining the online business, the nighttime batch business, and the online batch business.
  • FIG. 8 is a diagram for explaining the index search.
  • FIG. 9 is a diagram illustrating a relationship between a business and a database access method.
  • FIG. 10 is a diagram for explaining parallel search in the table all-case search.
  • FIG. 11 is a
  • FIG. 1 is a diagram illustrating a functional configuration of the DBMS according to the embodiment.
  • the DBMS 1 according to the embodiment includes a syntax analysis unit 11, an analysis unit 12, a rewrite unit 13, an execution plan unit 14, a management information storage unit 15, an execution unit 16, and a DB 20.
  • the syntax analysis unit 11 analyzes a query character string and performs query syntax analysis.
  • the analysis unit 12 checks the presence of a table used in the query and acquires information for processing the query.
  • the rewrite unit 13 rewrites the query including processing such as view.
  • the execution plan unit 14 creates an optimal execution plan for processing the query. Further, the execution planning unit 14 uses the management information storage unit 15 to identify a query that is an online batch job and whose access method has changed from index search to full table search. That is, the execution planning unit 14 specifies that the job that issued the query is an online batch job, and the query access method has changed from index search to full table search.
  • FIG. 2 is a diagram for explaining a method for specifying a query that is an online batch job query and whose access method has changed from an index search to an all-table search.
  • the execution planning unit 14 determines whether the query is an online business query or an online batch business query using the connection time (t1).
  • the execution plan unit 14 determines that the query is an online business or online batch business query when connection start time + 40 seconds ⁇ query start time. Note that 40 seconds is an example, and other values may be used.
  • the execution plan unit 14 uses the table statistical information to determine whether the query is a query that requires parallel search, that is, a query for online batch operations (t2). Specifically, the execution planning unit 14 determines whether the query is an online batch job by determining whether the table size is 10 GB (gigabytes) or more based on the number of blocks in the table. Determine.
  • the execution plan unit 14 determines whether or not the current method is non-parallel, that is, the access method of the newly executed query is a full table search, and the access method of the newly executed query is the index search. It is determined using the management information storage unit 15 whether or not there is (t3).
  • the management information storage unit 15 stores a query for which an index search has been performed among queries for online batch operations.
  • the management information storage unit 15 is provided in the main memory.
  • FIG. 3 is a diagram illustrating an example of the management information storage unit 15. As shown in FIG. 3, the management information storage unit 15 stores the query content and priority information as management information.
  • the priority information indicates a priority execution right that is given to a query that is an online batch transaction and whose access method has changed from index search to full table search, and is executed preferentially for ad hoc queries.
  • the right to Here, an ad hoc query is a query used on an ad hoc basis.
  • the priority information is set to “1” by the execution planning unit 14.
  • the execution plan unit 14 includes an extraction unit 14a, a storage unit 14b, and a specification unit 14c.
  • the extraction unit 14a extracts a query for online batch jobs using the connection time and the table size.
  • the accumulating unit 14b accumulates, in the management information storage unit 15, information on a query that has been index-searched among the queries extracted by the extracting unit 14a.
  • the specifying unit 14c refers to the management information storage unit 15 and specifies a query whose access method has changed from index search to full table search.
  • the execution unit 16 executes a query based on the execution plan.
  • the execution unit 16 controls the parallel processing so that it is executed preferentially with respect to the query to which the priority execution right is given.
  • the DB 20 stores a table. A search is performed on the table stored in the DB 20.
  • FIG. 4 is a diagram for explaining parallel search control.
  • the parallel processing framework indicates that n parallel search workers # 1 to #n parallel search workers #n perform searches in parallel.
  • online batch transaction queries are processed in parallel by parallel search worker # 1 to parallel search worker #n when the access method changes from index search to full table search.
  • parallel search worker # 1 to parallel search worker #n are returned, The ad hoc query is processed in non-parallel. Then, the parallel search worker # 1 to the parallel search worker #n are assigned to the online batch job query, and the online batch job query is preferentially executed.
  • FIG. 5 is a flowchart showing a flow of processing for creating and executing a query execution plan.
  • the execution plan unit 14 creates an execution plan for the target query (step S1).
  • the target query is a query requested to be processed.
  • the execution planning unit 14 determines whether or not the target query corresponds to an online job or an online batch job (step S2).
  • the unit 16 executes the target query (step S7).
  • the execution planning unit 14 determines whether the size of the table to be accessed by the target query is 10 GB or more (step S3). As a result, when the size of the table to be accessed by the target query is not 10 GB or more, since the target query is not an online batch job query, the execution unit 16 executes the target query (step S7).
  • the execution plan unit 14 stores information on the target query in the management information storage unit 15. It is determined whether or not there is (step S4).
  • the execution plan unit 14 determines that the current access method of the target query is a full table search. It is determined whether or not there is (step S5). As a result, if the current access method of the target query is not a full table search, the index search is still being performed, so the execution unit 16 executes the target query (step S7).
  • the execution planning unit 14 performs parallel search on the target query.
  • a priority execution right is granted (step S6), and the priority execution right is set in the priority information of the management information storage unit 15. Then, the execution unit 16 executes the target query (step S7).
  • the execution plan unit 14 determines whether or not the access method of the target query is an index search (step S8). As a result, when the access method of the target query is not index search, the execution unit 16 executes the target query (step S7).
  • the execution plan unit 14 stores the information of the target query in the management information storage unit 15 (step S9), and the execution unit 16 executes the target query. (Step S7).
  • the target query is an online batch business query and the access method is a query in which the access method is changed from the index search to the all-table search
  • the priority execution right of the parallel search is executed. Is granted. Therefore, the DBMS 1 can suppress performance degradation when the data amount of online batch operations increases and the access method is changed from index search to full table search.
  • the execution planning unit 14 extracts a query related to the online batch job based on the connection time information related to the connection time. Then, when the access method of the extracted query is an index search, the execution plan unit 14 accumulates information on the query in the management information storage unit 15. Then, the execution planning unit 14 identifies a query for an online batch job whose access method has been changed from an index search to a full table search based on the accumulated information.
  • the DBMS 1 can limit the query for storing information in the management information storage unit 15 to a query for an online batch job and for which an index search has been performed.
  • the thickness can be reduced. For this reason, the usage amount of the main memory can be suppressed.
  • the number of queries including online business and online batch business is 5000
  • the ratio of online batch business queries is 1%
  • the number is 50
  • the number of ad hoc queries is 500
  • the number of connections is 1000.
  • the size of a conventional storage area that stores information in which an access method is added to the query contents and the size of a storage area that stores information in which priority information is added to the query contents are set to 70 bytes.
  • 70 ⁇ 50 queries ⁇ 1000 connections 3.5 MB. .
  • the execution planning unit 14 further extracts a query related to the online batch operation based on the size of the table accessed by the query. Therefore, the execution planning unit 14 can accurately extract queries related to online batch operations.
  • connection time information includes the connection start time and the query start time
  • the execution planning unit 14 can accurately extract queries related to the online business and the online batch business.
  • FIG. 6 is a diagram illustrating a hardware configuration of a computer that executes the execution plan program according to the embodiment.
  • the computer 50 includes a main memory 51, a CPU 52, a LAN (Local Area Network) interface 53, and an HDD (Hard Disk Drive) 54.
  • the computer 50 includes a super IO (Input Output) 55, a DVI (Digital Visual Interface) 56, and an ODD (Optical Disk Drive) 57.
  • the main memory 51 is a memory for storing a program and a program execution result.
  • the management information storage unit 15 illustrated in FIG. 1 is provided in the main memory 51.
  • the CPU 52 is a central processing unit that reads a program from the main memory 51 and executes it.
  • the CPU 52 includes a chip set having a memory controller.
  • the LAN interface 53 is an interface for connecting the computer 50 to another computer via a LAN.
  • the HDD 54 is a disk device that stores programs and data.
  • the DB 20 illustrated in FIG. 1 is provided in the HDD 54.
  • the super IO 55 is an interface for connecting an input device such as a mouse or a keyboard.
  • the DVI 56 is an interface for connecting a liquid crystal display device, and the ODD 57 is a device for reading / writing a DVD.
  • the LAN interface 53 is connected to the CPU 52 by PCI Express (PCIe), and the HDD 54 and ODD 57 are connected to the CPU 52 by SATA (Serial Advanced Technology Attachment).
  • the super IO 55 is connected to the CPU 52 by LPC (Low Pin Count).
  • the execution plan program executed in the computer 50 is stored in the DVD, read from the DVD by the ODD 57, and installed in the computer 50.
  • the execution plan program is stored in a database or the like of another computer system connected via the LAN interface 53, read from these databases, and installed in the computer 50.
  • the installed execution plan program is stored in the HDD 54, read into the main memory 51, and executed by the CPU 52.

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)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

An execution plan unit (14) extracts, on the basis of connection time information associated with a connection time, a query associated with an online batch task. In addition, if an access method of the extracted query is an index search, the execution plan unit (14) accumulates information of the query in a management information storage unit (15). In addition, the execution plan unit (14) specifies, on the basis of accumulated information, a query of an online batch task for which the access method has been changed from an index search to a table all cases search.

Description

ジョブ特定プログラム、ジョブ特定方法及びジョブ特定装置Job identification program, job identification method, and job identification apparatus
 本発明は、ジョブ特定プログラム、ジョブ特定方法及びジョブ特定装置に関する。 The present invention relates to a job specifying program, a job specifying method, and a job specifying apparatus.
 データベースを利用する業務には、オンライン業務、夜間バッチ業務及びオンライン中バッチ業務がある。図7は、オンライン業務、夜間バッチ業務及びオンライン中バッチ業務を説明するための図である。 Businesses that use the database include online business, nighttime batch business, and online batch business. FIG. 7 is a diagram for explaining the online business, the nighttime batch business, and the online batch business.
 図7に示すように、オンライン業務は、例えば9時から17時の業務時間にコンピュータによりオンラインジョブとして実行される業務であり、顧客がダイレクトに操作し、レスポンスを直観するため、3つの業務の中で最も性能が求められる業務である。オンライン業務で扱うデータの量は小量である。オンライン業務の例として、預金の払い出し等の銀行オンラインシステムがある。 As shown in FIG. 7, the online business is a business that is executed as an online job by a computer during business hours from 9 o'clock to 17 o'clock, for example. This is the job that requires the most performance. The amount of data handled in online operations is small. As an example of online business, there is a bank online system such as deposit withdrawal.
 夜間バッチ業務は、夜間等の業務時間外にコンピュータにより夜間バッチジョブとして実行される業務であり、性能よりは安定した処理が求められる業務である。夜間バッチ業務で扱うデータの量は大量である。夜間バッチ業務の例として、集計処理、バックアップ処理等がある。 The nighttime batch job is a job that is executed as a nighttime batch job by a computer outside the business hours such as nighttime, and is a job that requires stable processing rather than performance. The amount of data handled in nighttime batch operations is large. Examples of nighttime batch operations include aggregation processing and backup processing.
 オンライン中バッチ業務は、オンライン業務の情報分析等のため、オンライン業務と並行してコンピュータによりオンラインバッチジョブとして実行される業務であり、夜間バッチ業務と比較して高い性能が求められる業務である。 The online batch job is a job that is executed as an online batch job by the computer in parallel with the online job for information analysis of the online job, and is a job that requires higher performance than the night batch job.
 オンライン中バッチ業務で扱うデータの量は小量から大量まで変化する。オンライン中バッチ業務の例として、スーパーマーケットにおいて、タイムセールの商品を決定するために午前中の売り上げを集計する業務がある。午前中の売り上げは変動することがあるため、午前中の売り上げを集計する際のデータ量は、小量から大量まで変化する。 ∙ The amount of data handled in online batch operations varies from small to large. As an example of online batch operations, there is a task of counting sales in the morning in order to determine time sale products in a supermarket. Since sales in the morning may fluctuate, the amount of data for summing up sales in the morning varies from small to large.
 データベース管理システムでは、データの量が小量~中量である場合には、インデックス検索が用いられ、データの量が大量である場合には、テーブル全件検索が用いられる。その理由は、データの量が大量になると、インデックス検索よりテーブル全件検索が速くなるためである。 In the database management system, when the amount of data is small to medium, index search is used, and when the amount of data is large, all table search is used. The reason is that when the amount of data becomes large, the whole table search becomes faster than the index search.
 図8は、インデックス検索を説明するための図である。図8では、TBL#1のタップルはIDと名前と所属から構成され、IDがインデックスとして用いられる。図8に示すように、インデックス検索では、インデックスの値がツリー構造を用いて検索され、検索されたインデックスの値に対応付けられた位置情報に基づいてテーブルがアクセスされる。一方、テーブル全件検索では、テーブル内のタップルが1件ずつ検索される。 FIG. 8 is a diagram for explaining index search. In FIG. 8, the TBL # 1 tuple is composed of an ID, a name, and an affiliation, and the ID is used as an index. As shown in FIG. 8, in an index search, index values are searched using a tree structure, and a table is accessed based on position information associated with the searched index values. On the other hand, in the all table search, the tuples in the table are searched one by one.
 図9は、業務とデータベースアクセス方法の関係を示す図である。図9に示すように、オンライン業務では、データ量が小量~中量であるため、インデックス検索が用いられる。夜間バッチ業務では、データ量が大量であるため、テーブル全件検索が用いられる。 FIG. 9 is a diagram showing the relationship between business and database access methods. As shown in FIG. 9, in online work, since the amount of data is small to medium, index search is used. In the night batch operation, since the amount of data is large, a table all-case search is used.
 オンライン中バッチ業務では、データ量が小量~中量である場合には、インデックス検索が用いられ、データ量が大量の場合には、テーブル全件検索が用いられる。すなわち、オンライン中バッチ業務では、データ量が小量~中量から大量に変化すると、データベースへのアクセス方法が変化する。 In online batch operations, index search is used when the amount of data is small to medium, and full table search is used when the amount of data is large. In other words, in online batch operations, the database access method changes when the amount of data changes from small to medium.
特開2012-150733号公報JP 2012-150733 A 特開2015-141574号公報Japanese Patent Laying-Open No. 2015-141574 特開平5-225132号公報JP-A-5-225132
 オンライン中バッチ業務では、データ量が小量~中量から大量に変化すると、データベースへのアクセス方法をインデックス検索からテーブル全件検索に変化させて高速化が図られる。しかしながら、アクセス方法をテーブル全件検索に変化させてもデータ量の増加により性能は劣化する。そこで、テーブル全件検索の高速化のため、並列検索が行われる。 In online batch operations, if the data volume changes from small to medium, the database access method can be changed from index search to full table search to increase the speed. However, even if the access method is changed to all table search, the performance deteriorates due to an increase in the data amount. Therefore, a parallel search is performed in order to speed up the search of all the tables.
 図10は、テーブル全件検索における並列検索を説明するための図である。図10において、IDXはインデックスを表し、TBLはテーブルを表す。図10に示すように、オンライン中バッチ業務において、データ量が小量~中量である通常時には、処理量は小さく、インデックス検索による処理時間は小さい。しかしながら、データ量増加時には、インデックス検索による処理時間よりは小さいが、テーブル全件検索による処理時間は大きくなる。このため、並列検索を利用してテーブル全件検索の高速化が行われる。 FIG. 10 is a diagram for explaining a parallel search in the all table search. In FIG. 10, IDX represents an index, and TBL represents a table. As shown in FIG. 10, in the online batch operation, the processing amount is small and the processing time by the index search is small at the normal time when the data amount is small to medium. However, when the amount of data increases, the processing time for searching all the tables becomes longer, although it is shorter than the processing time for index searching. For this reason, speeding up of the whole table search is performed using parallel search.
 データ量が増加したオンライン中バッチ業務に対して並列検索を利用してテーブル全件検索を高速化するためには、データベースへのクエリがオンライン中バッチ業務のクエリであり、かつ、データベースへのアクセス手法が変化したことを特定する必要がある。このため、クエリ毎にアクセス手法を管理情報として記憶することが行われる。 In order to speed up the whole table search by using parallel search for online batch operations where the amount of data has increased, the database query is a query for online batch operations and the database access It is necessary to identify that the method has changed. For this reason, the access method is stored as management information for each query.
 図11は、管理情報の一例を示す図である。図11に示すように、管理情報は、クエリ内容とアクセス手法をクエリ毎に対応付ける情報である。例えば、「SELECT A,B,C FROM T1 WHERE D=1」というクエリについてはインデックス検索が行われる。 FIG. 11 is a diagram showing an example of management information. As shown in FIG. 11, the management information is information for associating the query contents with the access method for each query. For example, an index search is performed for a query “SELECT A, B, C FROM T1 WHERE D = 1”.
 ここで、同じクエリ「SELECT A,B,C FROM T1 WHERE D=1」が新たに発行され、アクセス手法にテーブル全件検索を用いるとDBMS(Data Base Management System:データベース管理システム)が判断したとする。すると、DBMSは、管理情報を参照して、アクセス手法がインデックス検索からテーブル全件検索に変化したことを特定し、このクエリがオンライン中バッチ業務のクエリであり、かつ、データベースへのアクセス手法が変化したことを特定することができる。 Here, the same query “SELECT A, B, C FROM T1, WHERE D = 1” is newly issued, and DBMS (Data Base Management System) has determined that all table search is used as the access method. To do. Then, the DBMS refers to the management information, specifies that the access method has changed from index search to full table search, this query is a query for online batch operations, and the database access method is You can identify what has changed.
 しかしながら、全てのクエリについて管理情報をメインメモリに記憶すると、メインメモリの使用量が大きくなるという問題がある。メインメモリは、データベースキャッシュとして利用されることから、管理情報を記憶するために用いられるメインメモリの量はできるだけ小さいことが望まれる。 However, if management information for all queries is stored in the main memory, there is a problem that the amount of use of the main memory increases. Since the main memory is used as a database cache, it is desired that the amount of main memory used for storing management information is as small as possible.
 本発明は、1つの側面では、管理情報を記憶するために用いられるメインメモリの量を抑えることを目的とする。 In one aspect, the present invention aims to reduce the amount of main memory used for storing management information.
 1つの態様では、ジョブ特定プログラムは、コンピュータに、以下の処理を実行させる。すなわち、ジョブ特定プログラムは、コンピュータに、データベース管理システムに対して検索要求を行うクエリから、コネクションの時間に関連したコネクション時間情報に基づいて、オンラインバッチジョブに関連したクエリを抽出する処理を実行させる。そして、ジョブ特定プログラムは、コンピュータに、抽出したクエリのデータベースに対するアクセス手法がデータ量が少ないときに適したアクセス手法である場合に、該クエリの情報を蓄積する処理を実行させる。そして、ジョブ特定プログラムは、コンピュータに、蓄積された情報に基づき、アクセス手法が変更されたオンラインバッチジョブのクエリを特定する処理を実行させる。 In one aspect, the job identification program causes the computer to execute the following processing. That is, the job specifying program causes the computer to execute a process of extracting a query related to the online batch job based on connection time information related to the connection time from a query that makes a search request to the database management system. . Then, the job specifying program causes the computer to execute processing for accumulating information of the query when the access method to the extracted query database is an appropriate access method when the amount of data is small. The job specifying program causes the computer to execute processing for specifying a query of an online batch job whose access method has been changed based on the accumulated information.
 1つの側面では、管理情報を記憶するために用いられるメインメモリの量を抑えることができる。 In one aspect, the amount of main memory used to store management information can be reduced.
図1は、実施例に係るDBMSの機能構成を示す図である。FIG. 1 is a diagram illustrating a functional configuration of the DBMS according to the embodiment. 図2は、オンラインバッチ業務のクエリであって、かつ、アクセス手法がインデックス検索からテーブル全件検索に変化したクエリを特定する方法を説明するための図である。FIG. 2 is a diagram for explaining a method for specifying a query that is an online batch query and whose access method has changed from index search to full table search. 図3は、管理情報記憶部の一例を示す図である。FIG. 3 is a diagram illustrating an example of the management information storage unit. 図4は、並列検索の制御を説明するための図である。FIG. 4 is a diagram for explaining parallel search control. 図5は、クエリの実行プランを作成して実行する処理のフローを示すフローチャートである。FIG. 5 is a flowchart showing a flow of processing for creating and executing a query execution plan. 図6は、実施例に係る実行計画プログラムを実行するコンピュータのハードウェア構成を示す図である。FIG. 6 is a diagram illustrating a hardware configuration of a computer that executes the execution planning program according to the embodiment. 図7は、オンライン業務、夜間バッチ業務及びオンライン中バッチ業務を説明するための図である。FIG. 7 is a diagram for explaining the online business, the nighttime batch business, and the online batch business. 図8は、インデックス検索を説明するための図である。FIG. 8 is a diagram for explaining the index search. 図9は、業務とデータベースアクセス方法の関係を示す図である。FIG. 9 is a diagram illustrating a relationship between a business and a database access method. 図10は、テーブル全件検索における並列検索を説明するための図である。FIG. 10 is a diagram for explaining parallel search in the table all-case search. 図11は、管理情報の一例を示す図である。FIG. 11 is a diagram illustrating an example of management information.
 以下に、本願の開示するジョブ特定プログラム、ジョブ特定方法及びジョブ特定装置の実施例を図面に基づいて詳細に説明する。なお、この実施例は開示の技術を限定するものではない。 Hereinafter, embodiments of a job specifying program, a job specifying method, and a job specifying apparatus disclosed in the present application will be described in detail with reference to the drawings. Note that this embodiment does not limit the disclosed technology.
 まず、実施例に係るDBMSの機能構成について説明する。図1は、実施例に係るDBMSの機能構成を示す図である。図1に示すように、実施例に係るDBMS1は、構文解析部11と、解析部12と、リライト部13と、実行計画部14と、管理情報記憶部15と、実行部16と、DB20とを有する。 First, the functional configuration of the DBMS according to the embodiment will be described. FIG. 1 is a diagram illustrating a functional configuration of the DBMS according to the embodiment. As illustrated in FIG. 1, the DBMS 1 according to the embodiment includes a syntax analysis unit 11, an analysis unit 12, a rewrite unit 13, an execution plan unit 14, a management information storage unit 15, an execution unit 16, and a DB 20. Have
 構文解析部11は、クエリの文字列を解析し、クエリの構文解析を行う。解析部12は、クエリで用いられるテーブルの存在のチェック等を行い、クエリを処理するための情報を取得する。リライト部13は、ビュー等の処理を含めてクエリを書き換える。 The syntax analysis unit 11 analyzes a query character string and performs query syntax analysis. The analysis unit 12 checks the presence of a table used in the query and acquires information for processing the query. The rewrite unit 13 rewrites the query including processing such as view.
 実行計画部14は、クエリを処理する最適な実行プランを作成する。また、実行計画部14は、管理情報記憶部15を用いて、オンライン中バッチ業務のクエリであって、かつ、アクセス手法がインデックス検索からテーブル全件検索に変化したクエリを特定する。すなわち、実行計画部14は、クエリを発行したジョブがオンライン中バッチ業務であって、クエリのアクセス手法がインデックス検索からテーブル全件検索に変化したことを特定する。 The execution plan unit 14 creates an optimal execution plan for processing the query. Further, the execution planning unit 14 uses the management information storage unit 15 to identify a query that is an online batch job and whose access method has changed from index search to full table search. That is, the execution planning unit 14 specifies that the job that issued the query is an online batch job, and the query access method has changed from index search to full table search.
 図2は、オンライン中バッチ業務のクエリであって、かつ、アクセス手法がインデックス検索からテーブル全件検索に変化したクエリを特定する方法を説明するための図である。図2に示すように、実行計画部14は、コネクション時間を利用して、クエリがオンライン業務又はオンライン中バッチ業務のクエリであるか否かを判別する(t1)。 FIG. 2 is a diagram for explaining a method for specifying a query that is an online batch job query and whose access method has changed from an index search to an all-table search. As shown in FIG. 2, the execution planning unit 14 determines whether the query is an online business query or an online batch business query using the connection time (t1).
 具体的には、実行計画部14は、コネクション開始時間+40秒<クエリ開始時間の場合に、クエリがオンライン業務又はオンライン中バッチ業務のクエリであると判別する。なお、40秒は一例であり、他の値でもよい。 Specifically, the execution plan unit 14 determines that the query is an online business or online batch business query when connection start time + 40 seconds <query start time. Note that 40 seconds is an example, and other values may be used.
 そして、実行計画部14は、テーブル統計情報を利用して、クエリが並列検索が必要なクエリ、すなわち、オンライン中バッチ業務のクエリであるか否かを判別する(t2)。具体的には、実行計画部14は、テーブルのブロック数を元に、テーブルのサイズが10GB(ギガバイト)以上であるか否かを判定することによって、オンライン中バッチ業務のクエリであるか否かを判定する。 Then, the execution plan unit 14 uses the table statistical information to determine whether the query is a query that requires parallel search, that is, a query for online batch operations (t2). Specifically, the execution planning unit 14 determines whether the query is an online batch job by determining whether the table size is 10 GB (gigabytes) or more based on the number of blocks in the table. Determine.
 そして、実行計画部14は、現手法が非並列か否か、すなわち、新たに実行するクエリのアクセス手法がテーブル全件検索であり、新たに実行するクエリの現在までのアクセス手法がインデックス検索であるか否かを管理情報記憶部15を用いて判定する(t3)。 Then, the execution plan unit 14 determines whether or not the current method is non-parallel, that is, the access method of the newly executed query is a full table search, and the access method of the newly executed query is the index search. It is determined using the management information storage unit 15 whether or not there is (t3).
 管理情報記憶部15は、オンライン中バッチ業務のクエリのうちインデックス検索が行われたクエリを記憶する。管理情報記憶部15は、メインメモリ内に設けられる。図3は、管理情報記憶部15の一例を示す図である。図3に示すように、管理情報記憶部15は、クエリ内容と優先情報を管理情報として記憶する。 The management information storage unit 15 stores a query for which an index search has been performed among queries for online batch operations. The management information storage unit 15 is provided in the main memory. FIG. 3 is a diagram illustrating an example of the management information storage unit 15. As shown in FIG. 3, the management information storage unit 15 stores the query content and priority information as management information.
 優先情報は、オンライン中バッチ業務のクエリであって、かつ、アクセス手法がインデックス検索からテーブル全件検索に変化したクエリに付与される優先実行権を示し、アドホッククエリに対して優先的に実行される権利を示す。ここで、アドホッククエリとは、その場限りで使用されるクエリである。アクセス手法がインデックス検索からテーブル全件検索に変化して優先実行権が付与されると、優先情報は実行計画部14により「1」に設定される。 The priority information indicates a priority execution right that is given to a query that is an online batch transaction and whose access method has changed from index search to full table search, and is executed preferentially for ad hoc queries. The right to Here, an ad hoc query is a query used on an ad hoc basis. When the access method changes from index search to full table search and the priority execution right is given, the priority information is set to “1” by the execution planning unit 14.
 実行計画部14は、抽出部14aと、蓄積部14bと、特定部14cとを有する。抽出部14aは、コネクション時間及びテーブルのサイズを利用して、オンライン中バッチ業務のクエリを抽出する。蓄積部14bは、抽出部14aにより抽出されたクエリのうちインデックス検索が行われたクエリの情報を管理情報記憶部15に蓄積する。特定部14cは、管理情報記憶部15を参照して、アクセス手法がインデックス検索からテーブル全件検索に変化したクエリを特定する。 The execution plan unit 14 includes an extraction unit 14a, a storage unit 14b, and a specification unit 14c. The extraction unit 14a extracts a query for online batch jobs using the connection time and the table size. The accumulating unit 14b accumulates, in the management information storage unit 15, information on a query that has been index-searched among the queries extracted by the extracting unit 14a. The specifying unit 14c refers to the management information storage unit 15 and specifies a query whose access method has changed from index search to full table search.
 実行部16は、実行プランに基づいてクエリを実行する。実行部16は、優先実行権が付与されたクエリに対して優先的に実行されるように並列処理を制御する。DB20は、テーブルを記憶する。DB20が記憶するテーブルに対して検索が実行される。 The execution unit 16 executes a query based on the execution plan. The execution unit 16 controls the parallel processing so that it is executed preferentially with respect to the query to which the priority execution right is given. The DB 20 stores a table. A search is performed on the table stored in the DB 20.
 図4は、並列検索の制御を説明するための図である。図4において、並列処理フレームワークは、n個の並列検索用ワーカー#1~並列検索用ワーカー#nが並列に検索を行うことを示す。図4(a)に示すように、オンライン中バッチ業務のクエリは、アクセス手法がインデックス検索からテーブル全件検索に変化すると、並列検索用ワーカー#1~並列検索用ワーカー#nにより並列に処理される。 FIG. 4 is a diagram for explaining parallel search control. In FIG. 4, the parallel processing framework indicates that n parallel search workers # 1 to #n parallel search workers #n perform searches in parallel. As shown in FIG. 4 (a), online batch transaction queries are processed in parallel by parallel search worker # 1 to parallel search worker #n when the access method changes from index search to full table search. The
 また、図4(b)に示すように、オンライン中バッチ業務のクエリが並列実行されている場合にアドホッククエリの処理要求があっても、アドホッククエリは、オンライン中バッチ業務のクエリの処理が完了するまで並列検索されない。 Further, as shown in FIG. 4B, even when an online batch job query is executed in parallel, even if an ad hoc query processing request is issued, the ad hoc query completes the online batch job query processing. Will not be searched in parallel until
 また、図4(c)に示すように、アドホッククエリの並列実行中にオンライン中バッチ業務のクエリの並列処理要求があると、並列検索用ワーカー#1~並列検索用ワーカー#nは返却され、アドホッククエリは非並列で処理が継続される。そして、オンライン中バッチ業務のクエリに並列検索用ワーカー#1~並列検索用ワーカー#nが割り当てられ、オンライン中バッチ業務のクエリが優先的に実行される。 Also, as shown in FIG. 4C, if there is a parallel processing request for online batch business queries during parallel execution of ad hoc queries, parallel search worker # 1 to parallel search worker #n are returned, The ad hoc query is processed in non-parallel. Then, the parallel search worker # 1 to the parallel search worker #n are assigned to the online batch job query, and the online batch job query is preferentially executed.
 次に、クエリの実行プランを作成して実行する処理のフローについて説明する。図5は、クエリの実行プランを作成して実行する処理のフローを示すフローチャートである。図5に示すように、実行計画部14は、対象クエリの実行プランを作成する(ステップS1)。ここで、対象クエリとは、処理を要求されたクエリである。 Next, the flow of processing to create and execute a query execution plan will be described. FIG. 5 is a flowchart showing a flow of processing for creating and executing a query execution plan. As shown in FIG. 5, the execution plan unit 14 creates an execution plan for the target query (step S1). Here, the target query is a query requested to be processed.
 そして、実行計画部14は、対象クエリがオンライン業務又はオンライン中バッチ業務に相当するものか否かを判定し(ステップS2)、オンライン業務にもオンライン中バッチ業務にも相当しない場合には、実行部16が、対象クエリを実行する(ステップS7)。 Then, the execution planning unit 14 determines whether or not the target query corresponds to an online job or an online batch job (step S2). The unit 16 executes the target query (step S7).
 一方、対象クエリがオンライン業務又はオンライン中バッチ業務に相当する場合には、実行計画部14は、対象クエリのアクセス対象となるテーブルのサイズが10GB以上であるか否かを判定する(ステップS3)。その結果、対象クエリのアクセス対象となるテーブルのサイズが10GB以上でない場合には、対象クエリはオンライン中バッチ業務のクエリではないので、実行部16が、対象クエリを実行する(ステップS7)。 On the other hand, when the target query corresponds to an online job or an online batch job, the execution planning unit 14 determines whether the size of the table to be accessed by the target query is 10 GB or more (step S3). . As a result, when the size of the table to be accessed by the target query is not 10 GB or more, since the target query is not an online batch job query, the execution unit 16 executes the target query (step S7).
 一方、対象クエリのアクセス対象となるテーブルのサイズが10GB以上である場合には、対象クエリはオンライン中バッチ業務のクエリであるので、実行計画部14は、管理情報記憶部15に対象クエリの情報があるか否かを判定する(ステップS4)。 On the other hand, when the size of the table to be accessed by the target query is 10 GB or more, since the target query is an online batch job query, the execution plan unit 14 stores information on the target query in the management information storage unit 15. It is determined whether or not there is (step S4).
 その結果、管理情報記憶部15に対象クエリの情報がある場合には、対象クエリは以前にインデックス検索により処理されたため、実行計画部14は、対象クエリの今回のアクセス手法がテーブル全件検索であるか否かを判定する(ステップS5)。その結果、対象クエリの今回のアクセス手法がテーブル全件検索でない場合には、引き続きインデックス検索が行われている場合であるので、実行部16が、対象クエリを実行する(ステップS7)。 As a result, when there is information on the target query in the management information storage unit 15, the target query has been processed by the index search before, so the execution plan unit 14 determines that the current access method of the target query is a full table search. It is determined whether or not there is (step S5). As a result, if the current access method of the target query is not a full table search, the index search is still being performed, so the execution unit 16 executes the target query (step S7).
 一方、対象クエリの今回のアクセス手法がテーブル全件検索である場合には、アクセス手法がインデックス検索からテーブル全件検索に変わった場合であるので、実行計画部14は、対象クエリに並列検索の優先実行権を付与し(ステップS6)、管理情報記憶部15の優先情報に優先実行権の付与を設定する。そして、実行部16が、対象クエリを実行する(ステップS7)。 On the other hand, when the current access method of the target query is a full table search, since the access method is changed from an index search to a full table search, the execution planning unit 14 performs parallel search on the target query. A priority execution right is granted (step S6), and the priority execution right is set in the priority information of the management information storage unit 15. Then, the execution unit 16 executes the target query (step S7).
 一方、ステップS4で、管理情報記憶部15に対象クエリの情報がない場合には、実行計画部14は、対象クエリのアクセス手法がインデックス検索であるか否かを判定する(ステップS8)。その結果、対象クエリのアクセス手法がインデックス検索でない場合には、実行部16が、対象クエリを実行する(ステップS7)。 On the other hand, if there is no information on the target query in the management information storage unit 15 in step S4, the execution plan unit 14 determines whether or not the access method of the target query is an index search (step S8). As a result, when the access method of the target query is not index search, the execution unit 16 executes the target query (step S7).
 一方、対象クエリのアクセス手法がインデックス検索である場合には、実行計画部14は、管理情報記憶部15に対象クエリの情報を格納し(ステップS9)、実行部16が、対象クエリを実行する(ステップS7)。 On the other hand, when the access method of the target query is index search, the execution plan unit 14 stores the information of the target query in the management information storage unit 15 (step S9), and the execution unit 16 executes the target query. (Step S7).
 このように、実行計画部14が、対象クエリはオンライン中バッチ業務のクエリであって、かつ、アクセス手法がインデックス検索からテーブル全件検索に変化したクエリである場合に、並列検索の優先実行権を付与する。したがって、DBMS1は、オンライン中バッチ業務のデータ量が増加し、アクセス手法をインデックス検索からテーブル全件検索に変えた場合に、性能劣化を抑えることができる。 As described above, when the target query is an online batch business query and the access method is a query in which the access method is changed from the index search to the all-table search, the priority execution right of the parallel search is executed. Is granted. Therefore, the DBMS 1 can suppress performance degradation when the data amount of online batch operations increases and the access method is changed from index search to full table search.
 上述してきたように、実施例では、実行計画部14が、コネクションの時間に関連したコネクション時間情報に基づいて、オンライン中バッチ業務に関連したクエリを抽出する。そして、実行計画部14は、抽出したクエリのアクセス手法がインデックス検索である場合に、該クエリの情報を管理情報記憶部15に蓄積する。そして、実行計画部14は、蓄積した情報に基づき、アクセス手法がインデックス検索からテーブル全件検索に変更されたオンライン中バッチ業務のクエリを特定する。 As described above, in the embodiment, the execution planning unit 14 extracts a query related to the online batch job based on the connection time information related to the connection time. Then, when the access method of the extracted query is an index search, the execution plan unit 14 accumulates information on the query in the management information storage unit 15. Then, the execution planning unit 14 identifies a query for an online batch job whose access method has been changed from an index search to a full table search based on the accumulated information.
 したがって、DBMS1は、管理情報記憶部15に情報を蓄積するクエリをオンライン中バッチ業務のクエリであって、かつ、インデックス検索が行われたクエリに限定することができ、管理情報記憶部15の大きさを小さくすることができる。このため、メインメモリの使用量を抑えることができる。 Accordingly, the DBMS 1 can limit the query for storing information in the management information storage unit 15 to a query for an online batch job and for which an index search has been performed. The thickness can be reduced. For this reason, the usage amount of the main memory can be suppressed.
 例えば、オンライン業務とオンライン中バッチ業務を合わせたクエリの数を5000、オンライン中バッチ業務のクエリの割合を1%としてその数を50、アドホッククエリの数を500とし、コネクション数を1000とする。また、クエリ内容にアクセス手法を付加した情報を記憶する従来の記憶領域のサイズ、及び、クエリ内容に優先情報を付加した情報を記憶する記憶領域のサイズを70バイトとする。 For example, suppose that the number of queries including online business and online batch business is 5000, the ratio of online batch business queries is 1%, the number is 50, the number of ad hoc queries is 500, and the number of connections is 1000. In addition, the size of a conventional storage area that stores information in which an access method is added to the query contents and the size of a storage area that stores information in which priority information is added to the query contents are set to 70 bytes.
 管理情報を記憶するため必要なメインメモリは、従来は、70バイト×5500クエリ×1000コネクション=385MB(メガバイト)であったが、実施例では、70×50クエリ×1000コネクション=3.5MBとなる。 Conventionally, the main memory necessary for storing the management information is 70 bytes × 5500 queries × 1000 connections = 385 MB (megabytes). In the embodiment, 70 × 50 queries × 1000 connections = 3.5 MB. .
 また、実施例では、実行計画部14は、さらに、クエリがアクセスするテーブルのサイズに基づいて、オンライン中バッチ業務に関連したクエリを抽出する。したがって、実行計画部14は、オンライン中バッチ業務に関連したクエリを正確に抽出することができる。 In the embodiment, the execution planning unit 14 further extracts a query related to the online batch operation based on the size of the table accessed by the query. Therefore, the execution planning unit 14 can accurately extract queries related to online batch operations.
 また、実施例では、コネクション時間情報は、コネクション開始時間とクエリ開始時間を含むので、実行計画部14は、オンライン業務及びオンライン中バッチ業務に関連したクエリを正確に抽出することができる。 In the embodiment, since the connection time information includes the connection start time and the query start time, the execution planning unit 14 can accurately extract queries related to the online business and the online batch business.
 なお、実施例では、実行計画部14について説明したが、実行計画部14が有する構成をソフトウェアによって実現することで、同様の機能を有する実行計画プログラムを得ることができる。そこで、実行計画プログラムを実行するコンピュータについて説明する。 In addition, although the execution plan part 14 was demonstrated in the Example, the execution plan program which has the same function can be obtained by implement | achieving the structure which the execution plan part 14 has with software. Therefore, a computer that executes the execution planning program will be described.
 図6は、実施例に係る実行計画プログラムを実行するコンピュータのハードウェア構成を示す図である。図6に示すように、コンピュータ50は、メインメモリ51と、CPU52と、LAN(Local Area Network)インタフェース53と、HDD(Hard Disk Drive)54とを有する。また、コンピュータ50は、スーパーIO(Input Output)55と、DVI(Digital Visual Interface)56と、ODD(Optical Disk Drive)57とを有する。 FIG. 6 is a diagram illustrating a hardware configuration of a computer that executes the execution plan program according to the embodiment. As shown in FIG. 6, the computer 50 includes a main memory 51, a CPU 52, a LAN (Local Area Network) interface 53, and an HDD (Hard Disk Drive) 54. The computer 50 includes a super IO (Input Output) 55, a DVI (Digital Visual Interface) 56, and an ODD (Optical Disk Drive) 57.
 メインメモリ51は、プログラムやプログラムの実行途中結果などを記憶するメモリである。図1に示した管理情報記憶部15は、メインメモリ51に設けられる。CPU52は、メインメモリ51からプログラムを読出して実行する中央処理装置である。CPU52は、メモリコントローラを有するチップセットを含む。 The main memory 51 is a memory for storing a program and a program execution result. The management information storage unit 15 illustrated in FIG. 1 is provided in the main memory 51. The CPU 52 is a central processing unit that reads a program from the main memory 51 and executes it. The CPU 52 includes a chip set having a memory controller.
 LANインタフェース53は、コンピュータ50をLAN経由で他のコンピュータに接続するためのインタフェースである。HDD54は、プログラムやデータを格納するディスク装置である。図1に示したDB20は、HDD54に設けられる。スーパーIO55は、マウスやキーボードなどの入力装置を接続するためのインタフェースである。DVI56は、液晶表示装置を接続するインタフェースであり、ODD57は、DVDの読み書きを行う装置である。 The LAN interface 53 is an interface for connecting the computer 50 to another computer via a LAN. The HDD 54 is a disk device that stores programs and data. The DB 20 illustrated in FIG. 1 is provided in the HDD 54. The super IO 55 is an interface for connecting an input device such as a mouse or a keyboard. The DVI 56 is an interface for connecting a liquid crystal display device, and the ODD 57 is a device for reading / writing a DVD.
 LANインタフェース53は、PCIエクスプレス(PCIe)によりCPU52に接続され、HDD54及びODD57は、SATA(Serial Advanced Technology Attachment)によりCPU52に接続される。スーパーIO55は、LPC(Low Pin Count)によりCPU52に接続される。 The LAN interface 53 is connected to the CPU 52 by PCI Express (PCIe), and the HDD 54 and ODD 57 are connected to the CPU 52 by SATA (Serial Advanced Technology Attachment). The super IO 55 is connected to the CPU 52 by LPC (Low Pin Count).
 そして、コンピュータ50において実行される実行計画プログラムは、DVDに記憶され、ODD57によってDVDから読出されてコンピュータ50にインストールされる。あるいは、実行計画プログラムは、LANインタフェース53を介して接続された他のコンピュータシステムのデータベースなどに記憶され、これらのデータベースから読出されてコンピュータ50にインストールされる。そして、インストールされた実行計画プログラムは、HDD54に記憶され、メインメモリ51に読出されてCPU52によって実行される。 The execution plan program executed in the computer 50 is stored in the DVD, read from the DVD by the ODD 57, and installed in the computer 50. Alternatively, the execution plan program is stored in a database or the like of another computer system connected via the LAN interface 53, read from these databases, and installed in the computer 50. The installed execution plan program is stored in the HDD 54, read into the main memory 51, and executed by the CPU 52.
  1  DBMS
 11  構文解析部
 12  解析部
 13  リライト部
 14  実行計画部
 15  管理情報記憶部
 16  実行部
 20  DB
 50  コンピュータ
 51  メインメモリ
 52  CPU
 53  LANインタフェース
 54  HDD
 55  スーパーIO
 56  DVI
 57  ODD
1 DBMS
DESCRIPTION OF SYMBOLS 11 Syntax analysis part 12 Analysis part 13 Rewrite part 14 Execution plan part 15 Management information storage part 16 Execution part 20 DB
50 Computer 51 Main memory 52 CPU
53 LAN interface 54 HDD
55 Super IO
56 DVI
57 ODD

Claims (5)

  1.  コンピュータに、
     データベース管理システムに対して検索要求を行うクエリから、コネクションの時間に関連したコネクション時間情報に基づいて、オンラインバッチジョブに関連したクエリを抽出し、
     抽出したクエリのデータベースへのアクセス手法がデータ量が少ないときに適したアクセス手法である場合に、該クエリの情報を蓄積し、
     前記蓄積された情報に基づき、アクセス手法が変更されたオンラインバッチジョブのクエリを特定する
     処理を実行させることを特徴とするジョブ特定プログラム。
    On the computer,
    Based on the connection time information related to the connection time, the query related to the online batch job is extracted from the query that makes a search request to the database management system.
    When the access method to the database of the extracted query is a suitable access method when the amount of data is small, the information of the query is accumulated,
    A job specifying program for executing a process for specifying a query of an online batch job whose access method has been changed based on the accumulated information.
  2.  前記抽出する処理は、さらに、当該クエリがアクセスするテーブルのサイズに基づいて、オンラインバッチジョブに関連したクエリを抽出することを特徴とする請求項1に記載のジョブ特定プログラム。 The job specifying program according to claim 1, wherein the extracting process further extracts a query related to an online batch job based on a size of a table accessed by the query.
  3.  前記コネクション時間情報は、コネクション開始時間とクエリ開始時間を含むことを特徴とする請求項1又は2に記載のジョブ特定プログラム。 3. The job specifying program according to claim 1, wherein the connection time information includes a connection start time and a query start time.
  4.  コンピュータが、
     データベース管理システムに対して検索要求を行うクエリから、コネクションの時間に関連したコネクション時間情報に基づいて、オンラインバッチジョブに関連したクエリを抽出し、
     抽出したクエリのデータベースへのアクセス手法がデータ量が少ないときに適したアクセス手法である場合に、該クエリの情報を蓄積し、
     前記蓄積された情報に基づき、アクセス手法が変更されたオンラインバッチジョブのクエリを特定する
     処理を実行することを特徴とするジョブ特定方法。
    Computer
    Based on the connection time information related to the connection time, the query related to the online batch job is extracted from the query that makes a search request to the database management system.
    When the access method to the database of the extracted query is a suitable access method when the amount of data is small, the information of the query is accumulated,
    A job specifying method comprising: executing a process for specifying a query of an online batch job whose access method has been changed based on the accumulated information.
  5.  データベース管理システムに対して検索要求を行うクエリから、コネクションの時間に関連したコネクション時間情報に基づいて、オンラインバッチジョブに関連したクエリを抽出する抽出部と、
     前記抽出部により抽出されたクエリのデータベースへのアクセス手法がデータ量が少ないときに適したアクセス手法である場合に、該クエリの情報を蓄積する蓄積部と、
     前記蓄積部により蓄積された情報に基づき、アクセス手法が変更されたオンラインバッチジョブのクエリを特定する特定部と
     を有することを特徴とするジョブ特定装置。
    An extraction unit that extracts a query related to an online batch job based on connection time information related to connection time from a query that makes a search request to the database management system;
    When the access method to the database of the query extracted by the extraction unit is an access method suitable when the amount of data is small, a storage unit that stores information on the query;
    And a specifying unit that specifies a query of an online batch job whose access method has been changed based on the information stored by the storage unit.
PCT/JP2016/080358 2016-10-13 2016-10-13 Job specification program, job specification method and job specification device WO2018070011A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2016/080358 WO2018070011A1 (en) 2016-10-13 2016-10-13 Job specification program, job specification method and job specification device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2016/080358 WO2018070011A1 (en) 2016-10-13 2016-10-13 Job specification program, job specification method and job specification device

Publications (1)

Publication Number Publication Date
WO2018070011A1 true WO2018070011A1 (en) 2018-04-19

Family

ID=61905305

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2016/080358 WO2018070011A1 (en) 2016-10-13 2016-10-13 Job specification program, job specification method and job specification device

Country Status (1)

Country Link
WO (1) WO2018070011A1 (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0695936A (en) * 1992-09-16 1994-04-08 Nippon Telegr & Teleph Corp <Ntt> Method for managing buffer
JPH11249917A (en) * 1998-02-27 1999-09-17 Nec Corp Parallel computers, their batch processing method, and storage medium
JP2016162418A (en) * 2015-03-05 2016-09-05 富士通株式会社 Search control program, search control method, and search control device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0695936A (en) * 1992-09-16 1994-04-08 Nippon Telegr & Teleph Corp <Ntt> Method for managing buffer
JPH11249917A (en) * 1998-02-27 1999-09-17 Nec Corp Parallel computers, their batch processing method, and storage medium
JP2016162418A (en) * 2015-03-05 2016-09-05 富士通株式会社 Search control program, search control method, and search control device

Similar Documents

Publication Publication Date Title
US11921760B2 (en) Distributed transaction management with tokens
US9672241B2 (en) Representing an outlier value in a non-nullable column as null in metadata
US9639542B2 (en) Dynamic mapping of extensible datasets to relational database schemas
US9268804B2 (en) Managing a multi-version database
JP6471262B2 (en) Data processing system
US11321302B2 (en) Computer system and database management method
US10515078B2 (en) Database management apparatus, database management method, and storage medium
CN110109910A (en) Data processing method and system, electronic equipment and computer readable storage medium
US20160350354A1 (en) Tracking changes among similar documents
US11269954B2 (en) Data searching method of database, apparatus and computer program for the same
US20200042538A1 (en) Methods and apparatus to partition a database
US20140222828A1 (en) Columnwise Storage of Point Data
US10810174B2 (en) Database management system, database server, and database management method
US20150363442A1 (en) Index merge ordering
US11249968B2 (en) Large object containers with size criteria for storing mid-sized large objects
KR102415962B1 (en) Storage system and method for operating thereof
WO2012164738A1 (en) Database management system, device, and method
US11720563B1 (en) Data storage and retrieval system for a cloud-based, multi-tenant application
US11176106B2 (en) Dynamic modification of database schema
JP6897248B2 (en) Update reflection program, update reflection method and update reflection device
WO2018070011A1 (en) Job specification program, job specification method and job specification device
US10860577B2 (en) Search processing system and method for processing search requests involving data transfer amount unknown to host
CN113625967A (en) Data storage method, data query method and server
JP2018085042A (en) Database management device, information processing system, database management method and database management program
JP2017068342A (en) Control program, control method, and information processor

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: 16918746

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: 16918746

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP