WO2018051697A1 - データ統合方法、データ統合装置、データ処理システム及びコンピュータプログラム - Google Patents

データ統合方法、データ統合装置、データ処理システム及びコンピュータプログラム Download PDF

Info

Publication number
WO2018051697A1
WO2018051697A1 PCT/JP2017/029139 JP2017029139W WO2018051697A1 WO 2018051697 A1 WO2018051697 A1 WO 2018051697A1 JP 2017029139 W JP2017029139 W JP 2017029139W WO 2018051697 A1 WO2018051697 A1 WO 2018051697A1
Authority
WO
WIPO (PCT)
Prior art keywords
integrated
index
data
field
value
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/JP2017/029139
Other languages
English (en)
French (fr)
Japanese (ja)
Inventor
古庄　晋二
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Turbo Data Laboratories Inc
Original Assignee
Turbo Data Laboratories Inc
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 Turbo Data Laboratories Inc filed Critical Turbo Data Laboratories Inc
Priority to US16/333,475 priority Critical patent/US20190266142A1/en
Publication of WO2018051697A1 publication Critical patent/WO2018051697A1/ja
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2272—Management thereof
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2282—Tablespace storage structures; Management thereof
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2457—Query processing with adaptation to user needs
    • G06F16/24578—Query processing with adaptation to user needs using ranking
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/25—Integrating or interfacing systems involving database management systems

