[go: up one dir, main page]

WO2016117739A1 - Système et procédé de gestion de données basée sur une base de données en mémoire - Google Patents

Système et procédé de gestion de données basée sur une base de données en mémoire Download PDF

Info

Publication number
WO2016117739A1
WO2016117739A1 PCT/KR2015/000831 KR2015000831W WO2016117739A1 WO 2016117739 A1 WO2016117739 A1 WO 2016117739A1 KR 2015000831 W KR2015000831 W KR 2015000831W WO 2016117739 A1 WO2016117739 A1 WO 2016117739A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
link
record
identification information
data
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/KR2015/000831
Other languages
English (en)
Korean (ko)
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.)
REALTIMETECH Co Ltd
Original Assignee
REALTIMETECH Co Ltd
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 REALTIMETECH Co Ltd filed Critical REALTIMETECH Co Ltd
Publication of WO2016117739A1 publication Critical patent/WO2016117739A1/fr
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
    • 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
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/1847—File system types specifically adapted to static storage, e.g. adapted to flash memory or SSD

Definitions

  • the present invention relates to an in-memory database-based data management system and method thereof, and more particularly, to an in-memory database-based data management system capable of performing a high-performance network path search through direct record access in a database management system. And to a method thereof.
  • DBMS Database Management System
  • the basic software for organizing and archiving data for effective use is a software package that combines functions such as adding, changing, deleting, and retrieving data, which are necessary steps for managing a database.
  • In-Memory Computing is when an application loads data for operation into main memory rather than a hard disk to perform a service. In-memory computing uses a memory area that was used only as an area for computation as a space for storing and processing a large amount of data.
  • in-memory computing technologies can be classified into three categories: in-memory application platform, in-memory data management, and in-memory messaging.
  • an in-memory database is a database management system that is installed and operated in the main memory of a data store, and data access and processing speed are faster than those installed on a disk.
  • the in-memory database management system stores the records in main memory and transfers the data directly from the main memory to the CPU. Quickly search through the index
  • the in-memory database management system When implementing a network path search algorithm in an in-memory database, a large number of node data and link data must be accessed and read for path search. At this time, the in-memory database management system must perform a path search algorithm by searching the records of the node table and the link table through index search each time for mutual data access between the node table and the link table.
  • Korean Patent No. 10-1260165 discloses a technical content of an open database management system.
  • a record is composed of a key, and a column is created by designating a plurality of regions each consisting of a set of values as a table, which is implemented as a database management system of key-value pairs, and is composed of a domain key and a record key.
  • a key is a field or fields in a table that are indexed so that you can quickly find the data you want in the database.
  • the prior art performs record retrieval by using an index structure using a key for linking between records of tables existing in different accounts or regions, and thus it takes a lot of time for the record retrieval.
  • the path search performance is inevitably deteriorated, there is a problem that it takes a long time to obtain the final result.
  • the record identification information which is a logical address value of a record that should be cross-referenced between node data and link data, is stored separately in a network table so that the record can be directly accessed through the record identification information when searching for records between nodes and links. It provides a memory database-based data management system and method thereof.
  • an in-memory database based data management system may generate a node table by inputting node data and link record identification information of a link connected to the node data, and generating the link data and the link in a link record.
  • a data input module for inputting node record identification information of a node connected with data to generate a link table;
  • a data storage module for constructing a network table including the node table or a link table;
  • a pointer operation for extracting link record identification information and node record identification information from the node table and the link table, respectively, and changing the node record identification information and the link record identification information to address values of a memory and setting them as starting pointers of the corresponding records.
  • module And a control module for performing a record access control operation to perform a record search using the node record identification information or the record identification information, and performing an information management operation so that the node record identification information or the record identification information is not changed.
  • the data management system based on the in-memory database may further include a path search module for accessing a corresponding record directly using the start pointer to check connectivity information between a node and a link and performing a path search operation.
  • the data management system based on an in-memory database may further include a memory compression module configured to perform a compression operation to prevent fragmentation of the memory while maintaining data consistency of the data storage module.
  • the memory compression module controls the memory compression module to perform a compression operation on the remaining tables except the network table through an information management operation.
  • the node table adds a link identification column for inserting link record identification information of link data connected to each node, and the link table inserts node identification column for inserting node record identification information of a start node and an end node of each link. It is characterized by adding the.
  • an in-memory database-based data management method includes an in-memory database-based data management method for constructing network data by an in-memory database management system (DBMS).
  • DBMS in-memory database management system
  • the node table is generated by inputting node data and link record identification information of the link connected to the node in the node record
  • the link table is generated by entering link data and node record identification information of the node associated with the link in the link record.
  • the table generating step may include a link identification column for inserting link record identification information of a link connected to each node in the node table, and inserting node record identification information of a start node and an end node of each link in the link table.
  • the node identification column may be added.
  • the table generating step may include inputting node data into the node table and setting the link identification column as an initialization value; If a start node and an end node for a link of the link data exist in the node table, the corresponding link data is input to the link table, and node record identification information of the start node and the end node of the link is entered in the node identification column. Inserting each; And inserting link record identification information connected to the start node in the link identification column of the node record for the start node in the node table, and identifying the link record connected to the end node in the link identification column of the node record for the end node. And inserting the information.
  • a node record including node data for initial access is searched in the network table, and the link record connected to the node is identified in the searched node record. And extracting information, and using the extracted link record identification information as a start pointer, directly accessing the corresponding record to perform a path search operation.
  • the in-memory database-based data management method may perform a compression operation to prevent fragmentation of memory for the tables other than the network table so that the node record identification information and the link record identification information are not changed. It further comprises a memory compression step to perform.
  • a pointer operation is performed on the link record identification information stored in the node record to be changed to the start pointer of the corresponding link record, and the node record identification information stored on the link record is converted to the start pointer of the corresponding node record. And cross-reference between the node data and the link data.
  • the record identification information by adding the record identification information, which is the logical address value of the record that should be cross-referenced between the node table and the link table, in a separate column and storing it in each table
  • the record identification information which is the logical address value of the record that should be cross-referenced between the node table and the link table
  • a method of accessing a record by using the record identification information of the present invention is a memory pointer type operation operation, the record retrieval time through the index is completely removed, thereby ensuring a very fast response speed.
  • FIG. 1 is a diagram illustrating a configuration of an in-memory database based data management system according to an exemplary embodiment of the present invention.
  • FIG. 2 is a flowchart illustrating an in-memory database based data management method according to an embodiment of the present invention.
  • FIG. 3 is a diagram illustrating a record direct access method of FIG. 2.
  • FIG. 4 is a flowchart illustrating a table generation process of FIG. 2.
  • first and second are intended to distinguish one component from another component, and the scope of rights should not be limited by these terms.
  • first component may be named a second component, and similarly, the second component may also be named a first component.
  • an identification code (e.g., a, b, c, etc.) is used for convenience of description, and the identification code does not describe the order of the steps, and each step clearly indicates a specific order in context. Unless stated otherwise, they may occur out of the order noted. That is, each step may occur in the same order as specified, may be performed substantially simultaneously, or may be performed in the reverse order.
  • FIG. 1 is a diagram illustrating a configuration of an in-memory database based data management system according to an exemplary embodiment of the present invention.
  • an in-memory database based data management system includes a data input module 110, a data storage module 120, a pointer operation module 130, a control module 140, a path search module 150, and Memory compression module 160.
  • the data input module 110 inserts node data and link record identification information LINK_RID of a link connected with a node of the node data to each node record to generate a node table.
  • the data input module 110 inserts link data and NODE_RID of each link connected node into each link record to generate a link table.
  • the node table and the link table since the node table and the link table have their own RID information, the node table and the link table inform their own RID values according to requests of tables to be referred to each other.
  • the node table and the link table are tables for organizing network data. As shown in Table 1 and Table 2, a node table and a link table are sets of records composed of columns. At this time, the node data is represented through a node list in which each node is represented as a node record. Node records contain one or more fields that are unique identifiers for that node, but may include other attribute fields that provide information about the node.
  • Link data is represented through a link list (or link matrix) that identifies at least two nodes (start node and end node) but can also display information such as link strength, link direction, and link type. .
  • the node data is NODE_ID as identification information for identifying the node record by the user and has a value such as coordinates
  • the link data is LINK_ID as identification information for identifying the link record by the user. It has values such as start node ID, end node ID, and cost.
  • RID is the logical address translation of memory from the system.
  • the data storage module 120 stores a network table including a node table and a link table generated by the data input module 110 in a main memory that is a data storage of a DBMS.
  • the main memory stores tables related to various data.
  • the pointer operation module 130 extracts the LINK_RID from the node table stored in the data storage module 120, extracts the NODE_RID from the link table, and changes the extracted NODE_RID and LINK_RID to logical address values of the memory, respectively, to start the corresponding record. Set by pointer. In other words, if the pointer operation is performed on the LINK_RID information stored in the node record, the start pointer of the link record can be obtained. If the pointer operation is performed on the NODE_RID information stored in the link record, the start pointer of the node record can be obtained. Cross reference is possible.
  • the control module 140 performs a record access control operation to directly access a record using NODE_RID and LINK_RID when searching for a network path, and performs an information management operation so that the NODE_RID and LINK_RID of the network table are not changed.
  • the path search module 150 may return a record through the pointer calculation module 130 and request a record to be searched by the pointer calculation module 130. That is, the path search module 150 directly accesses the corresponding record using the start pointer, checks the connectivity information between the node and the link, and proceeds with the path search operation. In this case, the path search module 150 may use a path search algorithm such as a Dijkstra algorithm or an A * algorithm.
  • the memory compression module 160 performs a compression operation for each page to prevent fragmentation of the memory while maintaining data consistency of the data storage module 120.
  • control module 140 changes the location on the physical memory. Compress only the rest of the tables.
  • FIG. 2 is a flowchart illustrating an in-memory database based data management method according to an embodiment of the present invention
  • FIG. 3 is a diagram illustrating a record direct access method of FIG. 2.
  • a node table is generated by inputting node data and LINK_RID of a link connected to a node in each node record through the data input module 110.
  • the link table is generated by inputting link data and NODE_RID of a node connected to the link data in each link record (S10).
  • the node table has a link identification column for inserting the LINK_RID of the link connected to each node, and the link table has a node identification column for inserting START_NODE_RID and END_NODE_RID, which are node record identification information of the start and end nodes of each link. Is added.
  • the network table including the node table and the link table thus generated is stored in the main memory (S20).
  • the pointer operation module 130 extracts the LINK_RID and the NODE_RID from the node table and the link table, respectively, and changes them into memory address values and sets them as the start pointers of the corresponding records. (S30) If NODE_RID and LINK_RID are set as the start pointers of the memory, the memory pointer type of arithmetic operations allows direct access to records, which ensures faster response times than record searches using existing index structures.
  • the LINK_RID of the link connected to each node is a start pointer
  • the link table is the start pointer of NODE_RID of the start node and the end node of the end node connected to each link.
  • the path search module 150 may directly access the corresponding record using the start pointer to check the connectivity information between the node and the link and perform the shortest path search operation at high speed.
  • the node table inputs a node ID and a value of node data, and a link identification column for inputting a LINK_RID connected to the node is added.
  • a node ID column for inputting a link ID and a value of link data and inputting NODE_RIDs of a start node and an end node of the link is added.
  • the path search module 150 searches for a record to be visited by searching for a node ID or a link ID when the first record is accessed, and then starts a path search algorithm.
  • the path search module 150 extracts the NODE_RID and LINK_RID for the linked node and link from the record retrieved through the pointer operation module 130, and directly accesses the record using the extracted NODE_RID and LINK_RID as the starting pointer of the corresponding record. Proceed with the path search operation.
  • a route search retrieves a node with ID 104 to retrieve the first access node, retrieves a value of '004' from the LINK_RID value of the retrieved node record to visit a link that is connected to node 104, You can directly access the link record by converting it to the start pointer of the link record through pointer operation.
  • the main memory which is the data storage module 120, divides the entire memory space into pages of the same size and stores a plurality of data or tables. However, since data or tables stored in memory are stored in different sizes, page fragmentation, which is an empty memory space, occurs in a page.
  • the memory compression module 160 performs a compression operation to make a memory space that can be used by gathering fragmented spaces scattered here and there in one place.
  • the control module 140 performs an information management operation so that the network table does not perform a compression operation so that NODE_RID and LINK_RID of the node table and the link table are not changed. Therefore, the memory compression module 160 performs the compression operation only on the data or the table except the network table by the control module 140.
  • FIG. 4 is a flowchart illustrating a table generation process of FIG. 2.
  • NODE_RID and LINK_RID stored in the node table and the link table are address values that should be referred to each other. Therefore, the data input module 110 should store address values for records connected to the node identification column and the link identification column.
  • the data input module 110 inputs node data into the node record, and sets the address value of the link identification column to an initialization value (000). (S11, S12)
  • the data input module 110 updates the initialization value set in the link identification column of the record of the start node in the node table to the LINK1_RID of the link connected to the start node, and updates the initialization value set in the link identification column of the record of the end node to the end node. Update to LINK1_RID of the linked link (S15).
  • the data input module 110 inputs data into the node table and the link table, respectively, and stores an RID which is an address value that should be cross-referenced to the node identification column and the link identification column.
  • an in-memory database-based data management system and method thereof are linked with node record identification information, which is a logical address of an object record to be visited for direct record access to the node table and the link table.
  • node record identification information which is a logical address of an object record to be visited for direct record access to the node table and the link table.
  • a data storage structure that adds record identification information to a column is defined, and a path search algorithm can be performed based on the high performance network path search.

