CN108304531A - A kind of method for visualizing and device of Digital Object Identifier adduction relationship - Google Patents

A kind of method for visualizing and device of Digital Object Identifier adduction relationship Download PDF

Info

Publication number
CN108304531A
CN108304531A CN201810078428.6A CN201810078428A CN108304531A CN 108304531 A CN108304531 A CN 108304531A CN 201810078428 A CN201810078428 A CN 201810078428A CN 108304531 A CN108304531 A CN 108304531A
Authority
CN
China
Prior art keywords
doi
relationship
node
checked
adduction
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.)
Granted
Application number
CN201810078428.6A
Other languages
Chinese (zh)
Other versions
CN108304531B (en
Inventor
刘红炎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Academy of Information and Communications Technology CAICT
Original Assignee
Beijing Taier Infa Network Technology LLC
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 Beijing Taier Infa Network Technology LLC filed Critical Beijing Taier Infa Network Technology LLC
Priority to CN201810078428.6A priority Critical patent/CN108304531B/en
Publication of CN108304531A publication Critical patent/CN108304531A/en
Application granted granted Critical
Publication of CN108304531B publication Critical patent/CN108304531B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2457Query processing with adaptation to user needs
    • G06F16/24573Query processing with adaptation to user needs using data annotations, e.g. user-defined metadata

Abstract

The embodiment of the present invention provides a kind of method for visualizing and device of Digital Object Identifier adduction relationship.The method includes:Obtain object to be checked input by user corresponding No. DOI to be checked and adduction relationship level;Corresponding DOI node datas and the first relationship node with subordinate relation are obtained from data graph model according to No. DOI to be checked, obtains the second relationship node for having adduction relationship of corresponding level from data graph model according to adduction relationship level;The collection of illustrative plates that DOI node datas, the first relationship node, the second relationship node, subordinate relation and adduction relationship are built is sent to the user terminal as query result.Described device is for executing the method.The embodiment of the present invention from data graph model according to No. DOI to be checked by obtaining DOI node datas, the first relationship node and the second relationship node, finally the collection of illustrative plates of structure is sent to the user terminal as query result so that user can intuitively obtain the adduction relationship between each node.

Description

A kind of method for visualizing and device of Digital Object Identifier adduction relationship
Technical field
The present embodiments relate to field of computer technology more particularly to a kind of Digital Object Identifier adduction relationship can Depending on changing method and device.
Background technology
Digital Object Identifier (Digital Object Identifier, abbreviation DOI) is " number of an object Identifier ", it has the characteristics that uniqueness, persistent, becomes the general framework of management network digital content and identification.User carries The metadata of intersection number object word is registered to DOI systems, and DOI is permanently distributed to a digital object, and right for this The current information of elephant provides analysable persistence network linking, these current informations include the digital object on the internet Position and data etc..Although the information of a digital object can constantly change, No. DOI remains unchanged.One No. DOI can The one or more and No. DOI relevant value of the digital object identified is resolved in DOI systems, such as:URL, electronics postal Case address, other identifier symbol and description metadata.DOI has been widely used in periodical, paper, science data, number now In terms of the documents such as publication.
The registration of general DOI Accreditation Systems and parsing querying flow are as follows:
(1) user submits registration metadata
When user's registration DOI, it is necessary to submit the metadata of document.The composition of metadata is by taking journal of writings as an example:First number According to including journal name, issue, title, abstract, the publication date, author, apply quotation and offer the elements such as DOI and article DOI.
(2) Accreditation System is verified and is stored into line discipline to metadata
After the DOI metadata for being connected to user's submission, the rule that metadata is carried out according to business rule verifies Accreditation System, It proposes the data for not conforming to rule, then stores data into system database
(3) Accreditation System externally provides DOI analysis services
The DOI registered in metadata is extracted operation by Accreditation System after completing metadata storage, by DOI correlations Data are sent to Handle Server components, externally provide analysis service.
(4) DOI parsings inquiry
User inquires DOI by way of Handle agreements or handle proxy servers.DOI Accreditation Systems carry out DOI is parsed, and returns to the corresponding metadata of DOI.
There are applying for multinode to draw and be realized through a DOI by the relationship of drawing, in current systems technology between document, can To inquire the relationship situation that single applying is drawn and drawn.But it can not intuitively show complicated adduction relationship situation, can not give and read Person provides global understanding, such as:Document A refers to document B and document C;Document B also citation C.In the angle of document A It can not see that there are adduction relationships by document B and document C.
It since digital object query result is meta data file, then is obtained from metadata and applies the DOI drawn, it is desirable to checked and apply Draw DOI information, it is necessary to inquiry is applied and draws DOI metadata again, it is difficult to it is very clear see clearly to apply draw relationship overall picture.
Since document itself can register a DOI, content also can individually be registered as a DOI, such as:Certain periodical There are one DOI, the paragraphs of article can also be individually created a paragraph DOI for article.Other documents can apply the not only article drawn DOI, and article can be skipped and directly applied and draw paragraph DOI.Present system lacks the structure for showing this DOI adduction relationships comprehensively Show view.
Document applies that draw and drawn be a kind of correlation, and document DOI, which can be applied, draws other DOI, other DOI are also required to can The case where DOI is drawn in displaying, what the current this displaying view drawn was also a lack of.
Invention content
In view of the problems of the existing technology, what the embodiment of the present invention provided a kind of Digital Object Identifier adduction relationship can Depending on changing method and device.
In a first aspect, the embodiment of the present invention provides a kind of method for visualizing of Digital Object Identifier adduction relationship, including:
Obtain the corresponding Digital Object Identifier to be checked of object to be checked input by user DOI and adduction relationship floor Grade;
According to described No. DOI to be checked obtain from data graph model corresponding DOI node datas and with it is described to be checked No. DOI the first relationship node with subordinate relation, respective layer is obtained according to the adduction relationship level from data graph model The the second relationship node for having adduction relationship with described No. DOI to be checked of grade;
By the DOI node datas, the first relationship node, the second relationship node, the subordinate relation and institute The collection of illustrative plates for stating adduction relationship structure is sent to the user terminal as query result.
Second aspect, the embodiment of the present invention provide a kind of visualization device of Digital Object Identifier adduction relationship, including:
Acquisition module, for obtaining the corresponding Digital Object Identifier DOI to be checked of object to be checked input by user And adduction relationship level;
Enquiry module, for according to described No. DOI to be checked obtain from data graph model corresponding DOI node datas and With described No. DOI to be checked the first relationship node with subordinate relation, according to the adduction relationship level from data graph model Middle the second relationship node for having adduction relationship with described No. DOI to be checked for obtaining corresponding level;
Sending module, for by DOI node datas, the first relationship node, the second relationship node, described The collection of illustrative plates of subordinate relation and adduction relationship structure is sent to the user terminal as query result.
The third aspect, the embodiment of the present invention provide a kind of electronic equipment, including:Processor, memory and bus, wherein
The processor and the memory complete mutual communication by the bus;
The memory is stored with the program instruction that can be executed by the processor, and the processor calls described program to refer to Enable the method and step for being able to carry out first aspect.
Fourth aspect, the embodiment of the present invention provide a kind of non-transient computer readable storage medium, including:
The non-transient computer readable storage medium stores computer instruction, and the computer instruction makes the computer Execute the method and step of first aspect.
The method for visualizing and device of a kind of Digital Object Identifier adduction relationship provided in an embodiment of the present invention, pass through root DOI node datas are obtained from data graph model and have the first of subordinate relation to close with No. DOI to be checked according to No. DOI to be checked Set section point, and the second relationship node is obtained according to adduction relationship level, finally the collection of illustrative plates of structure is sent to as query result User terminal so that user can intuitively obtain the adduction relationship between each node.
Description of the drawings
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is this hair Some bright embodiments for those of ordinary skill in the art without creative efforts, can be with root Other attached drawings are obtained according to these attached drawings.
Fig. 1 is a kind of method for visualizing flow signal of Digital Object Identifier adduction relationship provided in an embodiment of the present invention Figure;
Fig. 2 is the method for visualizing flow diagram of Digital Object Identifier adduction relationship provided in an embodiment of the present invention;
Fig. 3 is the node and adduction relationship schematic diagram of periodical class DOI data provided in an embodiment of the present invention;
Fig. 4 is a kind of visualization device structural representation of Digital Object Identifier adduction relationship provided in an embodiment of the present invention Figure;
Fig. 5 is electronic equipment entity structure schematic diagram provided in an embodiment of the present invention.
Specific implementation mode
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art The every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
Fig. 1 is a kind of method for visualizing flow signal of Digital Object Identifier adduction relationship provided in an embodiment of the present invention Figure, as shown in Figure 1, the method, including:
Step 101:Obtain the corresponding Digital Object Identifier to be checked of object to be checked input by user DOI and reference Relationship level;
Specifically, user inputs No. DOI and adduction relationship level of object to be checked in user terminal, wherein one is waited for Query object and No. DOI are one-to-one, in addition, object to be checked, which can be applied, draws other objects, the object drawn may be used also Apply drawing, the adduction relationship of multi-layer is thus constituted, user can set adduction relationship layer according to the demand of oneself Grade.Device obtains object to be checked input by user corresponding No. DOI and adduction relationship level.
Step 102:According to described No. DOI to be checked obtain from data graph model corresponding DOI node datas and with institute No. DOI to be checked the first relationship node with subordinate relation is stated, is obtained from data graph model according to the adduction relationship level Take the second relationship node for having adduction relationship with described No. DOI to be checked of corresponding level;
Include multiple DOI nodes in data graph model specifically, obtaining the data graph model built in advance, and each Subordinate relation between a DOI nodes or adduction relationship, device are obtained according to No. DOI to be checked got from data graph model The the first relationship node for taking corresponding DOI node datas and there is subordinate relation with No. DOI to be checked, also, according to reference Relationship level obtains the second relationship node for having adduction relationship with No. DOI to be checked of corresponding level from data graph model. Wherein, it should be noted that subordinate relation is the DOI nodes set membership mark to be checked, and adduction relationship is DOI sections to be checked Adduction relationship between point and other DOI nodes, adduction relationship include applying the relationship of drawing and by the relationship of drawing.
Step 103:By the DOI node datas, the first relationship node, the second relationship node, the subordinate The collection of illustrative plates of relationship and adduction relationship structure is sent to the user terminal as query result.
Specifically, due to including the subordinate relation or adduction relationship between each node in data graph model, After getting the corresponding first relationship node of DOI nodes to be checked and the second relationship node, DOI node datas, the first relationship section Point, the second relationship node, subordinate relation and adduction relationship can construct the collection of illustrative plates of relationship between each node, which is made For query result, query result is sent to the user terminal.It should be noted that DOI node datas include DOI nodes and The attribute data of object to be checked, DOI nodes, the first relationship node and the second relationship node indicate in collection of illustrative plates with circle, DOI There is directional arrow between node and the first relationship node, shows subordinate relation, DOI nodes and the second relationship node on directional arrow Between have directional arrow, show adduction relationship on directional arrow.
Such as:Fig. 2 is that the method for visualizing flow of Digital Object Identifier adduction relationship provided in an embodiment of the present invention is shown It is intended to, as shown in Fig. 2, including:
Device obtains object to be checked input by user corresponding No. DOI to be checked and adduction relationship level, wherein to be checked No. DOI that No. DOI is article 3 is ask, adduction relationship level is 1, and device obtains text according to No. DOI to be checked from data graph model The attribute data of chapter 3 corresponding DOI nodes and article 3, wherein attribute data include:It title, author and delivers the time, Ke Yili Solution, attribute data can also have other attribute informations of article 3, the embodiment of the present invention to be not specifically limited this, article 3 The attribute data of corresponding DOI nodes and article 3 constitutes DOI node datas.Can also be got from data graph model with Article 3 has the first relationship node of subordinate relation, from figure 2 it can be seen that the first relationship node includes 1 node of phase, publication A Node and certain publishing house's node, and indicated with directional arrow between every one first relationship node DOI nodes corresponding with article 3, And incidence relation is marked on directional arrow.First order reference can be got according to the adduction relationship level of user setting to close Second relationship node of system, wherein the second relationship node includes 1 node of article, 2 node of article, article A nodes and paragraph section Point, and indicated with directional arrow between every one second relationship node DOI nodes corresponding with article 3, and on directional arrow Mark incidence relation.Due to user specify adduction relationship level be 1, in the second relationship node include 1 node of article, Next stage adduction relationship after 2 node of article, article A nodes and paragraph node.It should be noted that can also be closed to first Subordinate relation between set section point and the second relationship node is labeled.
The embodiment of the present invention by according to No. DOI to be checked from data graph model obtain DOI node datas and with it is to be checked No. DOI the first relationship node with subordinate relation is ask, and the second relationship node is obtained according to adduction relationship level, finally by structure The collection of illustrative plates built is sent to the user terminal as query result so that user can intuitively obtain the pass of the reference between each node System.
On the basis of the above embodiments, the method further includes:
It obtains and builds the corresponding DOI metadata of object in the data graph model, the DOI metadata includes No. DOI, belongs to Property data, with described No. DOI the second relationship section for having the first relationship node of subordinate relation and having adduction relationship with described No. DOI Point;
DOI nodes are established according to described No. DOI, and described No. DOI and corresponding attribute data are stored to the DOI and saved In point, DOI node datas are constituted;
Incidence relation of the DOI nodes respectively between the first relationship node is established according to subordinate relation, according to adduction relationship The incidence relation between DOI nodes and the second relationship node is established, to build the data graph model.
Include multiple objects in data graph model specifically, structure data graph model in advance, each object has pair The DOI metadata answered, DOI metadata includes No. DOI, attribute data, the first relationship node for having with No. DOI subordinate relation and with No. DOI the second relationship node for having adduction relationship.Establish DOI nodes according to each object No. DOI, then by No. DOI and In corresponding attribute data storage to DOI nodes, DOI node datas are constituted, added in data graph model has subordinate with No. DOI First relationship node of relationship and have adduction relationship the second relationship node with No. DOI, finally according to subordinate relation establish No. DOI with The incidence relation of first relationship node establishes the incidence relation between DOI nodes and the second relationship node according to adduction relationship.It is right Each object in data graph model is built in aforementioned manners, may finally obtain complete data graph model.It answers It, will be in the storage to database of data graph model after the completion of establishment when explanation.Fig. 3 is the phase provided in an embodiment of the present invention The node and adduction relationship schematic diagram of class DOI data are printed, as shown in figure 3, object A is the section that be inserted into data model Point, it is A that the corresponding DOI metadata of article A, which includes No. DOI, and attribute data is not shown, and has subordinate relation with article A Type X is printed, there is the article B of adduction relationship with article A, creates the node of periodical type X and article B, then in article A and periodical type Subordinate relation is established between X, is established between article A and article and is applied the relationship of drawing.
The embodiment of the present invention is by being pre-created data graph model, can will be with so that user is when inquiring some object The related node of the object is shown in a graphical form, is understood it convenient for user.
On the basis of the above embodiments, described to establish DOI nodes according to described No. DOI and by described No. DOI and corresponding Attribute data store into the DOI nodes, including:
Judge in the data graph model whether existing described No. DOI, if being not present, established according to described No. DOI DOI nodes, and described No. DOI and corresponding attribute data are stored into the DOI nodes;
Specifically, when for Object Creation DOI nodes, can inquire whether have existed this in data graph model first No. DOI of object, if it does not exist, then DOI nodes can be established according to No. DOI, and by No. DOI in the metadata of the object It is stored into DOI nodes with attribute data, to constitute DOI node datas.
Correspondingly,
It is described that incidence relation of the DOI nodes respectively between the first relationship node is established according to subordinate relation, according to reference Relationship establishes the incidence relation between DOI nodes and the second relationship node, and the data graph model is completed with structure, including:
If judging to be not present in the data graph model and there is subordinate relation the first relationship node with the DOI metadata, Corresponding first relationship node is then created, and establishes the incidence relation between DOI nodes and the first relationship node;
If judging to be not present in the data graph model and there is adduction relationship the second relationship node with the DOI metadata, Corresponding second relationship node is then created, and establishes the incidence relation between DOI nodes and the second relationship node.
Specifically, create complete DOI node datas after, searched whether from data graph model exist with object have from First relationship node of category relationship, if it does not exist, then automatically create a first relationship node, then establish DOI nodes with DOI nodes are connect by the incidence relation of the first relationship node with the first relationship node with oriented arrow, and be marked as subordinate pass System.
If DOI nodes have the second relationship node of adduction relationship, and the second relationship section is not present in data graph model Point then automatically creates a second relationship node, then establishes the incidence relation of DOI nodes and the second relationship node, i.e., by DOI Node is connect with the second relationship node with oriented arrow, and is marked as adduction relationship.
It should be noted that after establishing completion data graph model, data graph model can be excavated, i.e., in data In graph model interface, node is clicked, then shows relationship node and associated property data, further clicks on relationship node, then can dig The relationship of the relationship node is dug, further shows next stage node.
The embodiment of the present invention by according to No. DOI to be checked from data graph model obtain DOI node datas and with it is to be checked No. DOI the first relationship node with subordinate relation is ask, and the second relationship node is obtained according to adduction relationship level, finally by structure The collection of illustrative plates built is sent to the user terminal as query result so that user can intuitively obtain the pass of the reference between each node System.
On the basis of the above embodiments, described to establish DOI nodes according to described No. DOI and by described No. DOI and corresponding Attribute data store into the DOI nodes, including:
Judge in the data graph model whether existing described No. DOI, and if it exists, then will be in the data graph model No. DOI corresponding attribute data, the first relationship node with subordinate relation and the second relationship section with adduction relationship Point is updated.
Specifically, the DOI metadata due to object may change, getting structure data graph model After the DOI metadata of required object, No. DOI is obtained from DOI metadata, judges whether No. DOI have existed data artwork In type, if existing, illustrate to need to update the data the data in graph model, at this point, by the DOI nodes in data graph model In attribute data, the first relationship node with subordinate relation and the second relationship node with adduction relationship all delete, Then the information in the DOI metadata of the object reacquired is rebuild one time, specific construction method and above-mentioned implementation Example is consistent, and details are not described herein again.
The embodiment of the present invention has existed DOI nodes by judging in data graph model, then is carried out to the information of the node Update so that user can acquire more accurate result in inquiry.
On the basis of the above embodiments, described that respective layer is obtained from data graph model according to the adduction relationship level The the second relationship node for having adduction relationship with the object to be checked of grade, including:
Recurrence obtains and described No. DOI to be checked the second relationship node for having adduction relationship, if judging to know recursive number Amount is equal to the adduction relationship level, then stops recurrence to obtain the second relationship node of corresponding level.
Specifically, when obtaining corresponding second relationship node from data graph model according to No. DOI to be checked, by passing Return the mode of excavation to obtain, i.e., first obtains with No. DOI to be checked the first layer DOI nodes with direct adduction relationship, obtain After the DOI nodes of complete first layer, then obtain second layer DOI nodes, it is known that the number of plies of acquisition reaches the adduction relationship of user setting Until level.Such as:DOI nodes to be checked are the relationship of drawing of directly applying with DOI nodes A, and DOI nodes A and DOI nodes B is direct The relationship of drawing is applied, DOI nodes B and DOI nodes C is directly to apply the relationship of drawing, if the adduction relationship level of user setting is 2, is led to Cross the collection of illustrative plates that the query result obtained after inquiry is DOI nodes to be checked, DOI node A and DOI nodes B.
The embodiment of the present invention obtains the query result of corresponding level, Ke Yizhun by recursive mode from data graph model True is back to user terminal by query result.
On the basis of the above embodiments, the method further includes:
The object metadata for the object to be registered that user submits is obtained, and is registered according to the object metadata, it is raw It is No. DOI corresponding at the object to be registered.
Specifically, device obtains the object metadata for the object to be registered that user submits, such as:To be that an article is registered Corresponding No. DOI, the object metadata of submission may include:Article name, author, date, keyword etc., device is according to this A little object metadatas generate only one DOI, then return to user terminal by No. DOI of generation.
The embodiment of the present invention by according to No. DOI to be checked from data graph model obtain DOI node datas and with it is to be checked No. DOI the first relationship node with subordinate relation is ask, and the second relationship node is obtained according to adduction relationship level, finally by structure The collection of illustrative plates built is sent to the user terminal as query result so that user can intuitively obtain the pass of the reference between each node System.
Fig. 4 is a kind of visualization device structural representation of Digital Object Identifier adduction relationship provided in an embodiment of the present invention Figure, as shown in figure 4, described device, including:Acquisition module 401, enquiry module 402 and sending module 403, wherein:
Acquisition module 401 is for obtaining the corresponding Digital Object Identifier DOI to be checked of object to be checked input by user Number and adduction relationship level;Enquiry module 402 is used to be obtained from data graph model according to described No. DOI to be checked corresponding DOI node datas and the first relationship node that there is subordinate relation with described No. DOI to be checked, according to the adduction relationship level The the second relationship node for having adduction relationship with described No. DOI to be checked of corresponding level is obtained from data graph model;Send mould Block 403 is used for the DOI node datas, the first relationship node, the second relationship node, the subordinate relation and institute The collection of illustrative plates for stating adduction relationship structure is sent to the user terminal as query result.
Specifically, user inputs No. DOI and adduction relationship level of object to be checked in user terminal, wherein one is waited for Query object and No. DOI are one-to-one, in addition, object to be checked, which can be applied, draws other objects, the object drawn may be used also Apply drawing, the adduction relationship of multi-layer is thus constituted, user can set adduction relationship layer according to the demand of oneself Grade.Acquisition module 401 obtains object to be checked input by user corresponding No. DOI and adduction relationship level.Obtain structure in advance Data graph model, include subordinate relation between multiple DOI nodes and each DOI nodes in data graph model or draw With relationship, enquiry module 402 obtains corresponding DOI node datas according to No. DOI to be checked got from data graph model And with No. DOI to be checked the first relationship node with subordinate relation, also, according to adduction relationship level from data graph model Middle the second relationship node that there is adduction relationship with No. DOI to be checked for obtaining corresponding level.Wherein, it should be noted that from Category relationship is the DOI nodes set membership mark to be checked, and adduction relationship is between DOI nodes to be checked and other DOI nodes Adduction relationship, adduction relationship include apply the relationship of drawing and by the relationship of drawing.Due to including between each node in data graph model Subordinate relation or adduction relationship therefore getting the corresponding first relationship node of DOI nodes to be checked and the second relationship section After point, DOI node datas, the first relationship node, the second relationship node, subordinate relation and adduction relationship can construct each section Query result is sent to the user terminal by the collection of illustrative plates of relationship, sending module 403 using the collection of illustrative plates as query result between point.
The embodiment of device provided by the invention specifically can be used for executing the process flow of above-mentioned each method embodiment, Details are not described herein for function, is referred to the detailed description of above method embodiment.
The embodiment of the present invention by according to No. DOI to be checked from data graph model obtain DOI node datas and with it is to be checked No. DOI the first relationship node with subordinate relation is ask, and the second relationship node is obtained according to adduction relationship level, finally by structure The collection of illustrative plates built is sent to the user terminal as query result so that user can intuitively obtain the pass of the reference between each node System.
Fig. 5 is electronic equipment entity structure schematic diagram provided in an embodiment of the present invention, as shown in figure 5, the electronic equipment, Including:Processor (processor) 501, memory (memory) 502 and bus 503;Wherein,
The processor 501 and memory 502 complete mutual communication by the bus 503;
The processor 501 is used to call the program instruction in the memory 502, to execute above-mentioned each method embodiment The method provided, such as including:Obtain the corresponding Digital Object Identifier DOI to be checked of object to be checked input by user And adduction relationship level;According to described No. DOI to be checked obtain from data graph model corresponding DOI node datas and with it is described No. DOI to be checked the first relationship node with subordinate relation, obtains according to the adduction relationship level from data graph model The the second relationship node for having adduction relationship with described No. DOI to be checked of corresponding level;By the DOI node datas, described The collection of illustrative plates that one relationship node, the second relationship node, the subordinate relation and the adduction relationship are built is as query result It is sent to the user terminal.
The present embodiment discloses a kind of computer program product, and the computer program product includes being stored in non-transient calculating Computer program on machine readable storage medium storing program for executing, the computer program include program instruction, when described program instruction is calculated When machine executes, computer is able to carry out the method that above-mentioned each method embodiment is provided, such as including:Obtain input by user wait for The corresponding Digital Object Identifier to be checked of query object DOI and adduction relationship level;According to described No. DOI to be checked from number According to obtained in graph model corresponding DOI node datas and with described No. DOI to be checked the first relationship node with subordinate relation, Corresponding level is obtained from data graph model according to the adduction relationship level has adduction relationship with described No. DOI to be checked Second relationship node;By the DOI node datas, the first relationship node, the second relationship node, the subordinate relation It is sent to the user terminal as query result with the collection of illustrative plates of adduction relationship structure.
The present embodiment provides a kind of non-transient computer readable storage medium, the non-transient computer readable storage medium Computer instruction is stored, the computer instruction makes the computer execute the method that above-mentioned each method embodiment is provided, example Such as include:Obtain the corresponding Digital Object Identifier to be checked of object to be checked input by user DOI and adduction relationship level; Corresponding DOI node datas are obtained from data graph model and have with described No. DOI to be checked according to described No. DOI to be checked First relationship node of subordinate relation, obtain from data graph model corresponding level according to the adduction relationship level with it is described No. DOI to be checked the second relationship node for having adduction relationship;By the DOI node datas, the first relationship node, described The collection of illustrative plates of two relationship nodes, the subordinate relation and adduction relationship structure is sent to the user terminal as query result.
One of ordinary skill in the art will appreciate that:Realize that all or part of step of above method embodiment can pass through The relevant hardware of program instruction is completed, and program above-mentioned can be stored in a computer read/write memory medium, the program When being executed, step including the steps of the foregoing method embodiments is executed;And storage medium above-mentioned includes:ROM, RAM, magnetic disc or light The various media that can store program code such as disk.
The embodiments such as device described above are only schematical, wherein the unit illustrated as separating component It may or may not be physically separated, the component shown as unit may or may not be physics list Member, you can be located at a place, or may be distributed over multiple network units.It can be selected according to the actual needs In some or all of module achieve the purpose of the solution of this embodiment.Those of ordinary skill in the art are not paying creativeness Labour in the case of, you can to understand and implement.
Through the above description of the embodiments, those skilled in the art can be understood that each embodiment can It is realized by the mode of software plus required general hardware platform, naturally it is also possible to pass through hardware.Based on this understanding, on Stating technical solution, substantially the part that contributes to existing technology can be expressed in the form of software products in other words, should Computer software product can store in a computer-readable storage medium, such as ROM/RAM, magnetic disc, CD, including several fingers It enables and using so that a computer equipment (can be personal computer, server or the network equipment etc.) executes each implementation Method described in certain parts of example or embodiment.
Finally it should be noted that:The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations;Although Present invention has been described in detail with reference to the aforementioned embodiments, it will be understood by those of ordinary skill in the art that:It still may be used With technical scheme described in the above embodiments is modified or equivalent replacement of some of the technical features; And these modifications or replacements, various embodiments of the present invention technical solution that it does not separate the essence of the corresponding technical solution spirit and Range.

Claims (10)

1. a kind of method for visualizing of Digital Object Identifier adduction relationship, which is characterized in that including:
Obtain the corresponding Digital Object Identifier to be checked of object to be checked input by user DOI and adduction relationship level;
According to described No. DOI to be checked obtain from data graph model corresponding DOI node datas and with described No. DOI to be checked The first relationship node with subordinate relation, obtained from data graph model according to the adduction relationship level corresponding level with Described No. DOI to be checked the second relationship node for having adduction relationship;
By the DOI node datas, the first relationship node, the second relationship node, the subordinate relation and described draw The collection of illustrative plates that relationship is built is used to be sent to the user terminal as query result.
2. according to the method described in claim 1, it is characterized in that, the method, further includes:
It obtains and builds the corresponding DOI metadata of object in the data graph model, the DOI metadata includes No. DOI, attribute number According to, with described No. DOI the second relationship node for having the first relationship node of subordinate relation and having adduction relationship with described No. DOI;
DOI nodes are established according to described No. DOI, and described No. DOI and corresponding attribute data are stored to the DOI nodes In, constitute DOI node datas;
Incidence relation of the DOI nodes respectively between the first relationship node is established according to subordinate relation, is established according to adduction relationship Incidence relation between DOI nodes and the second relationship node, to build the data graph model.
3. according to the method described in claim 2, it is characterized in that, described establish DOI nodes according to described No. DOI, and by institute It states No. DOI and corresponding attribute data is stored into the DOI nodes, including:
Judge in the data graph model whether existing described No. DOI, if being not present, DOI sections are established according to described No. DOI Point, and described No. DOI and corresponding attribute data are stored into the DOI nodes;Correspondingly,
It is described that incidence relation of the DOI nodes respectively between the first relationship node is established according to subordinate relation, according to adduction relationship The incidence relation between DOI nodes and the second relationship node is established, the data graph model is completed with structure, including:
If judging to create there is no there is subordinate relation the first relationship node with the DOI metadata in the data graph model Corresponding first relationship node is built, and establishes the incidence relation between DOI nodes and the first relationship node;
If judging to create there is no there is adduction relationship the second relationship node with the DOI metadata in the data graph model Corresponding second relationship node is built, and establishes the incidence relation between DOI nodes and the second relationship node.
4. according to the method described in claim 2, it is characterized in that, described establish DOI nodes according to described No. DOI, and by institute It states No. DOI and corresponding attribute data is stored into the DOI nodes, including:
Judge in the data graph model whether existing described No. DOI, and if it exists, then will be described in the data graph model No. DOI corresponding attribute data, the first relationship node with subordinate relation and the second relationship node with adduction relationship into Row update.
5. according to the method described in claim 1, it is characterized in that, it is described according to the adduction relationship level from data graph model Middle the second relationship node for having adduction relationship with the object to be checked for obtaining corresponding level, including:
Recurrence obtains and described No. DOI to be checked the second relationship node for having adduction relationship, if judging to know recursive quantity etc. In the adduction relationship level, then stop recurrence to obtain the second relationship node of corresponding level.
6. according to the method described in claim 1, it is characterized in that, the method, further includes:
The object metadata for the object to be registered that user submits is obtained, and is registered according to the object metadata, institute is generated It is No. DOI corresponding to state object to be registered.
7. according to claim 1-6 any one of them methods, which is characterized in that the adduction relationship include apply the relationship of drawing and by Draw relationship.
8. a kind of visualization device of Digital Object Identifier adduction relationship, which is characterized in that including:
Acquisition module, for obtaining the corresponding Digital Object Identifier to be checked of object to be checked input by user DOI and drawing With relationship level;
Enquiry module, for according to described No. DOI to be checked obtain from data graph model corresponding DOI node datas and with institute No. DOI to be checked the first relationship node with subordinate relation is stated, is obtained from data graph model according to the adduction relationship level Take the second relationship node for having adduction relationship with described No. DOI to be checked of corresponding level;
Sending module is used for the DOI node datas, the first relationship node, the second relationship node, the subordinate The collection of illustrative plates of relationship and adduction relationship structure is sent to the user terminal as query result.
9. a kind of electronic equipment, which is characterized in that including:Processor, memory and bus, wherein
The processor and the memory complete mutual communication by the bus;
The memory is stored with the program instruction that can be executed by the processor, and the processor calls described program to instruct energy It is enough to execute such as claim 1-7 any one of them methods.
10. a kind of non-transient computer readable storage medium, which is characterized in that the non-transient computer readable storage medium is deposited Computer instruction is stored up, the computer instruction makes the computer execute such as claim 1-7 any one of them methods.
CN201810078428.6A 2018-01-26 2018-01-26 Visualization method and device for reference relationship of digital object identifiers Active CN108304531B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810078428.6A CN108304531B (en) 2018-01-26 2018-01-26 Visualization method and device for reference relationship of digital object identifiers

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810078428.6A CN108304531B (en) 2018-01-26 2018-01-26 Visualization method and device for reference relationship of digital object identifiers

Publications (2)

Publication Number Publication Date
CN108304531A true CN108304531A (en) 2018-07-20
CN108304531B CN108304531B (en) 2020-11-03

Family

ID=62866345

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810078428.6A Active CN108304531B (en) 2018-01-26 2018-01-26 Visualization method and device for reference relationship of digital object identifiers

Country Status (1)

Country Link
CN (1) CN108304531B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109583231A (en) * 2018-11-05 2019-04-05 北京科技大学 A kind of more identifier automatic generation methods of the data object of science data service platform
CN109684613A (en) * 2018-11-20 2019-04-26 天津字节跳动科技有限公司 Reference and display method, device, storage medium and electronic equipment in online document
CN109815280A (en) * 2019-01-25 2019-05-28 山东浪潮商用系统有限公司 A kind of full link analysis method of combination D3
CN110399512A (en) * 2019-07-25 2019-11-01 北京明略软件系统有限公司 A kind of map memory management method and device
CN114462384A (en) * 2022-04-12 2022-05-10 北京大学 Metadata automatic generation device for digital object modeling

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1845104A (en) * 2006-05-22 2006-10-11 赵开灏 System and method for intelligent retrieval and processing of information
CN102298579A (en) * 2010-06-22 2011-12-28 北京大学 Scientific and technical literature-oriented model and method for sequencing papers, authors and periodicals
US20130007056A1 (en) * 2008-12-10 2013-01-03 Murugan Palaniappan Association And Extraction Of Content Artifacts From A Graphical Representation Of Electronic Content
CN103412921A (en) * 2013-08-12 2013-11-27 同方光盘股份有限公司 Structure for displaying knowledge network nodes of literature resources
CN103646099A (en) * 2013-12-19 2014-03-19 南京大学 Thesis recommendation method based on multilayer drawing
US20140181408A1 (en) * 2008-08-25 2014-06-26 International Business Machines Corporation Managing global cache coherency in a distributed shared caching for clustered file systems
CN104657488A (en) * 2015-03-05 2015-05-27 中南大学 Method for calculating author influence based on citation propagation network
CN105653706A (en) * 2015-12-31 2016-06-08 北京理工大学 Multilayer quotation recommendation method based on literature content mapping knowledge domain
CN105787068A (en) * 2016-03-01 2016-07-20 上海交通大学 Academic recommendation method and system based on citation network and user proficiency analysis
CN105808931A (en) * 2016-03-03 2016-07-27 北京大学深圳研究生院 Knowledge graph based acupuncture and moxibustion decision support method and apparatus
CN106708880A (en) * 2015-11-16 2017-05-24 北京国双科技有限公司 Topic associated word obtaining method and apparatus
CN106951517A (en) * 2017-03-19 2017-07-14 北京工业大学 The diversity querying method of document in narrow scope
CN107273079A (en) * 2017-05-18 2017-10-20 网易(杭州)网络有限公司 Related information is shown, collection of illustrative plates processing method, device, medium, equipment and system

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1845104A (en) * 2006-05-22 2006-10-11 赵开灏 System and method for intelligent retrieval and processing of information
US20140181408A1 (en) * 2008-08-25 2014-06-26 International Business Machines Corporation Managing global cache coherency in a distributed shared caching for clustered file systems
US20130007056A1 (en) * 2008-12-10 2013-01-03 Murugan Palaniappan Association And Extraction Of Content Artifacts From A Graphical Representation Of Electronic Content
CN102298579A (en) * 2010-06-22 2011-12-28 北京大学 Scientific and technical literature-oriented model and method for sequencing papers, authors and periodicals
CN103412921A (en) * 2013-08-12 2013-11-27 同方光盘股份有限公司 Structure for displaying knowledge network nodes of literature resources
CN103646099A (en) * 2013-12-19 2014-03-19 南京大学 Thesis recommendation method based on multilayer drawing
CN104657488A (en) * 2015-03-05 2015-05-27 中南大学 Method for calculating author influence based on citation propagation network
CN106708880A (en) * 2015-11-16 2017-05-24 北京国双科技有限公司 Topic associated word obtaining method and apparatus
CN105653706A (en) * 2015-12-31 2016-06-08 北京理工大学 Multilayer quotation recommendation method based on literature content mapping knowledge domain
CN105787068A (en) * 2016-03-01 2016-07-20 上海交通大学 Academic recommendation method and system based on citation network and user proficiency analysis
CN105808931A (en) * 2016-03-03 2016-07-27 北京大学深圳研究生院 Knowledge graph based acupuncture and moxibustion decision support method and apparatus
CN106951517A (en) * 2017-03-19 2017-07-14 北京工业大学 The diversity querying method of document in narrow scope
CN107273079A (en) * 2017-05-18 2017-10-20 网易(杭州)网络有限公司 Related information is shown, collection of illustrative plates processing method, device, medium, equipment and system

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109583231A (en) * 2018-11-05 2019-04-05 北京科技大学 A kind of more identifier automatic generation methods of the data object of science data service platform
CN109583231B (en) * 2018-11-05 2021-03-19 北京科技大学 Automatic generation method for multiple identifiers of data object of scientific data service platform
CN109684613A (en) * 2018-11-20 2019-04-26 天津字节跳动科技有限公司 Reference and display method, device, storage medium and electronic equipment in online document
CN109684613B (en) * 2018-11-20 2024-04-16 天津字节跳动科技有限公司 Method and device for displaying references in online document, storage medium and electronic equipment
CN109815280A (en) * 2019-01-25 2019-05-28 山东浪潮商用系统有限公司 A kind of full link analysis method of combination D3
CN109815280B (en) * 2019-01-25 2023-05-12 浪潮软件科技有限公司 Whole-chain analysis method combined with D3
CN110399512A (en) * 2019-07-25 2019-11-01 北京明略软件系统有限公司 A kind of map memory management method and device
CN114462384A (en) * 2022-04-12 2022-05-10 北京大学 Metadata automatic generation device for digital object modeling

Also Published As

Publication number Publication date
CN108304531B (en) 2020-11-03

Similar Documents

Publication Publication Date Title
CN108304531A (en) A kind of method for visualizing and device of Digital Object Identifier adduction relationship
US11880721B2 (en) Processing a query having calls to multiple data sources
US10445377B2 (en) Automatically generating a website specific to an industry
US20190005025A1 (en) Performing semantic graph search
US8914720B2 (en) Method and system for constructing a document redundancy graph
CN110020086B (en) User portrait query method and device
US9792275B2 (en) Natural language processing (NLP) interfacing with devices
CN1750001A (en) Adding metadata to a stock content item
US20120226683A1 (en) Computerized information system for creating patent data summaries and method therefor
CN101796795A (en) Distributed system
US9886711B2 (en) Product recommendations over multiple stores
CN104468751A (en) Self-defining method for business process nodes in cloud sea operating system
CN110399564B (en) Account classification method and device, storage medium and electronic device
EP3072097A2 (en) Performing marketplace actions based on social networking tags
EP2972970B1 (en) Locale-based sorting on mobile devices
US9529855B2 (en) Systems and methods for point of interest data ingestion
CN117453980A (en) Metadata management, configuration page generation method, server and storage medium
CN105095283A (en) Quasi-friend recommending method in social networking system and quasi-friend recommending system in social networking system
Reisig Towards a conceptual foundation of service composition
CN106980962A (en) The collocation method and server of guide are handled in a kind of public service
Aragao et al. Conflict resolution in web service federations
Devianto et al. Application electronic marketing to help marketing leading products village
US20160253423A1 (en) Data processing system including a search engine
CN109949090A (en) Lead referral method, apparatus, electronic equipment and medium
CN113515504B (en) Data management method, device, electronic equipment and storage medium

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
TA01 Transfer of patent application right

Effective date of registration: 20190729

Address after: 100083 No. 40, Haidian District, Beijing, Xueyuan Road

Applicant after: China information and Communication Research Institute

Address before: 100095 Building 21 Gaolizhang Road, Cuihu Science Park, Zhongguancun, Haidian District, Beijing

Applicant before: Beijing Taier infa network technology limited liability company

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant
CB03 Change of inventor or designer information

Inventor after: Jin Jian

Inventor after: Liu Hongyan

Inventor before: Liu Hongyan

CB03 Change of inventor or designer information