Definitions

  • the present invention mainly relates to a technology for integrating database data.
  • an index set data structure as shown in FIG. 8a2 representing an RDB (Relational Database) table as shown in FIG. 8a1 is known (for example, Patent Document 1).
  • the table (table A) in FIG. 8a1 is a table having rows having records having a plurality of fields (in the figure, “gender” and “type”), and each record has an order of the records in the table. Is assigned a record number. The record number starts from 0.
  • the index set (table A index set) shown in FIG. 8a2 is composed of indexes provided for each field of the record in the table of FIG. 8a1. In the table of FIG. 8a1, since the fields of the record of the table are “sex” and “type”, the index of “sex” and the index of “type” are included in the index set of FIG. 8a2.
  • each index includes VNo and VL.
  • VL is a list in which values used as values of corresponding fields in the corresponding table are sorted in a predetermined standard (for example, ascending order of values) and registered in each entry. That is, for example, if the index is “sex” in the index set of the table data set of the table shown in FIG. 8a1, since only F and M are registered in the “sex” field of the table, VL is , F is a list including entries registered with M and entries registered with M.
  • VNo is a list composed of the same number of entries as the number of records in the corresponding table.
  • VNo rank n the value of the corresponding field of the record of record number n of the corresponding table is registered.
  • a value indicating the rank in the VL of the entry of the existing VL is registered. The order of VNo and VL starts from 0.
  • the index is “sex” in the index set of the table data set of the table shown in FIG. 8a1
  • the value of the “sex” field of the record with record number 2 in the table is F, and F is registered. Since the rank of the VL entry is 0, 1 is registered in the VNo rank 2 entry.
  • the number of records in the corresponding table can be quickly determined from the number of entries in VNo, and the value of the corresponding field in the record of each record number can be quickly determined from VNo and VL.
  • the table index set is stored as it is at this time, the following problems occur. That is, as the number of index sets to be saved increases, the storage data capacity required for saving increases in proportion to the sum of the data amounts of the saved index sets. Further, as the number of saved index sets increases, it becomes difficult to use a plurality of tables represented by the saved plurality of index sets in an integrated manner. That is, the table A index set shown in FIG. 8a2 that is the index set of the table A shown in FIG. 8a1, the table B index set shown in FIG. 8b2 that is the index set of table B shown in FIG. 8b1, and the table C shown in FIG. If the three index sets are stored as they are with the table C index set shown in FIG. 8c2 as the index set of FIG. 8C, it becomes difficult to use the tables A, B, and C in an integrated manner.
  • the number of records whose field type “sex” is F in the table A using the table A index set.
  • the table B index set is used to determine the number of records in which the field type “sex” in table B is F
  • the table C index set is used to determine the number of records in which the field type “sex” is F. It is necessary to perform a relatively complicated and heavy processing of calculating the total number of records obtained for each table A, B, and C. Note that the load of such processing increases sequentially as the number of stored index sets increases.
  • the integrated index set which is one index set representing one table in which the tables represented by each index set are stored, is stored instead of storing a plurality of index sets.
  • the above-described problem occurs.
  • an object of the present invention is to store data of a plurality of tables in a form that allows easy use of each table in an integrated manner while reducing the amount of data by relatively simple processing.
  • the present invention provides a data integration method for integrating index data representing a table composed of one or a plurality of fields, each of which is assigned a record number, into integrated data.
  • the index data includes an index provided corresponding to each of the fields.
  • each index includes a value list in which values used as field values corresponding to the index of the record of the table represented by the index data including the index are registered in each entry, The rank of the entry in the value list of the index in which the value of the field corresponding to the index of the record having the same record number as the rank of the entry in the table represented by the index data including the index is registered. And a corresponding list of values registered.
  • the integrated data includes an integrated value list provided corresponding to each of the fields and a corresponding integrated value list provided corresponding to each of the fields.
  • each field is registered in the integrated value list corresponding to the field among the values included in the index value list corresponding to the field of the index data to be integrated into the integrated data.
  • An array arranged in order according to the order in the corresponding value list is additionally registered in the corresponding integrated value list corresponding to the field of the integrated data, or a new corresponding integrated value list corresponding to the field Adding to the integrated data asHowever, the corresponding integrated value obtained for the entry in the corresponding value list is registered in the value list of the index to which the corresponding value list belongs in the same order as the order registered in the corresponding value list entry.
  • the same value as the value is registered and is equal to the rank of the entry in the integrated value list corresponding to the field corresponding to the index to which the corresponding value list belongs.
  • the present invention also provides a data integration device that executes such a data integration method in order to achieve the above-described object.
  • a data integration method or data integration apparatus even if there is an overlap in the values registered in the index value list entries of the same field between the index data to be integrated into the integrated data, Each value registered in each entry of the integrated value list of each integrated index is a unique value in the integrated value list. Therefore, it is possible to reduce the storage data capacity required for storage as compared with the case of storing each index data as it is.
  • new index data can be integrated into the integrated data by a relatively simple process that does not change any existing part of the integrated data. It becomes like this.
  • the integrated data represents a table in which tables corresponding to each index set integrated with the integrated data are connected, by using the integrated data, the table corresponding to each index data can be easily integrated. Operation and use.
  • this invention provides the data integration method which integrates the table which arranged the record which each consisted of the record number which consists of 1 or several fields and was given to integrated data in order to achieve the said subject.
  • the integrated data includes a corresponding integrated value list provided corresponding to each of the fields, and an integrated value list provided corresponding to each of the fields.
  • the data integration method for each field of the table to be integrated into the integrated data, among the values used as the value of the field of each record of the table, the data integration method is registered in the integrated value list corresponding to the field.
  • An array in which the order of entries in the integrated value list is arranged in the order according to the order of records in the table is additionally registered in the corresponding integrated value list corresponding to the field of the integrated data, or the array is stored in the field.
  • the present invention also provides a data integration device that executes such a data integration method in order to achieve the above-described object.
  • a data integration method or data integration apparatus even if there is an overlap in the values registered in the same field between tables or records integrated into the integrated data, the integration indexes of the integrated data are integrated.
  • Each value registered in each entry of the value list is a unique value in the integrated value list. Therefore, it is possible to reduce the data capacity of the storage required for saving compared to the case of saving each table as it is.
  • a new table can be integrated into the integrated data by a relatively simple process that does not change any existing part of the integrated data. Become. Further, since the integrated data represents a table obtained by connecting the tables integrated with the integrated data, by using the integrated data, the integrated operation and use of each table can be easily performed.
  • the present invention also provides a data processing system comprising the above data integration device and a storage storing the integrated data, wherein the integrated data is stored in each field of each record number.
  • a data processing system including table operation means for operating the table represented by the integrated data stored in the storage is also provided as a table including the table.
  • the present invention also provides a computer program that causes a computer to function as the above data integration device or data processing system.
  • data of a plurality of tables can be stored in a form that allows easy use of each table in an integrated manner while reducing the amount of data by relatively simple processing.
  • FIG. 1 It is a block diagram which shows the structure of the data processing system which concerns on embodiment of this invention. It is a figure which shows the outline
  • FIG. 1 shows a configuration of a data processing apparatus according to the present embodiment.
  • the data processing apparatus includes a storage 1, a processor 2, an input device 3, a display device 4, and the like.
  • the processor 2 includes a data integration unit 11 and an RDBMS 12 (relational database management system 12).
  • the data integration unit 11 and the RDBMS 12 are functional units realized by the processor 2 executing a predetermined computer program.
  • the data integration unit 11 of the processor 2 integrates the stored index set into the integrated index set stored in the storage 1.
  • the index set to be newly stored stored in the storage 1 is an index set including the indexes including the VNo and VL described above with reference to FIG. 8, and the index set is illustrated in FIG. 8a2.
  • the index set represents one table in the same manner as the index set in FIG. 8a1.
  • the RDBMS 12 performs an integrated operation on each table represented by the index set stored so far using the integrated index set.
  • the table A index set of FIG. 2a2 which is the index set representing the table A shown in FIG. 2a1
  • the data integration unit 11 uses the table A index set of FIG. 2a2. As shown in FIG. 2a3, the integrated index set is used as it is.
  • the integrated index set includes an index for each field, and each index includes VNo and VL, and the integrated index set represents a table.
  • the index set index is simply referred to as “index”, and the index of the integrated index is expressed as “integrated index” to distinguish them.
  • the table represented by the index set is simply expressed as “table”, and the table represented by the integrated index set is expressed as “integrated table” to distinguish between the two.
  • the integrated index set of FIG. 2a3 first generated as described above represents an integrated table having the same contents as the table A as shown in FIG. 2a4.
  • the table B index set of FIG. 2b2 which is an index set representing the table B shown in FIG. 2b1 is stored as the index set to be stored next.
  • the data integration unit 11 performs the following processing for each index of the table B index set.
  • T_VNo which is a list with the same number of VNo entries in the index, is created and stored in each entry of T_VNo in the entry VNoE (i) of the corresponding VNo of the index, which has the same rank as the entry T_VNoE (i) of the T_VNo.
  • a value indicating the rank of the VL entry of the integrated index of the field in which the value j registered in the entry VLE (k) of the VL of the index having the value k as the rank is registered is registered.
  • each entry of T_VNo is additionally registered in VNo of the integrated index of the field as shown in FIG. 2b3.
  • T_VNoE (i) represents the i-th entry of T_VNo
  • VNoE (i) represents the i-th entry of VNo
  • VLE (k) represents the k-th entry of VL.
  • the number of VNo entries in the index is 4, so T_VNo having four entries is created.
  • the value registered in the entry of rank 0 of VIndex of the index is 1, and the value registered in the entry of rank 1 of VL of the index is B Since B is registered in the entry of rank 3 of VL of the integrated index of field “type”, 3 is registered in the entry of rank 0 of T_VNo.
  • the value registered in the VNo rank 2 entry of the index is 0, and the value registered in the VL rank 0 entry of the index is Since A is registered in the entry of rank 0 of the VL of the integrated index of the field “type”, 0 is registered in the entry of rank 2 of T_VNo.
  • each entry of T_VNo is added to VNo of the integrated index of field “type”.
  • the integrated table represented by the integrated index set shown in FIG. 2b3 created in this way is obtained by concatenating the tables A and B in this order as shown in FIG. 2b4.
  • the table B index set is integrated into the integrated index set as described above, and the index to be stored next is stored with the integrated index set of FIG. 3a1 representing the integrated table shown in FIG. 3a2.
  • the data integration unit 11 performs the following processing for each index of the table C index set as described above. I do.
  • T_VNo which is a list with the same number of VNo entries in the index, is created and stored in each entry of T_VNo in the entry VNoE (i) of the corresponding VNo of the index, which has the same rank as the entry T_VNoE (i) of the T_VNo.
  • a value indicating the rank of the VL entry of the integrated index of the field in which the value j registered in the entry VLE (k) of the VL of the index having the value k as the rank is registered is registered.
  • each entry of T_VNo is additionally registered in VNo of the integrated index of the field as shown in FIG. 3b3.
  • the integrated table represented by the integrated index set shown in FIG. 3b3 created in this way is obtained by concatenating Table A, Table B, and Table C in this order as shown in FIG. 3b4. Thereafter, whenever an index set to be stored next occurs, the same processing is performed to integrate the index set into the integrated index set.
  • the integration of the index set into the integrated index set is realized by editing the integrated index according to the contents of the index for each field index.
  • the editing of the integrated index according to the contents of this index can be realized by the following procedure, for example.
  • a case where the integrated index shown in FIG. 4A is edited according to the contents of the index shown in FIG. 4A will be described as an example.
  • a registered value investigation process is performed.
  • the pointer P is set to 0, and the current number CN is set to 3, which is the next order of the last entry of the integrated index VL.
  • T_VL having the same number of entries as the index VL and an additional value list adVL are created.
  • the value A registered in the entry of rank 0 indicated by the pointer P of the index VL is acquired, and it is checked whether or not the acquired value A is stored in the VL of the integrated index.
  • the rank 0 of the VL entry of the integrated index in which the value A is stored is acquired, and the acquired rank is set to the rank 0 entry indicated by the pointer P in T_VL. sign up.
  • the value of the pointer P matches the order of the entry at the end of the VL of the index. Since it does not match here, the value of the pointer P is incremented by one.
  • the value B registered in the rank 1 entry indicated by the pointer P of the index VL is acquired. Check whether it is stored in the VL of the unified index.
  • the acquired value B is additionally registered in the additional value list adVL.
  • the value 3 of the current number CN is registered in the entry of rank 1 indicated by the pointer P of T_VL, and the value of the current number CN is incremented by one to 4.
  • the value of the current number CN is advanced by one when the value of the current number CN is registered in the T_VL entry.
  • the value of the pointer P matches the rank of the entry at the end of the VL of the index.
  • the value of the pointer P is advanced by one, as shown in FIG. 4C, the value F registered in the rank 2 entry indicated by the pointer VL of the index VL is acquired. Check whether it is stored in the VL of the unified index.
  • the acquired value F is additionally registered in the additional value list adVL.
  • the value 4 of the current number CN is registered in the entry of rank 2 indicated by the pointer P of T_VL.
  • a T_VNo creation process is performed next.
  • a T_VNo having the same number of entries as the index VNo is created.
  • the value X stored in the entry of the rank i is acquired.
  • the value Y registered in the T_VL entry with the same rank X as the acquired value X is registered in the T_VNo entry with the rank i.
  • the value registered in the index VNo rank 1 entry is 1. Therefore, the value 3 registered in the rank 1 T_VL entry is obtained. To do. Then, the acquired value 3 is registered in the entry of rank 1 of T_VNo.
  • each entry of the additional value list adVL created by the registered value survey processing is added to the VL of the integrated index, and each entry of T_VNo created by the T_VNo creation processing is added to the integrated index. Add to VNo.
  • the integration operation of the index set into the integrated index set performed by the data integration unit 11 has been described above.
  • the integrated index set created as described above is created and stored as a separate data structure for each VNo portion of each unified index of the unified index set created from different index sets as shown in FIG. It may be.
  • the VNo portion 601 of each integrated index of the integrated index set created first from the table A index set and each table added when the table B index set is integrated into the integrated index set and added to the integrated index set The VNo portion 602 of the unified index and the VNo portion 603 of each unified index created when the table C index set is merged with the unified index set and added to the unified index set are separate files or separate. These files may be stored in the storage 1 as separate data structures. Also, in this case, the index that is the creation source of each data structure, or the table that is represented by the index that is the creation source of each data structure, and the data indicating the correspondence between the data structures are integrated as correspondence data. It may be included in the index set. By doing so, various uses of the integrated index set in units of tables and indexes can be easily performed.
  • the concatenation of the portions corresponding to the respective fields of the respective VNo portions 601, 602, and 603 forms the VNo of the integrated index corresponding to the field.
  • the RDBMS 12 performs the following processing when performing an operation for obtaining a record having a specific value in a specific field. That is, first, the rank of the entry in which the specific value of the integrated index VL of the specific field of the integrated index set is registered is obtained. Then, the order of each VNo entry of the integrated index in which the obtained order is registered is obtained. And it extracts as a record number of the record which asks for a record which uses each order obtained as a record number.
  • the following processing is performed to determine the value of each field of the record with that record number. That is, for the integrated index of each field of the integrated index, the value registered in the entry having the same rank as the record number of the VNo of the integrated index is obtained and registered in the VL of the integrated index having the same rank as the obtained value. The calculated value is calculated as the value of the field corresponding to the integrated index of the record with the record number.
  • the RDBMS 12 When the RDBMS 12 performs an operation for obtaining a record having a value within a specific range in a specific field, the RDBMS 12 specifies each of the values within the specific range as the specific value. A process for obtaining a record having a specific value in the field is performed. Further, the RDBMS 12 performs the following processing when performing an operation for obtaining the number of records having a specific value in a specific field. That is, in this case, the rank of the entry in which the specific value of the integrated index VL of the specific field of the integrated index set is registered is obtained. Then, the number of VNo entries of the integrated index in which the obtained rank is registered is calculated as the number of records having a specific value in the specific field.
  • the RDBMS 12 performs the following processing when performing an operation of sorting the records of the integrated table represented by the integrated index set by the values of specific fields.
  • the order of the VL entries of the integrated index of the specific field of the integrated index set is arranged according to the order of the values registered in the entry (for example, the order from the smallest value).
  • the order of the VNo entries in which the values are registered is obtained in the order of the arranged values, and the order of the obtained VNo entries is arranged according to the order in which the orders are obtained.
  • the sequence of ranks obtained as a result is calculated as the sequence of sorted record numbers.
  • the value of each field of each record of each record number is obtained as described above, and the sorted table is arranged in the order of the sorted record numbers to create a sorted table.
  • the above operation can be performed only for the VNo range corresponding to a specific table / index when the above-described corresponding data is included in the integrated index set.
  • the RDBMS 12 can quickly perform an integrated operation on each table represented by each index set integrated into the integrated index set by a direct operation on the integrated index set. It can be carried out.
  • the embodiment of the present invention has been described above.
  • the stored index set is changed by adding an index having a blank value or changing the order of the indexes. What is necessary is just to make it integrate into an integrated index set after converting into the index set of a common field structure.
  • the data integration unit 11 of the processor 2 stores the index set stored in the storage 1 when the index set to be newly stored is stored in the storage 1.
  • FIG. 1 when a table to be newly stored is stored in the storage 1 in the data integration unit 11 of the processor 2, FIG.
  • the index set may be created as described above, and the created index set may be integrated with the integrated index set stored in the storage 1.
  • the stored table is changed by adding a field having a blank value to the table or changing the order of the fields in the table.
  • An index set may be created after conversion to a common field configuration table.
  • the data integration unit 11 of the processor 2 may create an integrated table as follows. That is, as shown in FIG. 7a1, if the first table A to be integrated into the integrated index set is stored in the storage 1, the VNO and VL for each field (field “gender” and field “type”) are set first.
  • the field of the table B is set in the corresponding field of each record.
  • a value that is not registered in the VL of the corresponding field of the integrated VL of the integrated index set is additionally registered in the VL of the corresponding field of the integrated VL as shown in FIG. 7b2.
  • VNo is created as follows. That is, for each field in table B, a VNo consisting of the same number of entries as the number of records in table B is created, and the value of the corresponding field of the record of record number n in the corresponding table is registered in the entry of VNo rank n. A value indicating the rank in the VL of the VL entry of the corresponding field of the integrated VL of the integrated index set is registered.
  • the VNo of the field “type” having four entries is created, and the VNo rank i entry of the created field “type” is created.
  • the value of the field “type” of the record of the record number 3 of the table B is F
  • the VL (VL (type)) of the field “type” of the integrated VL Since F is registered in the entry of order 4, the 4 is registered.
  • the VNo created for each field is used as the partial index of the field, and the table B partial index set including the partial index created for each field is stored in the integrated index set.
  • the integrated index set may include data indicating from which table each partial index set is created as the above-described corresponding data.
  • the partial index VNo of each field of each index set in each table of the integrated index set in FIG. 7b1 may be concatenated and stored in the integrated set as an integrated partial index.
  • the integrated index set may include data indicating which range of the VNo entry of the integrated partial index is created from which table as the corresponding data described above.
  • the VNo of each field when the VNo of partial indexes are concatenated and stored as an integrated partial index in this way is the same two tables as the table A of FIG. 7a1 and the table B of FIG. 7b1 (table A of FIG. 2a1).
  • the index set of the table B) of FIG. 2b2 are integrated as shown in FIG. 2 and equal to the VNo of the index of each field of the integrated index set shown in FIG. 2b3.
  • the VL of each field of the integrated VL is also equal to the VL of each field of the integrated index set shown in FIG. 2b3.
  • the configuration as the data structure of the integrated index set when the partial indexes VNo are concatenated and stored as the integrated partial index is the same as the configuration of the integrated index set data structure shown in FIG.
  • the configuration of the integrated index set shown as a data structure is the same as the configuration of the integrated index set shown in FIG. 7b2.
  • the table can be integrated into the integrated index set without using the index set. Further, it can be used in the same manner as the integrated index set created by integrating the index sets as described above.
  • the table is stored by adding a field with a blank value to the table or changing the order of the fields in the table.
  • the converted table is converted into a table having a common field configuration and processed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Software Systems (AREA)
  • Computational Linguistics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