Landscapes

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

Abstract

La présente invention concerne un système de gestion de données basée sur une base de données en mémoire comprenant : un module d'entrée de données permettant la génération d'une table de nœuds, par l'entrée, dans un nœud, de données de nœud d'enregistrement et d'informations d'identification d'enregistrement de liaison d'une liaison connectée aux données du nœud, et permettant la génération d'une table de liaison en introduisant, dans un enregistrement de liaison, des informations d'identification d'enregistrement de nœud et de données de liaison d'un nœud connecté aux données de liaison ; un module de stockage de données permettant l'élaboration d'une table de réseau qui comprend la table de nœud ou la table de liaison ; un module de calcul de pointeur permettant l'extraction des informations d'identification d'enregistrement de liaison et des informations d'identification d'enregistrement de nœud à partir de la table de nœud et de la table de liaison, respectivement, et le changement, en une valeur d'adresse de mémoire, des informations d'identification d'enregistrement de nœud et des informations d'identification d'enregistrement de liaison, respectivement, ce qui permet de configurer celle-ci en tant que pointeur de départ d'un enregistrement correspondant ; et un module de commande permettant l'exécution d'une opération de commande d'accès d'enregistrement de manière à effectuer une recherche d'enregistrement en se servant des informations d'identification d'enregistrement de nœud ou des informations d'identification d'enregistrement, et permettant l'exécution d'une opération de gestion d'informations de telle sorte que les informations d'identification d'enregistrement de nœud ou les informations d'identification d'enregistrement ne changent pas. Par conséquent, la présente invention permet d'ajouter des informations d'identification d'enregistrement, qui constituent une valeur d'adresse d'enregistrement logique qui est désignée pour être mutuellement consultée entre une table de nœud et une table de liaison, sur une colonne séparée et ensuite stocker celle-ci dans chaque table, ce qui permet une recherche de chemin dans un délai court tout en confirmant des informations de connectivité entre un nœud et une liaison au moyen d'un accès d'enregistrement direct qui utilise des informations d'identification d'enregistrement pendant une recherche de chemin de réseau. En outre, la présente invention permet un calcul de pointeur de mémoire, et garantit ainsi une vitesse de réponse extrêmement rapide en éliminant complètement un temps de recherche d'enregistrement par l'intermédiaire d'un indice existant.
PCT/KR2015/000831 2015-01-23 2015-01-27 Système et procédé de gestion de données basée sur une base de données en mémoire Ceased WO2016117739A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020150011071A KR101640733B1 (ko) 2015-01-23 2015-01-23 인-메모리 데이터베이스 기반의 데이터 관리 시스템 및 그 방법
KR10-2015-0011071 2015-01-23

