WO2020135050A1 - Système de mappage de connaissances et serveur de cartes afférent - Google Patents

Système de mappage de connaissances et serveur de cartes afférent Download PDF

Info

Publication number
WO2020135050A1
WO2020135050A1 PCT/CN2019/124555 CN2019124555W WO2020135050A1 WO 2020135050 A1 WO2020135050 A1 WO 2020135050A1 CN 2019124555 W CN2019124555 W CN 2019124555W WO 2020135050 A1 WO2020135050 A1 WO 2020135050A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
graph
server
query
interface
Prior art date
Application number
PCT/CN2019/124555
Other languages
English (en)
Chinese (zh)
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 颖投信息科技(上海)有限公司
Publication of WO2020135050A1 publication Critical patent/WO2020135050A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/903—Querying
    • G06F16/9032—Query formulation

Definitions

  • the present application relates to the technical field of knowledge graph processing, and in particular, to a knowledge graph system and graph server.
  • the knowledge graph is a database that realizes semantic search by storing various entities and their relationships in the real world, and stores and queries data in a graph data structure.
  • each entity is identified by a globally unique identifier (ID, IDentifier), and the "property-property value" pair (PVP, Property Value) Pair is used to represent the internal characteristics of the entity, and the relationship is used to connect the two. Entities, representing the association between them.
  • ID globally unique identifier
  • PVP Property Value
  • the financial knowledge graph represents companies, management, news events, and personal preferences of users as entities and establishes links between entities to make financial data search more efficient and provide investors with targeted Investment advice.
  • Neo4j is a more advanced native graph query database, which can provide native graph data storage, retrieval and processing.
  • Neo4j has been specially optimized for the storage of graphs, which can greatly improve the efficiency and speed of graph traversal.
  • Neo4j provides Cypher as the query language of graphs, with simple semantics and convenient use.
  • Neo4j is more suitable for lightweight scenarios in practical applications. In the case of large data loads, graph data insertion and traversal performance is poor; in addition, due to the limitations of software architecture, Neo4j can only work on a single machine, the system The scalability and fault tolerance are impossible to talk about. With the rapid rise of enterprise data volume, Neo4j under stand-alone deployment is obviously unable to meet the data management and retrieval requirements of knowledge graph.
  • This application provides a knowledge graph system and graph server, which are used to solve the problem that graph data management and retrieval under the situation of large data volume cannot be adapted to the existing graph database.
  • a graph server disclosed in the present application includes a graph database interface, a graph data writing interface, a graph data query interface, and a distributed data storage module, wherein: the graph database interface is configured to receive user data operation requests and The type of the data operation request calls a graph data writing interface or a graph data query interface to implement the operation on the distributed data storage module; the graph data writing interface is configured according to the type of data to be written in the data operation request, Create or update the data of nodes or edges in the distributed data storage module, and return the unique index of the data in the distributed data storage module; the graph data query interface is configured according to the query conditions in the data operation request To obtain the data stored in the distributed data storage module and return it to the user according to the preset node and edge data format; the distributed data storage module is a distributed file system or a distributed database and is configured as a graph server Provide data storage and query services.
  • the graph server further includes a query disassembly module configured to disassemble a query request with a complexity greater than a preset condition into multiple sub-query requests, and call the graph data query interface in sequence or concurrently to implement the user's data query request.
  • a query disassembly module configured to disassemble a query request with a complexity greater than a preset condition into multiple sub-query requests, and call the graph data query interface in sequence or concurrently to implement the user's data query request.
  • the graph server is further provided with a memory cache, which is configured to cache data recently accessed by the user and/or data with a number of query hits greater than or equal to a preset thermal data threshold.
  • the graph server is provided with a service discovery mechanism of a distributed data storage module; each storage server of the distributed data storage module is provided with a heartbeat detection interface to report the device status to the graph server in real time; when there is new storage When the server joins or the existing storage server exits, the graph server automatically updates the configuration of the distributed data storage module through the service discovery mechanism, and switches the storage and query service to the corresponding storage server.
  • the graph server further includes a first data preprocessing module configured to extract structured or unstructured original data and convert it into node data and/or edge data of the graph database.
  • a first data preprocessing module configured to extract structured or unstructured original data and convert it into node data and/or edge data of the graph database.
  • a knowledge graph system disclosed in this application includes a client and the graph server described above; the client is connected to the graph server through a network; the client includes a user interface configured to receive user data operations Request, and send to the graph database interface of the graph server through the network, and receive and display the data operation results of the graph server.
  • the client further includes a second data pre-processing module configured to convert the structured or unstructured original data into node data or edge data of the graph database.
  • the client further includes an intermediate persistent file system configured to temporarily store node data and edge data processed by the second data preprocessing module.
  • the user interface establishes a connection with the graph server by means of hypertext transfer protocol, websocket protocol or remote procedure call protocol.
  • the data operation request adopts the syntax format of Gremlin, GSQL or SPARQL language.
  • the server embodiment of the application of this application decouples the system by setting interfaces at various key points.
  • the storage layer can rapidly expand horizontally according to the growth of data volume. In the case of multiple machine deployments, it can effectively solve the problem that the server is inaccessible or The problem of unavailable data.
  • the flexible interface definition not only enables the system to adapt to various database types, but also can select the appropriate storage method according to the business needs; it can also realize the flexible deployment of graph data query interfaces for multiple machines to adapt to highly concurrent application scenarios.
  • each interface uses a unified graph traversal language for interaction without concern for the implementation of the underlying architecture, thereby ensuring the stability of upper-layer applications.
  • FIG. 1 is a schematic structural diagram of an embodiment of a graph server according to this application.
  • FIG. 2 is a schematic structural diagram of an embodiment of a knowledge graph system for application
  • FIG. 3 is a schematic diagram of a graph data writing process according to an embodiment of this application.
  • FIG. 4 is a schematic diagram of a graph data query process according to an embodiment of the present application.
  • first and second are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features.
  • the features defined as “first” and “second” may explicitly or implicitly include one or more of the features.
  • the meaning of “plurality” is two or more, unless specifically defined otherwise.
  • the terms “including”, “including” and similar terms should be understood as open terms, ie “including/including but not limited to”.
  • the term “based on” is “based at least in part on.”
  • one embodiment means “at least one embodiment”; the term “another embodiment” means “at least one other embodiment”.
  • Related definitions of other terms will be given in the description below.
  • One of the inventive concepts of the present application is to adjust the architecture of the entire knowledge graph system into an application layer, a query engine, and an underlying storage layer for the problem of the existing graph database, to achieve system decoupling and reduce the dependency between modules.
  • the underlying storage layer is used to implement a common interface for graph data storage and query (that is, a virtual graph data layer); by encapsulating common graph processing operations in the graph data layer, the underlying database only needs to provide basic operations such as addition, deletion, modification, and inspection.
  • the graph data can be expanded and redundantly backed up to a file system composed of multiple machines to achieve data consistency and fault tolerance, So that the underlying storage has high I/O performance and flexible schema definition, suitable for the storage of nodes, edges and their attributes.
  • the query engine is used to parse the query language, generate a query plan for graph traversal, and call the underlying storage interface to complete the storage and acquisition of data; after the query engine parses the query language, it can be optimized for the shortest path planning, data aggregation, and other operations.
  • Distributed computing and caching can improve query performance based on data volume and computing resources, and provide high concurrency and short delay services.
  • the application layer provides a unified query language and connection methods, such as Hypertext Transfer Protocol (HTTP, HyperText Transfer), websocket (a protocol defined by RFC 6455 standard for full-duplex communication on a single TCP connection) and remote Protocols such as Procedure Call (RPC, Remote Procedure) Call are connected to the graph server remotely, and interact with the query engine through graph query languages such as Gremlin, GSQL, SPARQL.
  • HTTP Hypertext Transfer Protocol
  • websocket a protocol defined by RFC 6455 standard for full-duplex communication on a single TCP connection
  • RPC Procedure Call
  • FIG. 1 there is shown a schematic structural diagram of an embodiment of a graph server of the present application, including graph database interface 11, graph data writing interface 12, graph data query interface 13 and distributed data storage module 14.
  • the graph database interface 11 is used to receive a data operation request issued by a user, and call the graph data writing interface 12 or the graph data query interface 13 to implement operations on the distributed data storage module 14 according to the type of the data operation request.
  • the types of data operation requests include the creation or update of graph database node data, the creation or update of edge data, and the query of graph database.
  • the data operation request sent to the graph database interface 11 can use the syntax format of graph data manipulation languages such as Gremlin, GSQL, SPARQL, etc. Taking Gremlin as an example, suppose a node and an edge need to be created in the graph database g. Use the g.addV() command to issue a node creation request, and the g.addE() command to issue an edge creation request.
  • the graph data writing interface 12 is used to create or update the node data or edge data in the distributed data storage module 14 according to the type of data to be written (including node data and edge data) in the data operation request, and return all the data The unique index of the data in the distributed data storage module 14.
  • the graph data query interface 13 is used to obtain the data stored in the distributed data storage module 14 according to the query conditions in the data operation request, and return it to the user in a preset data format of nodes and edges.
  • the distributed data storage module 14 is a distributed file system or a distributed database, and is used to provide data storage and query services for the graph server 10.
  • the service discovery mechanism of the distributed data storage module 14 can be set on the graph server 10; meanwhile, a heartbeat detection interface is set on each storage server of the distributed data storage module 14 to report the device status to the graph server 10 in real time
  • the graph server 10 can automatically update the configuration of the distributed data storage module through the above service discovery mechanism, and switch the storage and query service to the corresponding storage server.
  • This application encapsulates common graph processing operations in the graph data layer (that is, graph data writing interface 12 and graph data query interface 13), so that the underlying data storage module only needs to provide basic operations such as addition, deletion, modification, and inspection. Reduce the degree of coupling to the underlying data storage module, and make the underlying data storage module replaceable.
  • the underlying data storage module can customize the storage format according to its storage structure. For example, if the underlying data storage module is a relational database, the nodes and edges can be stored as a table with the following two-dimensional structure:
  • the storage format that can be used is:
  • the graph server is also provided with a query disassembly module, which is used to disassemble a query request whose complexity is greater than a preset condition into multiple sub-query requests, which are called sequentially or concurrently
  • the graph data query interface 13 implements the user's data query request.
  • the above request can be disassembled into two sub-query requests, and the second sub-query can use the first sub-query
  • the output of the query is input, and the second subquery can be decomposed into multiple concurrent calls to the graph data query interface 13 as needed.
  • This application can dismantle complex queries into multiple calls to the graph data query interface, which can expand a single query with limited capabilities into concurrent operation of multiple query servers, thereby greatly improving the query efficiency of the graph database. .
  • the graph server in order to further improve the query response speed of graph data, is further provided with a memory cache for caching the data recently accessed by the user and/or the number of query hits greater than or equal to the preset heat Data threshold data.
  • an optimization method is to cache all (or most) graph data in memory.
  • the implementation of distributed data storage modules can be divided into distributed memory data systems and distributed persistent storage systems.
  • write to the persistence system write to the memory cache.
  • the distributed memory data system is used to quickly find and calculate, so as to achieve efficient data operation.
  • the memory cache data can be recovered from the persistent system to ensure data security.
  • FIG. 2 a schematic structural diagram of an embodiment of the knowledge graph system of the present application is shown, including a client 20 connected through a network and the above-mentioned graph server 10 shown in FIG. 1; wherein:
  • the client 20 is provided with a user interface 21 for receiving a user's data operation request, and sending it to the graph database interface of the graph server 10 through the network, and receiving and displaying the data operation result of the graph server 10.
  • the user interface 21 may establish a connection with the graph server 10 through protocols such as HTTP, websocket, or RPC; the data operation request may use the grammatical format of Gremlin, GSQL, or SPARQL language.
  • the knowledge graph system may also be provided with a data preprocessing module and an intermediate persistent file system, where: data preprocessing The module is used to extract the structured or unstructured original data and convert it into node data and/or edge data of the graph database.
  • the intermediate persistent file system is used to temporarily store node data and edge data processed by the data preprocessing module.
  • the above-mentioned data pre-processing module can be deployed either on the client (second data pre-processing module) or on the graph server (first data pre-processing module) according to actual needs, or on the client and Graph servers are deployed.
  • the intermediate persistent file system can select Hadoop distributed file system (HDFS, Hadoop Distributed File), simple storage service system (S3, Simple Storage Service) or object storage service system (OSS, Object Storage Service), etc. as needed.
  • HDFS Hadoop distributed file system
  • S3, Simple Storage Service simple storage service system
  • OSS Object Storage Service
  • node data and edge data can be exported separately and written into the intermediate file system. Then, read the data in the intermediate persistent file system, generate node and edge creation requests respectively, and establish a connection with the graph server, then send the request to the graph server through HTTP and other protocol methods to complete the writing of node data and edge data Into.
  • FIG. 3 a graph data storage and modification process according to an embodiment of the present application is shown, including:
  • Step S31 The data preprocessing module extracts the structured and unstructured original data, converts it into node data and/or edge data in the form of a graph database, and stores it in the intermediate persistent file system.
  • Step S32 call the graph database interface and send a request to create or update node data and edge data.
  • Step S33 The graph server responds and parses the request.
  • the graph database interface of the graph server parses the request through Gremlin syntax in the current session.
  • the request may include graph data write, modify or query operations.
  • the graph server calls the corresponding interface according to the currently requested operation type (for graph data writing and modifying requests, it is implemented by calling the graph data writing interface; for graph data query requests, it is achieved by calling the graph data query interface).
  • the graph data writing interface persists the data according to the type of data written (node, edge), and returns the unique index of the data in the distributed data storage module.
  • the graph data query interface finds the data stored in the distributed data storage module according to the conditions of the incoming query, parses it into a preset data format (node, edge) and returns.
  • the graph server establishes a connection with each storage server of the distributed data storage module at startup, and dynamically sends heartbeat monitoring to detect the availability of the storage server.
  • the graph data write interface receives the write operation request, the write information is serialized and sent to the distributed data storage module.
  • Step S34 The distributed data storage module writes the graph data to the file system or other persistent storage to complete the persistence.
  • Any storage system provided with a storage layer interface can be used as a distributed data storage module.
  • it can be a distributed database or a distributed file system.
  • the storage server needs to register with the service discovery mechanism (to ensure that the graph server can discover itself), and provides a heartbeat detection interface to report the device status in real time. Redundant data replication is implemented between storage servers to ensure fault tolerance.
  • the graph server can automatically update the configuration of the distributed data storage module through the service discovery mechanism and switch to the corresponding storage server.
  • FIG. 4 a graph data query process of an embodiment of the present application is shown, including:
  • Step S41 The user initiates a graph data query request through the user interface of the client.
  • Step S42 The graph database interface of the graph server responds and parses the query request.
  • the graph database interface may need to be disassembled into multiple query calls to the graph data query interface. For example, for the shortest path query request within 5 steps, it can be disassembled into two sub-query requests, and the output of the first sub-query is used as the input for the second sub-query.
  • the graph data query interface accesses the data on the hard disk or cached in memory according to the query conditions and the established index conditions.
  • aggregation operations such as count and avg can be pushed down to the database of the distributed data storage module to perform calculations.
  • graph calculations such as sub-graph operations and shortest path queries, it is necessary to query the database multiple times and persist the data in memory for further calculation.
  • This application can reduce the data support requirements for the underlying database by constructing a virtual graph data layer (that is, graph data writing interface and graph data query interface).
  • a virtual graph data layer that is, graph data writing interface and graph data query interface.
  • the above device embodiments are preferred embodiments, and the units and modules involved are not necessarily required by this application.
  • the embodiments in this specification are described in a progressive manner. Each embodiment focuses on the differences from other embodiments, and the same or similar parts between the embodiments may refer to each other.
  • the above-described embodiments are only schematic, wherein the modules described as separate components may or may not be physically separated, and may be located in one place or may be distributed on multiple network elements (as described above).
  • the data pre-processing module in the system embodiment is taken as an example.
  • the data pre-processing module can be deployed on the client, the graph server, or both the client and the graph server according to actual needs.) Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art can understand and implement without paying creative efforts.