PCT/JP2017/029139 2016-09-14 2017-08-10 データ統合方法、データ統合装置、データ処理システム及びコンピュータプログラム Ceased WO2018051697A1 (ja)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/333,475 US20190266142A1 (en) 2016-09-14 2017-08-10 Data integration method, data integration device, data processing system, and computer program

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2016-179579 2016-09-14
JP2016179579A JP6744179B2 (ja) 2016-09-14 2016-09-14 データ統合方法、データ統合装置、データ処理システム及びコンピュータプログラム

Publications (1)

Publication Number Publication Date
WO2018051697A1 true WO2018051697A1 (ja) 2018-03-22

Family

ID=61619500

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2017/029139 Ceased WO2018051697A1 (ja) 2016-09-14 2017-08-10 データ統合方法、データ統合装置、データ処理システム及びコンピュータプログラム

Country Status (3)

Country Link
US (1) US20190266142A1 (enExample)
JP (1) JP6744179B2 (enExample)
WO (1) WO2018051697A1 (enExample)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP7513086B2 (ja) * 2020-05-13 2024-07-09 日本電気株式会社 統合装置、データテーブル統合方法、プログラム
WO2023032013A1 (ja) * 2021-08-30 2023-03-09 晋二 古庄 演算装置、演算方法、及びプログラム
WO2023152965A1 (ja) * 2022-02-14 2023-08-17 晋二 古庄 データ提供装置、データ提供方法及びプログラム

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0193843A (ja) * 1987-10-05 1989-04-12 Hitachi Ltd テーブル結合方式
JPH01163826A (ja) * 1987-12-21 1989-06-28 Hitachi Ltd リレーショナルデータベースの結合処理方式
JP2015207026A (ja) * 2012-08-29 2015-11-19 株式会社ターボデータラボラトリー 情報処理装置、レコード位置情報特定方法および情報処理プログラム

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6185379B2 (ja) * 2013-12-02 2017-08-23 株式会社Ｎｔｔドコモ レコメンド装置およびレコメンド方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0193843A (ja) * 1987-10-05 1989-04-12 Hitachi Ltd テーブル結合方式
JPH01163826A (ja) * 1987-12-21 1989-06-28 Hitachi Ltd リレーショナルデータベースの結合処理方式
JP2015207026A (ja) * 2012-08-29 2015-11-19 株式会社ターボデータラボラトリー 情報処理装置、レコード位置情報特定方法および情報処理プログラム

Also Published As

Publication number Publication date
JP2018045441A (ja) 2018-03-22
JP6744179B2 (ja) 2020-08-19
US20190266142A1 (en) 2019-08-29

Similar Documents

Publication Publication Date Title
US10552443B1 (en) Schemaless to relational representation conversion
US9720994B2 (en) Replicated database structural change management
US8615526B2 (en) Markup language based query and file generation
US11243987B2 (en) Efficient merging and filtering of high-volume metrics
JP5873935B2 (ja) データベースの管理方法、管理計算機及び記憶媒体
US20160173122A1 (en) System That Reconfigures Usage of a Storage Device and Method Thereof
US10002142B2 (en) Method and apparatus for generating schema of non-relational database
US11461333B2 (en) Vertical union of feature-based datasets
JP2018067279A (ja) データプロパティ認識のための装置、プログラム、及び方法
CN113918605A (zh) 数据查询方法、装置、设备以及计算机存储介质
US9881055B1 (en) Language conversion based on S-expression tabular structure
JPWO2010084754A1 (ja) データベースシステム、データベース管理方法、及びデータベース構造
WO2018051697A1 (ja) データ統合方法、データ統合装置、データ処理システム及びコンピュータプログラム
JP2001331509A (ja) リレーショナルデータベース処理装置、リレーショナルデータベースの処理方法及びリレーショナルデータベースの処理プログラムを記録したコンピュータ読み取り可能な記録媒体
CN110019341B (zh) 一种数据查询方法及装置
CN109634585B (zh) 一种基于表单自适应展示和更新服务端数据的方法
CN112395850B (zh) 一种检查数据定义一致性的方法、装置和电子设备
US20140067853A1 (en) Data search method, information system, and recording medium storing data search program
US20170242880A1 (en) B-tree index structure with grouped index leaf pages and computer-implemented method for modifying the same
US20210357372A1 (en) Data analysis assistance device, data analysis assistance method, and data analysis assistance program
CN111125045B (zh) 一种轻量级etl处理平台
US20180068005A1 (en) Distributed computation of percentile statistics for multidimensional data sets
CN108874873B (zh) 数据查询方法、装置、存储介质及处理器
US12346331B1 (en) Batch materialization using bloom filters
JP2017027349A (ja) レプリケーションプログラム

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

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

Country of ref document: EP

Kind code of ref document: A1