Publications (1)

Publication Number Publication Date
WO2016117739A1 true WO2016117739A1 (fr) 2016-07-28

Family

ID=56417261

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2015/000831 Ceased WO2016117739A1 (fr) 2015-01-23 2015-01-27 Système et procédé de gestion de données basée sur une base de données en mémoire

Country Status (2)

Country Link
KR (1) KR101640733B1 (fr)
WO (1) WO2016117739A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180089266A1 (en) * 2016-09-28 2018-03-29 Microsoft Technology Licensing, Llc Direct table association in in-memory databases
CN108777155A (zh) * 2018-08-02 2018-11-09 北京知存科技有限公司 闪存芯片
CN111538640A (zh) * 2020-06-09 2020-08-14 陈君宁 一种动态解析的数据链
CN116030862A (zh) * 2022-12-29 2023-04-28 中科南京智能技术研究院 一种全数字存内计算装置
CN116821137A (zh) * 2023-07-21 2023-09-29 杭州深渡科技有限公司 一种内存数据管理方法、装置、设备及存储介质

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101820017B1 (ko) * 2016-10-26 2018-01-18 주식회사 리얼타임테크 데이터베이스 클러스터링 장치 및 그 방법
KR102045885B1 (ko) * 2017-12-06 2019-11-18 주식회사 리얼타임테크 차선 기반 도로 네트워크상에서의 최단경로 탐색 방법

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5606669A (en) * 1994-05-25 1997-02-25 International Business Machines Corporation System for managing topology of a network in spanning tree data structure by maintaining link table and parent table in each network node
US20010051946A1 (en) * 1999-12-28 2001-12-13 International Business Machines Corporation Database system including hierarchical link table
US6385649B1 (en) * 1998-11-06 2002-05-07 Microsoft Corporation Routers and methods for optimal routing table compression
US20050097108A1 (en) * 2003-10-29 2005-05-05 Oracle International Corporation Network data model for relational database management system
US6944131B2 (en) * 1999-09-27 2005-09-13 Nortel Networks Limited State information and routing table updates in large scale data networks

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100832222B1 (ko) * 2001-06-09 2008-05-23 자프 아게 메인 메모리 데이터베이스 시스템의 색인 구조를 위한캐쉬에 최적화된 동시성 제어방법
US9197597B2 (en) * 2006-07-03 2015-11-24 Oracle International Corporation RDF object type and reification in the database
JP5189838B2 (ja) * 2007-12-27 2013-04-24 日立オートモティブシステムズ株式会社 地図データ配信システム、地図データ配信方法及び通信端末
KR101260165B1 (ko) 2011-08-12 2013-05-06 허준 오픈 데이터베이스 관리 시스템

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5606669A (en) * 1994-05-25 1997-02-25 International Business Machines Corporation System for managing topology of a network in spanning tree data structure by maintaining link table and parent table in each network node
US6385649B1 (en) * 1998-11-06 2002-05-07 Microsoft Corporation Routers and methods for optimal routing table compression
US6944131B2 (en) * 1999-09-27 2005-09-13 Nortel Networks Limited State information and routing table updates in large scale data networks
US20010051946A1 (en) * 1999-12-28 2001-12-13 International Business Machines Corporation Database system including hierarchical link table
US20050097108A1 (en) * 2003-10-29 2005-05-05 Oracle International Corporation Network data model for relational database management system

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180089266A1 (en) * 2016-09-28 2018-03-29 Microsoft Technology Licensing, Llc Direct table association in in-memory databases
US10853364B2 (en) * 2016-09-28 2020-12-01 Microsoft Technology Licensing, Llc Direct table association in in-memory databases
CN108777155A (zh) * 2018-08-02 2018-11-09 北京知存科技有限公司 闪存芯片
CN111538640A (zh) * 2020-06-09 2020-08-14 陈君宁 一种动态解析的数据链
CN111538640B (zh) * 2020-06-09 2023-05-16 陈君宁 一种动态解析的数据链
CN116030862A (zh) * 2022-12-29 2023-04-28 中科南京智能技术研究院 一种全数字存内计算装置
CN116821137A (zh) * 2023-07-21 2023-09-29 杭州深渡科技有限公司 一种内存数据管理方法、装置、设备及存储介质

Also Published As

Publication number Publication date
KR101640733B1 (ko) 2016-07-20

Similar Documents

Publication Publication Date Title
WO2016117739A1 (fr) Système et procédé de gestion de données basée sur une base de données en mémoire
US7805427B1 (en) Integrated search engine devices that support multi-way search trees having multi-column nodes
WO2012108623A1 (fr) Procédé, système et support d'enregistrement lisible par ordinateur pour ajouter une nouvelle image et des informations sur la nouvelle image à une base de données d'images
JPH02501514A (ja) 属性データ　モデル　データベースを使用するソフトウエア応用プログラムを結合する方法
WO2018064962A1 (fr) Procédé de mémorisation de données, dispositif électronique et support d'informations non volatil pour ordinateur
WO2018182060A1 (fr) Procédé de stockage et de recherche de données de journal de texte sur la base d'une base de données relationnelle
WO2021107210A1 (fr) Procédé de recherche de support de stockage à base de vectorisation à l'aide de filtres de bloom dans un système de gestion de base de données ayant de multiples supports de stockage
WO2014189190A1 (fr) Système et procédé de récupération d'informations sur la base d'un étiquetage d'éléments de données
WO2022124573A1 (fr) Procédé d'évaluation de similarité de site web sur la base d'une structure de menu et d'un mot-clé dans un script
CN102867049A (zh) 一种基于单词查找树实现的汉语拼音快速分词方法
WO2019112223A1 (fr) Procédé de récupération de document électronique et serveur associé
CN116049180B (zh) 面向Paas平台的租户数据处理方法及装置
US20190243926A1 (en) Wildcard searches using numeric string hash
WO2019189962A1 (fr) Procédé de parallélisation d'interrogation pour des données ayant une copie existante dans une base de données de distribution
WO2020153522A1 (fr) Dispositif d'indexation hybride dans un système de gestion de base de données basé sur un stockage hétérogène
WO2018080187A1 (fr) Appareil permettant de faire fonctionner de multiples bases de données d'un système de base de données intégré, et procédé associé
WO2020105748A1 (fr) Procédé d'optimisation de requête mettant en œuvre une fusion d'index sur une base de données distribuée
WO2015133774A1 (fr) Système et procédé d'analyse de brevets et support d'enregistrement dans lequel est enregistré un programme destiné à les exécuter
JPH03174653A (ja) キーワード管理方法およびその装置
CN111522820A (zh) 数据存储结构、存储检索方法、系统、设备及存储介质
JP2020135530A (ja) データ管理装置、データ検索方法及びプログラム
WO2012030027A1 (fr) Dispositif de mise en correspondance de chaînes de caractères basé sur un processeur multicœur et procédé de mise en correspondance de chaînes de caractères associé
WO2018182058A1 (fr) Procédé de jointure pour base de données relationnelle
CN114970461A (zh) 数据表的转换方法、装置、设备及存储介质
CN114528593A (zh) 数据权限控制方法、装置、设备及存储介质

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

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

Country of ref document: EP

Kind code of ref document: A1