CN114265889A - Disciplinary knowledge data processing method and device based on knowledge graph - Google Patents
Disciplinary knowledge data processing method and device based on knowledge graph Download PDFInfo
- Publication number
- CN114265889A CN114265889A CN202111446544.7A CN202111446544A CN114265889A CN 114265889 A CN114265889 A CN 114265889A CN 202111446544 A CN202111446544 A CN 202111446544A CN 114265889 A CN114265889 A CN 114265889A
- Authority
- CN
- China
- Prior art keywords
- knowledge
- query
- graph
- directed graph
- relational database
- 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.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a discipline knowledge data processing method and a device based on a knowledge graph, wherein the method comprises the following steps: configuring a simplified, edge-tagged, directed graph as a data model representing a resource description framework document; wherein the directed graph is used as a knowledge representation model in the knowledge graph; configuring a query path mechanism of the directed graph to clarify a retrieved query range; acquiring subject knowledge input through a front end, analyzing and constructing the subject knowledge to convert the subject knowledge into a logical format of a directed graph, and storing the logical format of the directed graph into a relational database for storage; when in query, the query statement is analyzed and converted into an SQL statement queried for the relational database; then presenting the obtained query result at the front end in an associated knowledge form; the beneficial effects are as follows: the step of ontology modeling of knowledge in each field is avoided; the relational database is easy to store; and the query of the knowledge graph is easy to realize.
Description
Technical Field
The invention relates to the technical field of software, in particular to a disciplinary knowledge data processing method and device based on a knowledge graph.
Background
The discipline knowledge map is constructed, and the method has important significance for constructing digital education resources, supporting individualized digital learning of students, accurate and intelligent teaching of teachers and education modernization treatment. In 2021, month 7, explicit requirements of guidance opinions about construction of high-quality education support system for advancing novel infrastructure construction of education issued by six departments such as education department are as follows: "… … step-by-step construction of a national unified discipline knowledge graph. Classifying and identifying the existing resources, and matching with a disciplinary knowledge map … … "
At present, no unified standard exists in the field of data structure modeling of the knowledge graph, and the data structure of the knowledge graph determines the retrieval accuracy and recall rate. Especially for the knowledge graph of the primary and secondary school disciplines, the storage mode of the knowledge points and the expression of the node relation determine whether the discipline knowledge system is reasonable and whether teaching and learning under the global discipline concept of teachers and students can be supported. Therefore, the knowledge graph model which is extensible, can flexibly express the relation of knowledge points and is easy to store and retrieve has important significance for the field of intelligent teaching.
Disclosure of Invention
Aiming at the technical defects in the prior art, the embodiments of the present invention provide a discipline knowledge data processing method and apparatus based on knowledge graph, which is easy to store and convenient to retrieve.
In order to achieve the above object, in a first aspect, an embodiment of the present invention provides a method for processing discipline knowledge data based on a knowledge graph, where the method includes:
configuring a simplified, edge-tagged, directed graph as a data model representing a resource description framework document; wherein the directed graph is used as a knowledge representation model in the knowledge graph;
configuring a query path mechanism of the directed graph to clarify a retrieved query range;
acquiring subject knowledge input through a front end, analyzing and constructing the subject knowledge to convert the subject knowledge into a logical format of a directed graph, and storing the logical format of the directed graph into a relational database for storage; simultaneously, SQL query of the relational database is converted into the query path mechanism;
when in query, the query statement is analyzed and converted into an SQL statement queried for the relational database; wherein the format of the query statement is the format of the query path mechanism;
and then presenting the obtained query result in a front end in an associated knowledge form.
Preferably, the directed graph is an edge-labeled directed graph, represented by the five-tuple RG ═ (V, E, D, λ, I), where:
v represents a node set, E represents an edge set, D is the applicable field of the described information, lambda is the mapping from edge to node, and I represents an axiom set, namely whether the operation property combination of lambda can be transmitted or exchanged.
Preferably, after the directed graph describes knowledge in a class and attribute format, the directed graph also realizes storage of description records, so that semantic information contained in the directed graph document is expressed explicitly.
Preferably, when the digraph record is stored, MySQL is used as the DBMS to store the digraph record, and the database is retrieved by virtue of a query function provided by the DBMS.
In a second aspect, an embodiment of the present invention further provides a disciplinary knowledge data processing apparatus based on a knowledge graph, including a setting module, a knowledge acquirer, and a knowledge base searcher;
the setting module is configured to:
configuring a simplified, edge-tagged, directed graph as a data model representing a resource description framework document; wherein the directed graph is used as a knowledge representation model in the knowledge graph;
configuring a query path mechanism of the directed graph to clarify a retrieved query range;
the knowledge acquirer is used for acquiring subject knowledge input through a front end, analyzing and constructing the subject knowledge to convert the subject knowledge into a logical format of a directed graph, and storing the logical format of the directed graph into a relational database for storage; simultaneously, SQL query of the relational database is converted into the query path mechanism;
the knowledge base searcher to:
when in query, the query statement is analyzed and converted into an SQL statement queried for the relational database; wherein the format of the query statement is the format of the query path mechanism;
and then presenting the obtained query result in a front end in an associated knowledge form.
Preferably, the directed graph is an edge-labeled directed graph, represented by the five-tuple RG ═ (V, E, D, λ, I), where:
v represents a set of nodes, E represents a set of edges, D is the applicable field of the described information, lambda is the mapping from edges to nodes, and I represents an axiomatic set, i.e. whether the operational property combination of lambda can be transmitted or exchanged
Preferably, after the directed graph describes knowledge in a class and attribute format, the directed graph also realizes storage of description records, so that semantic information contained in the directed graph document is expressed explicitly.
Preferably, when the digraph record is stored, MySQL is used as the DBMS to store the digraph record, and the database is retrieved by virtue of a query function provided by the DBMS.
The embodiment of the invention has the following advantages:
(1) the step of ontology modeling of knowledge in each field is avoided;
(2) the method is suitable for the characteristics of knowledge points and digital education resources in the knowledge map of the basic education subject, and the relational database is used for easy storage;
(3) the query of the knowledge graph is easy to realize;
(4) and the method is easy to realize the support of various front-end applications of Web and APP.
Drawings
In order to more clearly illustrate the detailed description of the invention or the technical solutions in the prior art, the drawings that are needed in the detailed description of the invention or the prior art will be briefly described below.
FIG. 1 is a flow chart of a knowledge graph-based subject knowledge data processing method according to an embodiment of the present invention;
FIG. 2 is a block diagram of a knowledge graph-based subject knowledge data processing apparatus according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a storage mechanism according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, an embodiment of the present invention provides a method for processing discipline knowledge data based on a knowledge graph, where the method includes:
s101, configuring a simplified edge-tagged directed graph as a data model for representing a Resource Description Framework (RDF) document; wherein the directed graph is used as a knowledge representation model in the knowledge graph.
Specifically, the directed graph can express semantic information contained in the RDF document explicitly, and more importantly, semantic relation between classes and attributes can be described clearly; the nodes of the directed graph (referred to herein as the RDF graph) represent classes, and the edges represent the types of attributes. The semantic information of the RDF document can be clearly shown through the graph.
RDF graphs are edge-labeled directed graphs, which can be represented by the five-tuple RG ═ (V, E, D, λ, I), where:
(1) v represents a collection of nodes, i.e. a collection of resources described by RDF or a collection of classes defined in RDFS (RDFS-RDF Schema, representation of RDF document structure);
(2) e represents the collection of edges, namely the collection of the attributes of RDF resources or the collection of the attributes of classes in RDFS;
(3) all nodes come from domain D, which is the domain where the information described by RDF/S is applicable, outside of which the described knowledge no longer holds;
(4) λ is the edge-to-node mapping, i.e., λ E → VxV;
(5) i represents an axiom set, namely whether the operation property of the lambda is combined, transferable and exchangeable. (since the operation properties of the point set and the edge set determine the query complexity, the introduction of the parameter adopts a targeted query mode for different operation properties, thereby further improving the query efficiency; for example, if the mapping relationship has transferability, such as a dependent mapping relationship, the query is carried out not only on adjacent nodes but also on adjacent nodes of the adjacent nodes, otherwise, if the mapping relationship has no transferability, the query does not need to be carried out for the second time.
S102, configuring a query path mechanism of the directed graph to clearly search a query range.
In particular, the query path mechanism defines a query scope for the RDF graph. For example: to inquire subject knowledge points corresponding to a subject 'bicycle tail lamp design principle' in a knowledge graph of a physical subject, the expression of the subject knowledge points is as follows:
{ "physics" }. { X }. exercise { Y }. problem { "bicycle tail lamp design principle" }
S103, acquiring subject knowledge input through a front end, analyzing and constructing the subject knowledge to convert the subject knowledge into a logical format of a directed graph, and storing the logical format of the directed graph into a relational database for storage; and simultaneously, converting the SQL query of the relational database into the query path mechanism.
Specifically, in this embodiment, the subject knowledge includes the middle school physics discipline expert planning the physical discipline knowledge point hierarchy, the digital education resources available under each knowledge point, including electronic documents such as micro-class videos and courseware plans, question banks, and the like; simultaneously, storing the obtained RDF graph by using the relational database, and converting SQL query of the relational database into the query path mechanism; storing a knowledge base formed by RDF graphs in a relational database, wherein each object described by the knowledge base has a unique URI identification;
correspondingly, after the directed graph describes knowledge in a class and attribute format, the storage of description records is realized, so that semantic information contained in the directed graph document is expressed definitely;
meanwhile, when the digraph records are stored, MySQL is used as the DBMS to store the digraph records, and the database is retrieved by virtue of the query function provided by the DBMS;
the search of the knowledge base is realized by means of the query function provided by the DBMS. The method comprises the steps that a professional DBMS is selected for record management, which is very critical when the knowledge base is large in scale, and the professional DBMS is powerful in search optimization, so that time is not consumed in searching a specific record set when the knowledge base is searched, query time mainly depends on time consumed by recovering an RDF graph model according to records, and the search speed of the knowledge base is improved;
s104, during query, analyzing the query statement, and converting the query statement into an SQL statement queried for the relational database; wherein the format of the query statement is the format of the query path mechanism.
Specifically, the query is the retrieval of the RDF graph; and converting the query statement of the RDF graph into an SQL query command of a relational database, describing the process of a structured result by RDF, analyzing the query request, realizing the query of the relational database, recombining the query result and returning in the format of an RDF document.
When the method is applied, two components are adopted to realize the operation of the relational database: a knowledge acquirer and a knowledge base searcher; that is, under the condition that the relational database stores the RDF graph, the knowledge acquirer receives the RDF document returned by the front-end query request, analyzes the RDF document, converts the RDF document into the logic format of the RDF graph, and stores the RDF document in the relational database in a record form; and updating the knowledge graph by the knowledge acquirer is realized.
The knowledge searcher converts the query statement of the RDF graph into an SQL query command of a relational database, describes the process of a structured result by RDF, analyzes the query request, realizes the query of the relational database, recombines the query result and returns the query result in the format of an RDF document; and the knowledge searcher is used for realizing the retrieval of the knowledge base.
S105, presenting the obtained query result in a front end in an associated knowledge form.
Specifically, the front end reads the returned RDF graph and presents the result to teachers and students in the form of associated knowledge.
The discipline knowledge data processing method based on the knowledge graph provided by the embodiment of the invention is implemented, the RDF graph is used as a knowledge model, and the RDF class, the attributes and the relationship among the RDF class and the attributes are adopted to realize the expression of the semantic and semantic relationships contained in the knowledge;
the relational database is adopted to realize the storage of the knowledge base and describe the relation between the class and the attribute of each node in the knowledge graph; meanwhile, the configured query path mechanism is used for carrying out corresponding conversion, so that the update of the knowledge map and the retrieval of the knowledge base are realized; by the design, the following advantages are achieved: (1) the step of ontology modeling of knowledge in each domain is avoided. (2) The method is suitable for the characteristics of knowledge points and digital education resources in the knowledge map of the basic education subject, and the relational database is easy to store. (3) And the query of the knowledge graph is easy to realize. (4) And the method is easy to realize the support of various front-end applications of Web and APP.
The basic education knowledge map construction, storage and retrieval method provided by the invention can support experts in the subject field to construct knowledge maps and supplement digital education resources in various forms, and further support various teacher intelligent teaching systems and student self-adaptive learning systems to retrieve the knowledge maps, acquire the digital education resources and obtain the query results recommended according to the logical relationship of knowledge points.
For better understanding of the present invention, the following examples are given:
the middle school physics discipline expert plans the knowledge point hierarchy of the physics discipline, digital education resources available under each knowledge point, including electronic documents such as micro-class videos and courseware cases, question banks and the like. And inputting the knowledge point information, and uploading various digital education resources.
And (II) the front end returns the information to the knowledge acquirer by using RDF image data, and the knowledge acquirer analyzes the information and converts the information into records stored in the relational database.
And thirdly, when the teacher and the students inquire the knowledge graph, submitting the request through the front end, returning the inquiry request to the knowledge searcher by the front end in an inquiry path mechanism format, analyzing the inquiry request into SQL inquiry sentences by the knowledge searcher, inquiring the relational database, converting the inquiry result into RDF graph data by the knowledge searcher and returning the RDF graph data to the front end.
And (IV) the front end reads the returned RDF graph and presents the result to teachers and students in an associated knowledge form.
Based on the same inventive concept, the embodiment of the invention provides a disciplinary knowledge data processing device based on a knowledge graph, as shown in fig. 2, the processing device comprises a setting module, a knowledge acquirer and a knowledge base searcher;
the setting module is configured to:
configuring a simplified, edge-tagged, directed graph as a data model representing a resource description framework document; wherein the directed graph is used as a knowledge representation model in the knowledge graph;
configuring a query path mechanism of the directed graph to clarify a retrieved query range;
the knowledge acquirer is used for acquiring subject knowledge input through a front end, analyzing and constructing the subject knowledge to convert the subject knowledge into a logical format of a directed graph, and storing the logical format of the directed graph into a relational database for storage; simultaneously, SQL query of the relational database is converted into the query path mechanism;
the knowledge base searcher to:
when in query, the query statement is analyzed and converted into an SQL statement queried for the relational database; wherein the format of the query statement is the format of the query path mechanism;
and then presenting the obtained query result in a front end in an associated knowledge form.
Further, the directed graph is an edge-labeled directed graph, represented by a five-tuple RG ═ (V, E, D, λ, I), where:
v represents a node set, E represents an edge set, D is the applicable field of the described information, lambda is the mapping from edge to node, and I represents an axiom set, namely whether the operation property combination of lambda can be transmitted or exchanged.
After the directed graph describes knowledge in a class and attribute format, the storage of description records is realized, so that semantic information contained in the directed graph document is expressed definitely; meanwhile, when the digraph records are stored, MySQL is used as the DBMS to store the digraph records, and the database is retrieved by means of the query function provided by the DBMS.
It should be noted that, for a more specific workflow of the processing apparatus, please refer to the foregoing method embodiment, which is not described herein again.
Further, referring to fig. 3, the knowledge base is composed of four semantic model tables including a knowledge-graph class (KGClass), a knowledge-graph attribute (KGProperty), a knowledge-graph subclass (KGSubClass) and a knowledge-graph sub-attribute (KGProperty), and two resource information tables including a knowledge-graph resource attribute (KGResourceProp); may be stored in the memory of any electronic computer. The memory may be, but is not limited to: random Access Memory (RAM), Read Only Memory (ROM), Programmable Read-Only Memory (PROM), Erasable Read-Only Memory (EPROM), electrically Erasable Read-Only Memory (EEPROM), and the like.
The electronic computer is preinstalled with any relational database management system (such as My SQL, Oracle, SQL Server, etc.) in advance, and four semantic model tables and two resource information tables are established according to the data structure.
The four semantic model tables record and store meta-entities corresponding to knowledge in each subject field contained in the knowledge graph, attributes contained in the meta-entities, dependency relationships among the meta-entities and dependency relationships among the attributes;
the two resource information tables record the unique network storage address and the attribute value of the object data of various digital education resources stored and linked in the knowledge graph.
The semantic model table stores knowledge structures, and the resource information table stores knowledge contents. The structure and the content sublist storage mode are more beneficial to inquiring knowledge according to RDF semantics. In the complete basic education knowledge map, a semantic model table records knowledge points of each subject, the knowledge points are formulated according to national basic education course standards, the number of the knowledge points is fixed, and the updating frequency is not high; the resource information table is digital education resources (including courseware, case, micro-class, question bank, examination paper and the like) contained in each subject, and the quantity of the resources is continuously increased and continuously updated; therefore, after the query is carried out based on the semantic model table, the matched resources are searched, and the searching efficiency is higher.
In addition, the knowledge structure belongs to the data table with low updating frequency, the knowledge content belongs to the data table with high updating frequency, and the separate storage facilitates the optimization of the deployment strategy of the database server, so that the working efficiency is improved.
The implementation of the scheme has the following advantages:
(1) the step of ontology modeling of knowledge in each field is avoided;
(2) the method is suitable for the characteristics of knowledge points and digital education resources in the knowledge map of the basic education subject;
(3) the query of the knowledge graph is easy to realize;
(4) and the method is easy to realize the support of various front-end applications of Web and APP.
Those of ordinary skill in the art will appreciate that the various illustrative modules and steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (8)
1. A disciplinary knowledge data processing method based on knowledge graph, which is characterized in that the method comprises the following steps:
configuring a simplified, edge-tagged, directed graph as a data model representing a resource description framework document; wherein the directed graph is used as a knowledge representation model in the knowledge graph;
configuring a query path mechanism of the directed graph to clarify a retrieved query range;
acquiring subject knowledge input through a front end, analyzing and constructing the subject knowledge to convert the subject knowledge into a logical format of a directed graph, and storing the logical format of the directed graph into a relational database for storage; simultaneously, SQL query of the relational database is converted into the query path mechanism;
when in query, the query statement is analyzed and converted into an SQL statement queried for the relational database; wherein the format of the query statement is the format of the query path mechanism;
and then presenting the obtained query result in a front end in an associated knowledge form.
2. The method of claim 1, wherein the directed graph is an edge-labeled directed graph represented by a five-tuple RG ═ (V, E, D, λ, I), wherein:
v represents a node set, E represents an edge set, D is the applicable field of the described information, lambda is the mapping from edge to node, and I represents an axiom set, namely whether the operation property combination of lambda can be transmitted or exchanged.
3. The knowledge-graph-based subject knowledge data processing method as claimed in claim 1, wherein after the directed graph describes knowledge in a class and attribute format, the storage of description records is further realized, so as to express semantic information contained in the directed graph document.
4. The discipline knowledge data processing method based on knowledge graph as claimed in claim 3, characterized in that, when storing the digraph record, MySQL is adopted as DBMS to realize the storage of the digraph record, and the database is retrieved by means of the query function provided by DBMS.
5. A disciplinary knowledge data processing device based on knowledge graph is characterized by comprising a setting module, a knowledge acquirer and a knowledge base searcher;
the setting module is configured to:
configuring a simplified, edge-tagged, directed graph as a data model representing a resource description framework document; wherein the directed graph is used as a knowledge representation model in the knowledge graph;
configuring a query path mechanism of the directed graph to clarify a retrieved query range;
the knowledge acquirer is used for acquiring subject knowledge input through a front end, analyzing and constructing the subject knowledge to convert the subject knowledge into a logical format of a directed graph, and storing the logical format of the directed graph into a relational database for storage; simultaneously, SQL query of the relational database is converted into the query path mechanism;
the knowledge base searcher to:
when in query, the query statement is analyzed and converted into an SQL statement queried for the relational database; wherein the format of the query statement is the format of the query path mechanism;
and then presenting the obtained query result in a front end in an associated knowledge form.
6. A knowledge-graph-based subject knowledge data processing apparatus according to claim 5, wherein the directed graph is an edge-labeled directed graph expressed by a five-tuple RG ═ (V, E, D, λ, I), wherein:
v represents a node set, E represents an edge set, D is the applicable field of the described information, lambda is the mapping from edge to node, and I represents an axiom set, namely whether the operation property combination of lambda can be transmitted or exchanged.
7. The knowledge-graph-based subject knowledge data processing device according to claim 5 or 6, wherein after the directed graph describes knowledge in a class and attribute format, storage of description records is further realized, so that semantic information contained in the directed graph document is expressed explicitly.
8. The apparatus for processing discipline knowledge data based on knowledge-graph as claimed in claim 7, wherein when storing the digraph record, MySQL is adopted as DBMS to implement the storage of digraph record, and the database is retrieved by means of the query function provided by DBMS.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111446544.7A CN114265889A (en) | 2021-11-30 | 2021-11-30 | Disciplinary knowledge data processing method and device based on knowledge graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111446544.7A CN114265889A (en) | 2021-11-30 | 2021-11-30 | Disciplinary knowledge data processing method and device based on knowledge graph |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114265889A true CN114265889A (en) | 2022-04-01 |
Family
ID=80826126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111446544.7A Pending CN114265889A (en) | 2021-11-30 | 2021-11-30 | Disciplinary knowledge data processing method and device based on knowledge graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114265889A (en) |
-
2021
- 2021-11-30 CN CN202111446544.7A patent/CN114265889A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Visser et al. | Enabling technologies for interoperability | |
| Calvanese et al. | Ontology-based data integration in EPNet: Production and distribution of food during the Roman Empire | |
| Halpin et al. | The complex dynamics of collaborative tagging | |
| CN110990590A (en) | Dynamic financial knowledge map construction method based on reinforcement learning and transfer learning | |
| CN106663101A (en) | Ontology mapping method and apparatus | |
| US10262262B2 (en) | Semantic method for terminal devices of internet of things | |
| CN101490675A (en) | Methods and apparatus for reusing data access and presentation elements | |
| CN103440287A (en) | Web question-answering retrieval system based on product information structuring | |
| Escobar et al. | Adding value to Linked Open Data using a multidimensional model approach based on the RDF Data Cube vocabulary | |
| CN103425740A (en) | IOT (Internet Of Things) faced material information retrieval method based on semantic clustering | |
| KR20200082179A (en) | Data transformation method for spatial data's semantic annotation | |
| CN116361487A (en) | Multi-source heterogeneous policy knowledge graph construction and storage method and system | |
| CN114564482A (en) | Multi-entity-oriented label system and processing method | |
| Petrou et al. | Towards a methodology for publishing linked open statistical data | |
| Beretta et al. | Collaborative research on academic history using linked open data: A proposal for the heloise common research model | |
| Koho et al. | Maintaining a linked data cloud and data service for Second World War history | |
| CN114265889A (en) | Disciplinary knowledge data processing method and device based on knowledge graph | |
| CN113127650A (en) | Technical map construction method and system based on map database | |
| Vyawahare et al. | Hybrid Database Model For Efficient Performance | |
| Do et al. | Toward a Framework for Statistical Data Integration. | |
| Kalampokis et al. | Towards interoperable open statistical data | |
| Papageorgiou et al. | Data and metadata transformations | |
| Polleres et al. | Semantic web standards for publishing and integrating open data | |
| Leshcheva et al. | Towards a method of ontology population from heterogeneous sources of structured data | |
| Solovyev et al. | Problems of database integration in the context of digitalization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |