WO2017114455A1 - Data processing method and system based on graph - Google Patents
Data processing method and system based on graph Download PDFInfo
- Publication number
- WO2017114455A1 WO2017114455A1 PCT/CN2016/112957 CN2016112957W WO2017114455A1 WO 2017114455 A1 WO2017114455 A1 WO 2017114455A1 CN 2016112957 W CN2016112957 W CN 2016112957W WO 2017114455 A1 WO2017114455 A1 WO 2017114455A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- graph
- vertex
- key
- index
- 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
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
-
- 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/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
Definitions
- Embodiments of the present invention relate to data analysis and, in particular, to graph-based data processing methods and systems.
- a graph-based data processing method which maintains a graph in which an object is a vertex, and the association information between the object and the object is an edge, and the method includes: maintaining vertex information and side information,
- the vertex information is key information about the object, and maintains one of the key information of the object as a key, and the position information of the object in the figure as an index of the auxiliary information.
- the vertex information of the object in the graph is updated in real time.
- the position of the first object in the figure is located by using the index by the key information of the first object, and the location associated with the first object is found according to the position of the first object in the figure.
- Other objects are possible.
- the map and the index are stored by a distributed architecture.
- the object comprises a bank card user and a merchant.
- a graph-based data processing system configured to maintain a graph in which an object is a vertex, and an association information between the object and the object is an edge
- the system comprising: a graph storage module, It is used to maintain vertex information and edge information.
- the vertex information is key information of the object.
- the indexing module is used to maintain an index that uses one of the key information of the object as a key and the position information of the object in the figure as an auxiliary information. .
- the system includes a data update module configured to update vertex information of the object in the map in real time as the key information of the object changes.
- the system includes: a graph analysis module configured to: use the index module to locate a position of the first object in the map by using key information of the first object, based on the graph storage module, Find other objects associated with the first object based on the location of the first object in the map.
- the system is configured to store the map and the index through a distributed architecture.
- the technical solution of the present invention effectively improves the timeliness of data by shortening the time of data update and data analysis. Effectively solve the timeliness of traditional technology in big data analysis and service. In the context of big data services, the value of the data is greater.
- FIG. 1 is a schematic diagram of a graph-based data processing system in accordance with an embodiment of the present invention.
- FIG. 2 is a flow chart of a graph-based data processing method in accordance with an embodiment of the present invention.
- V is a non-empty finite set representing vertices (nodes)
- E is a set of edges, generally represented by (Vx, Vy), where Vx, Vy belong to V. If there is an edge connection between the two nodes U and V, the two nodes U and V are said to be associated.
- a weighted graph can be used to represent relationships other than the connected relationship between two adjacent vertices.
- the present invention proposes to maintain a graph in which an object is a vertex and the associated information between the object and the object is an edge, so that the association analysis between the object (individual) based on the association model and the algorithm of the graph improves the data analysis. Performance and efficiency.
- the individual may be a user such as a bank card or any user who uses a web service (e.g., online shopping).
- FIG. 1 is a schematic diagram of a graph-based data processing system in accordance with an embodiment of the present invention.
- a graph-based data processing system shown in dashed lines, may include a graph storage module, an index module, and a graph analysis module.
- a graph storage module for maintaining vertex information and side information, the vertex information being key information of the object.
- the key information of the object may include a user ID, a user age range, or a consumption event; for example, when the object is a merchant, the key information of the object may include a merchant ID, a merchant type, and the like.
- the association information between the side information object and the object for example, based on an association event between the user and the merchant.
- the vertices and side information of the graph can be stored based on a distributed architecture.
- the indexing module is configured to maintain an index of the key information of the object (for example, a user ID or a merchant ID) as a key, and the location information of the object in the figure as an auxiliary information.
- the location information indicates a positional relationship with other objects in a storage structure (for example, an adjacency matrix, an adjacency list, and the like) of the object corresponding to the vertex corresponding to the object.
- the graph analysis module can quickly locate the position of the object in the graph through the index. As shown, the index can be stored based on a distributed architecture.
- a graph analysis module configured to locate the first portion by using the index module by key information of the first object a location of an object in the map; and based on the map storage module, finding other objects associated with the first object based on the location of the first object in the map.
- the object can be analyzed using various algorithms associated with the graph.
- the update operation and the analysis operation can be performed efficiently based on the graph storage module, the index module, and the graph analysis module.
- the update operation when the key information of the object changes, the vertex information of the object in the graph is updated in real time.
- an update module can be set up in the graph based data processing system.
- an external request may be received, and then the location information of the user in the graph is obtained by the index module according to the user ID included in the request, and then the analysis result is obtained by using the location information by using the map analysis module.
- the analysis results obtained are provided externally as service information.
- the exemplary embodiments can be implemented in hardware, software, or a combination thereof. For example, some aspects of the invention may be implemented in hardware, while other aspects may be implemented in software. Although aspects of the exemplary embodiments of the present invention may be shown and described as a block diagram, a flowchart, it is well understood that the devices or methods described herein may be implemented in a system as a non-limiting example as functional module. Furthermore, the above-described apparatus should not be construed as requiring such separation in all embodiments, but it should be understood that the described program components and systems can generally be integrated into a single software product or packaged into multiple software products. .
- step 201 the map in which the object is a vertex and the association information between the object and the object is an edge is maintained.
- step 202 the location of the object in the map is located based on the vertex information in the external request.
- step 203 the relationship between the object and other objects is analyzed based on the location of the location.
- vertex information and side information are maintained, the vertex information is key information about the object, and one of the key information of the object is maintained as a key, and the position information of the object in the figure is The index of the auxiliary information.
- step 202 when the key information of the object changes, the vertex information of the object in the graph is updated in real time.
- the position of the first object in the figure is located by using the index of the key information of the first object, and the location associated with the first object is found according to the position of the first object in the figure. Its It's an object.
- a user object can be associated with multiple business objects.
- the various blocks shown in FIG. 2 may be considered as method steps, and/or considered to be operations resulting from the execution of computer program code, and/or as a plurality of coupled logic circuit elements that are constructed to perform the relevant functions.
- the operations are depicted in the figures in a particular order, this should not be construed as requiring that the operations are performed in the particular order shown or in the order of the order, or that all illustrated operations are performed to achieve the desired results. In some cases, multitasking parallel processing may be advantageous.
- the following is an example process for graph-based data processing methods and systems for data analysis.
- the key information of the object to which the data is written is the information of the vertex in the graph storage, the graph is updated by the graph storage module, and then the data is written into the distributed memory;
- One of the key information of the object to which the data is written is an index key, and the location information stored in the figure is used as auxiliary information, and the data is written and updated by the index module, and then the data is stored in the distribution.
- the memory In the memory;
- the index service is used to build fast object access capabilities, and the relationship between objects is constructed through graph services to support real-time analysis of large-scale data.
- index service to quickly locate the location information of the object in the graph by using one of the key information of the object to be accessed as a key
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
本发明的实施例涉及数据分析，并且具体地涉及基于图的数据处理方法和系统。Embodiments of the present invention relate to data analysis and, in particular, to graph-based data processing methods and systems.
现有的数据分析或者数据挖掘方法通常采用离线分析的方式。传统的数据处理模型和算法的缺点包括：不能在获取实时数据的同时，对数据进行有效的分析；以及不能快速地响应外部请求，基于最新的数据对外提供服务。Existing data analysis or data mining methods usually use off-line analysis. The shortcomings of traditional data processing models and algorithms include: the ability to efficiently analyze data while acquiring real-time data; and the inability to respond quickly to external requests, providing services based on the latest data.
例如，现有的方案在对外提供数据服务时，往往需要对数据进行离线预处理和加工，将分析的结果存储在关系型数据库中。然后，响应于外部的请求，从该关系数据库中读取分析的结果。数据库中的分析结果需要被定期更新。在大数据场景下，这种方案会降低数据分析服务的效率和时效性。For example, when an existing solution provides data services externally, it is often necessary to offline preprocess and process the data, and store the analysis result in a relational database. The results of the analysis are then read from the relational database in response to an external request. The results of the analysis in the database need to be updated regularly. In a big data scenario, this approach can reduce the efficiency and timeliness of data analysis services.
发明内容Summary of the invention
根据本发明的一个实施例，公开一种基于图的数据处理方法，维护以对象为顶点，对象与对象之间的关联信息为边的图，该方法包括：维护顶点信息和边信息，所述顶点信息是关于对象的关键信息，维护以对象的关键信息中的一项为键、以对象在该图中的位置信息为辅助信息的索引。According to an embodiment of the present invention, a graph-based data processing method is disclosed, which maintains a graph in which an object is a vertex, and the association information between the object and the object is an edge, and the method includes: maintaining vertex information and side information, The vertex information is key information about the object, and maintains one of the key information of the object as a key, and the position information of the object in the figure as an index of the auxiliary information.
根据本发明的一个实施例，当对象的关键信息发生变化时，实时地更新该对象在该图中的顶点信息。According to an embodiment of the present invention, when the key information of the object changes, the vertex information of the object in the graph is updated in real time.
根据本发明的一个实施例，通过第一对象的关键信息利用该索引定位该第一对象在该图中的位置，根据该第一对象在该图中的位置找出与该第一对象关联的其它对象。According to an embodiment of the present invention, the position of the first object in the figure is located by using the index by the key information of the first object, and the location associated with the first object is found according to the position of the first object in the figure. Other objects.
根据本发明的一个实施例，通过分布式架构存储所述图和所述索引。 According to one embodiment of the invention, the map and the index are stored by a distributed architecture.
根据本发明的一个实施例，所述对象包括银行卡用户和商户。According to an embodiment of the invention, the object comprises a bank card user and a merchant.
根据本发明的一个实施例，公开一种基于图的数据处理系统，该系统被配置成维护以对象为顶点，对象与对象之间的关联信息为边的图，该系统包括：图存储模块，用于维护顶点信息和边信息，该顶点信息是对象的关键信息，索引模块，用于维护以对象的关键信息中的一项为键、以对象在该图中的位置信息为辅助信息的索引。According to an embodiment of the present invention, a graph-based data processing system is disclosed, the system configured to maintain a graph in which an object is a vertex, and an association information between the object and the object is an edge, the system comprising: a graph storage module, It is used to maintain vertex information and edge information. The vertex information is key information of the object. The indexing module is used to maintain an index that uses one of the key information of the object as a key and the position information of the object in the figure as an auxiliary information. .
根据本发明的一个实施例，该系统包括：数据更新模块，其被配置成当对象的关键信息发生变化时，实时地更新该对象在该图中的顶点信息。In accordance with an embodiment of the present invention, the system includes a data update module configured to update vertex information of the object in the map in real time as the key information of the object changes.
根据本发明的一个实施例，该系统包括：图分析模块，其被配置成：通过第一对象的关键信息利用该索引模块定位该第一对象在该图中的位置，基于该图存储模块，根据该第一对象在该图中的位置找出与该第一对象关联的其它对象。According to an embodiment of the present invention, the system includes: a graph analysis module configured to: use the index module to locate a position of the first object in the map by using key information of the first object, based on the graph storage module, Find other objects associated with the first object based on the location of the first object in the map.
根据本发明的一个实施例，该系统被配置成：通过分布式架构存储所述图和所述索引。According to an embodiment of the invention, the system is configured to store the map and the index through a distributed architecture.
本发明的技术方案通过缩短数据更新以及数据分析的时间，有效提升数据的时效性。有效解决了传统技术在大数据分析和服务方面的时效性问题。在大数据服务的场景下，更大地发挥数据的价值。The technical solution of the present invention effectively improves the timeliness of data by shortening the time of data update and data analysis. Effectively solve the timeliness of traditional technology in big data analysis and service. In the context of big data services, the value of the data is greater.
当结合附图阅读以下描述时也将理解本发明的实施例的其它特征和优势，其中附图借助于实例示出了本发明的实施例的原理。Other features and advantages of the embodiments of the present invention will be understood from the description of the appended claims.
图1是根据本发明实施例的基于图的数据处理系统的示意图。1 is a schematic diagram of a graph-based data processing system in accordance with an embodiment of the present invention.
图2是根据本发明实施例的基于图的数据处理方法的流程图。2 is a flow chart of a graph-based data processing method in accordance with an embodiment of the present invention.
在下文中，将结合实施例描述本发明的原理。应当理解的是，给出的实施例只是为了本领域技术人员更好地理解并且实践本发明，而不是限制本发明的范 围。例如，本说明书中包含许多具体的实施细节不应被解释为对发明的范围或可能被要求保护的范围的限制，而是应该被视为特定于实施例的描述。例如，在各实施例的上下文描述的特征可被组合在单一实施例中来实施。在单一实施例的上下文中描述的特征可在多个实施例来实施。Hereinafter, the principles of the present invention will be described in conjunction with the embodiments. It is to be understood that the embodiments are presented only to provide a better understanding and Wai. For example, many specific implementation details are included in the description, and should not be construed as limiting the scope of the invention or the scope of the invention. For example, features described in the context of various embodiments can be implemented in a single embodiment. Features described in the context of a single embodiment can be implemented in various embodiments.
本发明提出基于图存储模型对要处理的数据进行实时存储和更新。图是一种数据结构，定义为：graph＝(V，E)。V是一个非空有限集合，代表顶点(节点)，E代表边的集合，一般用(Vx，Vy)表示，其中，Vx，Vy属于V。若两个结点U、V之间有一条边连接，则称这两个结点U、V是关联的。可以用带权图表示两个相邻顶点之间的除连接关系以外的其它关系。基于这样的概念，本发明提出维护以对象为顶点，对象与对象之间的关联信息为边的图，以便基于图的关联模型和算法进行对象(个体)之间的关联分析来提高数据分析的性能和效率。在本发明中，个体可以是例如银行卡的用户或者任何使用网络服务(例如，网上购物)的用户。The present invention proposes real-time storage and update of data to be processed based on a graph storage model. A graph is a data structure defined as: graph = (V, E). V is a non-empty finite set representing vertices (nodes), and E is a set of edges, generally represented by (Vx, Vy), where Vx, Vy belong to V. If there is an edge connection between the two nodes U and V, the two nodes U and V are said to be associated. A weighted graph can be used to represent relationships other than the connected relationship between two adjacent vertices. Based on such a concept, the present invention proposes to maintain a graph in which an object is a vertex and the associated information between the object and the object is an edge, so that the association analysis between the object (individual) based on the association model and the algorithm of the graph improves the data analysis. Performance and efficiency. In the present invention, the individual may be a user such as a bank card or any user who uses a web service (e.g., online shopping).
图1是根据本发明实施例的基于图的数据处理系统的示意图。如图1所示，以虚线示出的基于图的数据处理系统，其可以包括图存储模块、索引模块、图分析模块。1 is a schematic diagram of a graph-based data processing system in accordance with an embodiment of the present invention. As shown in FIG. 1, a graph-based data processing system, shown in dashed lines, may include a graph storage module, an index module, and a graph analysis module.
图存储模块，用于维护顶点信息和边信息，该顶点信息是对象的关键信息。例如，当对象是银行卡用户时，对象的关键信息可以包括用户ID、用户年龄范围、或者消费事件；例如，当对象是商户时，对象的关键信息可以包括商户ID、商户类型等。边信息对象与对象之间的关联信息，例如基于用户和商户之间的消费事件产生的关联。如图所示，可以基于分布式架构存储所述图的顶点和边信息。A graph storage module for maintaining vertex information and side information, the vertex information being key information of the object. For example, when the object is a bank card user, the key information of the object may include a user ID, a user age range, or a consumption event; for example, when the object is a merchant, the key information of the object may include a merchant ID, a merchant type, and the like. The association information between the side information object and the object, for example, based on an association event between the user and the merchant. As shown, the vertices and side information of the graph can be stored based on a distributed architecture.
索引模块，用于维护以对象的关键信息的一项(例如，用户ID或者商户ID)为键、以对象在该图中的位置信息为辅助信息的索引。这里，位置信息指示该对象所对应的顶点在图的存储结构(例如，邻接矩阵、邻接表等)中的与其它对象的位置关系。图分析模块通过索引能够快速定位对象在图中的位置。如图所示，可以基于分布式架构存储所述索引。The indexing module is configured to maintain an index of the key information of the object (for example, a user ID or a merchant ID) as a key, and the location information of the object in the figure as an auxiliary information. Here, the location information indicates a positional relationship with other objects in a storage structure (for example, an adjacency matrix, an adjacency list, and the like) of the object corresponding to the vertex corresponding to the object. The graph analysis module can quickly locate the position of the object in the graph through the index. As shown, the index can be stored based on a distributed architecture.
图分析模块，其被配置成通过第一对象的关键信息利用该索引模块定位该第 一对象在该图中的位置；以及基于该图存储模块，根据该第一对象在该图中的位置找出与该第一对象关联的其它对象。优选地，可以利用与图相关的各种算法来分析该对象。a graph analysis module configured to locate the first portion by using the index module by key information of the first object a location of an object in the map; and based on the map storage module, finding other objects associated with the first object based on the location of the first object in the map. Preferably, the object can be analyzed using various algorithms associated with the graph.
基于图存储模块、索引模块、图分析模块可以高效地进行更新操作和分析操作。在更新操作过程中，当对象的关键信息发生变化时，实时地更新该对象在该图中的顶点信息。可选地，可以在基于图的数据处理系统设立更新模块。在分析操作过程中，可以接收外部请求，然后根据该请求包含的用户ID，通过索引模块得到该用户在图中的位置信息，然后利用该位置信息借助图分析模块的计算得到分析结果。得到的分析结果作为服务信息对外部提供。The update operation and the analysis operation can be performed efficiently based on the graph storage module, the index module, and the graph analysis module. During the update operation, when the key information of the object changes, the vertex information of the object in the graph is updated in real time. Alternatively, an update module can be set up in the graph based data processing system. During the analysis operation, an external request may be received, and then the location information of the user in the graph is obtained by the index module according to the user ID included in the request, and then the analysis result is obtained by using the location information by using the map analysis module. The analysis results obtained are provided externally as service information.
示例性实施例可在硬件、软件或其组合中来实施。例如，本发明的某些方面可在硬件中实施，而其它方面则可在软件中实施。尽管本发明的示例性实施例的方面可被示出和描述为框图、流程图，但很好理解的是，这里描述的这些装置、或方法可在作为非限制性实例的系统中被实现为功能模块。此外，上述装置不应被理解为要求在所有的实施例中进行这种分离，而应该被理解为所描述的程序组件和系统通常可以被集成在单一的软件产品中或打包成多个软件产品。The exemplary embodiments can be implemented in hardware, software, or a combination thereof. For example, some aspects of the invention may be implemented in hardware, while other aspects may be implemented in software. Although aspects of the exemplary embodiments of the present invention may be shown and described as a block diagram, a flowchart, it is well understood that the devices or methods described herein may be implemented in a system as a non-limiting example as functional module. Furthermore, the above-described apparatus should not be construed as requiring such separation in all embodiments, but it should be understood that the described program components and systems can generally be integrated into a single software product or packaged into multiple software products. .
图2是根据本发明实施例的基于图的数据处理方法的流程图。如图所示，在步骤201中，维护以对象为顶点，对象与对象之间的关联信息为边的图。在步骤202中，根据外部请求中的顶点信息，定位对象在图中的位置。在步骤203中，根据定位的位置，分析该对象与其它对象之间的关系。2 is a flow chart of a graph-based data processing method in accordance with an embodiment of the present invention. As shown in the figure, in
优选地，在步骤201中，维护顶点信息和边信息，所述顶点信息是关于对象的关键信息，以及维护以对象的关键信息中的一项为键、以对象在该图中的位置信息为辅助信息的索引。Preferably, in
优选地，在步骤202中，当对象的关键信息发生变化时，实时地更新该对象在该图中的顶点信息。Preferably, in
优选地，在步骤203中，通过第一对象的关键信息利用该索引定位该第一对象在该图中的位置，根据该第一对象在该图中的位置找出与该第一对象关联的其
它对象。例如，一个用户对象可以与多个商户对象关联。Preferably, in
图2所示的各个框可被视为方法步骤、和/或被视为由于运行计算机程序代码而导致的操作、和/或被视为构建为实施相关功能的多个耦合的逻辑电路元件。尽管操作按特定的顺序在图中被描绘，但这不应被理解为要求按照所示的特定顺序或按依次顺序来执行这些操作，或要求所有例示的操作被执行，以达到理想的结果。在某些情况下，多任务并行处理可能是有利的。The various blocks shown in FIG. 2 may be considered as method steps, and/or considered to be operations resulting from the execution of computer program code, and/or as a plurality of coupled logic circuit elements that are constructed to perform the relevant functions. Although the operations are depicted in the figures in a particular order, this should not be construed as requiring that the operations are performed in the particular order shown or in the order of the order, or that all illustrated operations are performed to achieve the desired results. In some cases, multitasking parallel processing may be advantageous.
以下是基于图的数据处理方法和系统进行数据分析的示例过程。The following is an example process for graph-based data processing methods and systems for data analysis.
A.数据实时写入更新A. Data write update in real time
1.通过对外提供的数据写入接口服务将数据写入系统，该接口服务通过分布式架构对外提供高并发的数据写入能力；1. Write data to the system through the externally provided data writing interface service, and the interface service provides high concurrent data writing capability through the distributed architecture;
2.以写入数据的对象的关键信息为图存储中顶点的信息，通过图存储模块进行图的更新，然后将数据写入到分布式存储器中；2. The key information of the object to which the data is written is the information of the vertex in the graph storage, the graph is updated by the graph storage module, and then the data is written into the distributed memory;
3.以写入数据的对象的关键信息的一项为索引关键字，以该对象在图中存储的位置信息作为辅助信息，通过索引模块进行数据的写入和更新，然后将数据存储在分布式存储器中；3. One of the key information of the object to which the data is written is an index key, and the location information stored in the figure is used as auxiliary information, and the data is written and updated by the index module, and then the data is stored in the distribution. In the memory;
由此，通过索引服务构建快速的对象访问能力，通过图服务构建对象之间的关联关系，以支撑大规模数据的实时分析。Thus, the index service is used to build fast object access capabilities, and the relationship between objects is constructed through graph services to support real-time analysis of large-scale data.
B.数据实时读取分析B. Data real-time reading analysis
1.通过对外提供的数据读取分析接口服务提供面向对象的实时分析服务，该接口服务通过分布式架构对外提供高并发的数据分析能力；1. Providing object-oriented real-time analysis service through externally provided data reading and analysis interface service, which provides high-concurrency data analysis capability through distributed architecture;
2.以需要访问的对象关键信息的一项为关键字，利用索引服务快速定位该对象在图中的位置信息；2. Using the index service to quickly locate the location information of the object in the graph by using one of the key information of the object to be accessed as a key;
3.通过获取的对象在图中的位置信息，对该对象进行数据分析和挖掘，例如，通过广度优先遍历算法进行对象的关联分析，快速识别该对象的潜在喜好对象(例如，合适于该用户的潜在商户)；3. Performing data analysis and mining on the object by obtaining the position information of the object in the figure, for example, performing an association analysis of the object through a breadth-first traversal algorithm, and quickly identifying a potential favorite object of the object (for example, suitable for the user) Potential merchants);
由此，能够通过接口服务返回外部所需要的分析结果，基于分布式架构和高 并发处理能力保障可靠的服务能力。Thereby, it is possible to return the analysis results required externally through the interface service, based on the distributed architecture and high Concurrent processing capabilities guarantee reliable service capabilities.
相关领域的技术人员当结合附图阅读前述说明书时，对本发明的前述示例性实施例的各种修改和变形对于相关领域的技术人员会变得明显。因此，本发明的实施例不限于所公开的特定实施例，并且变形例和其它实施例意在涵盖在所附权利要求的范围内。 Various modifications and variations of the above-described exemplary embodiments of the present invention will become apparent to those skilled in Therefore, the embodiments of the invention are not limited to the specific embodiments disclosed, and the modifications and other embodiments are intended to be included within the scope of the appended claims.
Claims (10)
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511031504.0 | 2015-12-31 | ||
| CN201511031504.0A CN105677801B (en) | 2015-12-31 | 2015-12-31 | A graph-based data processing method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2017114455A1 true WO2017114455A1 (en) | 2017-07-06 |
Family
ID=56298495
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2016/112957 Ceased WO2017114455A1 (en) | 2015-12-31 | 2016-12-29 | Data processing method and system based on graph |
Country Status (3)
| Country | Link |
|---|---|
| CN (1) | CN105677801B (en) |
| TW (1) | TWI686704B (en) |
| WO (1) | WO2017114455A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105677801B (en) * | 2015-12-31 | 2021-06-08 | 中国银联股份有限公司 | A graph-based data processing method and system |
| CN107679160A (en) * | 2017-09-28 | 2018-02-09 | 深圳市华傲数据技术有限公司 | Data processing method and device based on chart database |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5761664A (en) * | 1993-06-11 | 1998-06-02 | International Business Machines Corporation | Hierarchical data model for design automation |
| CN103345508A (en) * | 2013-07-04 | 2013-10-09 | 北京大学 | Data storage method and system suitable for social network graph |
| CN104809249A (en) * | 2015-05-18 | 2015-07-29 | 北京嘀嘀无限科技发展有限公司 | Processing method and system of data structure |
| CN105677801A (en) * | 2015-12-31 | 2016-06-15 | 中国银联股份有限公司 | Data processing method and system based on graph |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8346474B2 (en) * | 2008-08-28 | 2013-01-01 | Honeywell International Inc. | Method of route retrieval |
| US8527496B2 (en) * | 2010-02-11 | 2013-09-03 | Facebook, Inc. | Real time content searching in social network |
| TWI432985B (en) * | 2011-01-19 | 2014-04-01 | Univ Nat Cheng Kung | Quantifying method for intrinsic data transfer rate of algorithms |
| US8984019B2 (en) * | 2012-11-20 | 2015-03-17 | International Business Machines Corporation | Scalable summarization of data graphs |
| TWI515576B (en) * | 2013-12-30 | 2016-01-01 | 財團法人工業技術研究院 | Method and system for data dispatch processing in a big data system |
| CN104915879B (en) * | 2014-03-10 | 2019-08-13 | 华为技术有限公司 | Method and device for social relationship mining based on financial data |
| CN105005931A (en) * | 2014-04-24 | 2015-10-28 | 中国银联股份有限公司 | Method and device for controlling risk of transfer transaction |
| CN105205104A (en) * | 2015-08-26 | 2015-12-30 | 成都布林特信息技术有限公司 | Cloud platform data acquisition method |
-
2015
- 2015-12-31 CN CN201511031504.0A patent/CN105677801B/en active Active
-
2016
- 2016-12-27 TW TW105143384A patent/TWI686704B/en active
- 2016-12-29 WO PCT/CN2016/112957 patent/WO2017114455A1/en not_active Ceased
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5761664A (en) * | 1993-06-11 | 1998-06-02 | International Business Machines Corporation | Hierarchical data model for design automation |
| CN103345508A (en) * | 2013-07-04 | 2013-10-09 | 北京大学 | Data storage method and system suitable for social network graph |
| CN104809249A (en) * | 2015-05-18 | 2015-07-29 | 北京嘀嘀无限科技发展有限公司 | Processing method and system of data structure |
| CN105677801A (en) * | 2015-12-31 | 2016-06-15 | 中国银联股份有限公司 | Data processing method and system based on graph |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105677801B (en) | 2021-06-08 |
| CN105677801A (en) | 2016-06-15 |
| TWI686704B (en) | 2020-03-01 |
| TW201730785A (en) | 2017-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210049209A1 (en) | Distributed graph embedding method and apparatus, device, and system | |
| CN110431560B (en) | Target person searching method, device, equipment and medium | |
| US11501110B2 (en) | Descriptor learning method for the detection and location of objects in a video | |
| TWI621989B (en) | Graph-based method and system for analyzing users | |
| CN102567399A (en) | Method and device for accessing database | |
| CN111061740A (en) | A data synchronization method, device and storage medium | |
| CN111461164A (en) | Sample data set capacity expansion method and model training method | |
| CN113836238A (en) | Method and device for batch processing of data commands | |
| US10423625B2 (en) | Exactly-once semantics for streaming analytics in non-idempotent output operations | |
| CN111475736A (en) | Community mining method, device and server | |
| TWI686704B (en) | Graph-based data processing method and system | |
| CN115115433B (en) | Order data processing method, device, computer equipment and storage medium | |
| CN114781517A (en) | Risk identification method, device and terminal equipment | |
| WO2024255306A1 (en) | Image reconstruction method and apparatus, device, and storage medium | |
| US11843523B1 (en) | Microservices anti-pattern discovery | |
| CN114237977B (en) | Transaction rollback method, apparatus, computer device and storage medium | |
| CN117390098A (en) | Data analysis method, device, computer equipment and storage medium | |
| HK1226157A1 (en) | A graph-based data processing method and system | |
| HK1226157B (en) | A graph-based data processing method and system | |
| CN116932677B (en) | Address information matching method, device, computer equipment and storage medium | |
| CN113051441A (en) | Storage design and management method of entity object | |
| WO2015045091A1 (en) | Method and program for extraction of super-structure in structural learning of bayesian network | |
| CN106407300B (en) | Mass traffic data storage method | |
| CN112785544B (en) | Plane extraction method and system of three-dimensional line segment model and electronic equipment | |
| CN118568300A (en) | Method, device, equipment and medium for detecting strongly connected components in graphic computing |
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: 16881244 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: 16881244 Country of ref document: EP Kind code of ref document: A1 |