Landscapes

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

Abstract

L'invention concerne un système de mappage de connaissances et un serveur de cartes afférent (10), le serveur de cartes (10) comprenant: une interface (11) de bases de données de cartes, configurée pour recevoir une demande d'opération sur données d'utilisateur, et, en fonction du type de la demande d'opération sur données, appeler une interface correspondante de façon à effectuer une opération par rapport à un module de stockage de données distribuées; une interface (12) d'écriture de données de cartes, configurée pour utiliser un type de données à écrire de façon à créer ou mettre à jour des données de noeud ou des données de bord à l'intérieur d'un module de stockage de données distribuées, et pour renvoyer un index unique desdites données dans le module de stockage de données distribuées; une interface (13) d'interrogation de données de cartes, configurée pour utiliser des conditions de requête afin d'obtenir des données stockées dans un module de stockage de données distribuées, et pour les renvoyer à un utilisateur conformément à des formats prédéfinis de données de noeud et de données de bord; et un module de stockage de données distribuées (14), configuré pour fournir des services de stockage et de requête de données à un serveur de cartes. Le système est capable de résoudre efficacement le problème des bases de données de cartes qui ne peuvent pas s'adapter à la gestion de données de cartes et à la recherche dans des environnements de mégadonnées.
PCT/CN2019/124555 2018-12-29 2019-12-11 Système de mappage de connaissances et serveur de cartes afférent WO2020135050A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811635242.2A CN109670089A (zh) 2018-12-29 2018-12-29 知识图谱系统及其图服务器
CN201811635242.2 2018-12-29

Publications (1)

Publication Number Publication Date
WO2020135050A1 true WO2020135050A1 (fr) 2020-07-02

Family

ID=66147029

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/124555 WO2020135050A1 (fr) 2018-12-29 2019-12-11 Système de mappage de connaissances et serveur de cartes afférent

Country Status (2)

Country Link
CN (1) CN109670089A (fr)
WO (1) WO2020135050A1 (fr)

Families Citing this family (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109670089A (zh) * 2018-12-29 2019-04-23 颖投信息科技(上海)有限公司 知识图谱系统及其图服务器
CN110427359A (zh) * 2019-06-27 2019-11-08 苏州浪潮智能科技有限公司 一种图数据处理方法和装置
CN110347711B (zh) * 2019-07-10 2022-02-08 北京百度网讯科技有限公司 分碎片存储的图数据库查询方法及装置
CN110489986B (zh) * 2019-08-22 2021-03-23 网易（杭州）网络有限公司 图数据功能的响应方法、系统及电子设备
CN110717056B (zh) * 2019-09-03 2023-05-23 平安科技（深圳）有限公司 Noe4j图数据库的更新维护方法、装置及计算机可读存储介质
CN110598059B (zh) * 2019-09-16 2022-07-05 北京百度网讯科技有限公司 数据库操作方法及装置
CN110941619B (zh) * 2019-12-02 2023-05-16 浪潮软件股份有限公司 针对多种使用场景的图数据存储模型和结构的定义方法
CN111090653B (zh) * 2019-12-20 2023-12-15 东软集团股份有限公司 一种数据缓存方法、装置及相关产品
CN111177189B (zh) * 2019-12-20 2024-04-05 北京航天云路有限公司 一种基于用户行为分析的客户端优化系统及方法
CN111177478A (zh) * 2019-12-24 2020-05-19 北京明略软件系统有限公司 一种查询方法、装置及系统
CN111274333A (zh) * 2020-01-20 2020-06-12 北京明略软件系统有限公司 图谱关系更新方法、装置、服务器和存储介质
CN111309750A (zh) * 2020-03-31 2020-06-19 中国邮政储蓄银行股份有限公司 图数据库的数据更新方法和装置
CN111538854B (zh) * 2020-04-27 2023-08-08 北京百度网讯科技有限公司 搜索方法及装置
CN111897971B (zh) * 2020-07-29 2023-04-07 中国电力科学研究院有限公司 一种适用于电网调度控制领域的知识图谱管理方法及系统
CN112182238B (zh) * 2020-09-22 2022-12-27 苏州浪潮智能科技有限公司 一种基于图数据库的知识图谱构建系统和方法
CN112256927B (zh) * 2020-10-21 2024-06-04 网易（杭州）网络有限公司 基于属性图的知识图谱数据处理方法和装置
CN113177142A (zh) * 2021-03-23 2021-07-27 杭州费尔斯通科技有限公司 一种扩展图数据库存储结构方法、系统、设备和储存介质
CN113468275A (zh) * 2021-07-28 2021-10-01 浙江大华技术股份有限公司 图数据库的数据导入方法和装置、存储介质及电子设备
CN115203488B (zh) * 2022-09-15 2022-12-06 国网智能电网研究院有限公司 一种图数据库管理方法、装置及电子设备

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105210058A (zh) * 2012-12-14 2015-12-30 微软技术许可有限责任公司 使用多个引擎来进行图查询处理
CN106354729A (zh) * 2015-07-16 2017-01-25 阿里巴巴集团控股有限公司 一种图数据处理方法、装置和系统
CN206003092U (zh) * 2016-05-30 2017-03-08 深圳市华傲数据技术有限公司 图数据库系统
CN106484824A (zh) * 2016-09-28 2017-03-08 华东师范大学 基于多元数据库支持组件的知识图谱异构存储框架中间件
CN107832323A (zh) * 2017-09-14 2018-03-23 北京知道未来信息技术有限公司 一种基于图数据库的分布式实现系统及方法
US10102291B1 (en) * 2015-07-06 2018-10-16 Google Llc Computerized systems and methods for building knowledge bases using context clouds
CN109670089A (zh) * 2018-12-29 2019-04-23 颖投信息科技(上海)有限公司 知识图谱系统及其图服务器

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6076092A (en) * 1997-08-19 2000-06-13 Sun Microsystems, Inc. System and process for providing improved database interfacing using query objects
CN103425793B (zh) * 2013-08-28 2017-03-01 五八同城信息技术有限公司 用于即时通讯系统中利用数据库存储层访问数据库的方法
CN104573086A (zh) * 2015-01-28 2015-04-29 浪潮集团有限公司 一种数据库访问构件及一种数据库访问构件的生成方法

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105210058A (zh) * 2012-12-14 2015-12-30 微软技术许可有限责任公司 使用多个引擎来进行图查询处理
US10102291B1 (en) * 2015-07-06 2018-10-16 Google Llc Computerized systems and methods for building knowledge bases using context clouds
CN106354729A (zh) * 2015-07-16 2017-01-25 阿里巴巴集团控股有限公司 一种图数据处理方法、装置和系统
CN206003092U (zh) * 2016-05-30 2017-03-08 深圳市华傲数据技术有限公司 图数据库系统
CN106484824A (zh) * 2016-09-28 2017-03-08 华东师范大学 基于多元数据库支持组件的知识图谱异构存储框架中间件
CN107832323A (zh) * 2017-09-14 2018-03-23 北京知道未来信息技术有限公司 一种基于图数据库的分布式实现系统及方法
CN109670089A (zh) * 2018-12-29 2019-04-23 颖投信息科技(上海)有限公司 知识图谱系统及其图服务器

Also Published As

Publication number Publication date
CN109670089A (zh) 2019-04-23

Similar Documents

Publication Publication Date Title
WO2020135050A1 (fr) Système de mappage de connaissances et serveur de cartes afférent
US11461356B2 (en) Large scale unstructured database systems
US11531682B2 (en) Federated search of multiple sources with conflict resolution
WO2020228801A1 (fr) Procédé de requête de fusion multilingue et système de base de données multimodèle
CN109299102B (zh) 一种基于Elastcisearch的HBase二级索引系统及方法
EP3365805B1 (fr) Abilitée pour grouper multiple banque des donnees du type container dans un seul cluster
US10803078B2 (en) Ability to group multiple container databases as a single container database cluster
US10565199B2 (en) Massively parallel processing database middleware connector
US8239423B2 (en) System and method for semantic exposure of data stored in a dynamic schema
US20120158655A1 (en) Non-relational function-based data publication for relational data
US20140214897A1 (en) SYSTEMS AND METHODS FOR ACCESSING A NoSQL DATABASE USING BUSINESS INTELLIGENCE TOOLS
US20160224570A1 (en) Archiving indexed data
US11030242B1 (en) Indexing and querying semi-structured documents using a key-value store
US9135297B2 (en) Database translation system and method
CN107506464A (zh) 一种基于ES实现HBase二级索引的方法
US20150154259A1 (en) Sql query on a nosql database
WO2019226328A1 (fr) Analyse de données sur la combinaison de données relationnelles et de mégadonnées
US11507591B2 (en) Methods, systems, and computer readable mediums for command engine execution
US9047354B2 (en) Statement categorization and normalization
WO2015094195A1 (fr) Moteur d'interrogation de transaction
US20210081451A1 (en) Persisted queries and batch streaming
US8868495B2 (en) System and method for indexing user data on storage systems
US11526516B2 (en) Method, apparatus, device and storage medium for generating and processing a distributed graph database
US10599728B1 (en) Metadata agent for query management
US11789971B1 (en) Adding replicas to a multi-leader replica group for a data set

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

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

Country of ref document: EP

Kind code of ref document: A1