CN117271530B - Digital object language relation modeling method and device for digital network - Google Patents

Digital object language relation modeling method and device for digital network Download PDF

Info

Publication number
CN117271530B
CN117271530B CN202311549759.0A CN202311549759A CN117271530B CN 117271530 B CN117271530 B CN 117271530B CN 202311549759 A CN202311549759 A CN 202311549759A CN 117271530 B CN117271530 B CN 117271530B
Authority
CN
China
Prior art keywords
digital object
relation
digital
relationship
registry
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.)
Active
Application number
CN202311549759.0A
Other languages
Chinese (zh)
Other versions
CN117271530A (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.)
Peking University
Original Assignee
Peking University
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 Peking University filed Critical Peking University
Priority to CN202311549759.0A priority Critical patent/CN117271530B/en
Publication of CN117271530A publication Critical patent/CN117271530A/en
Application granted granted Critical
Publication of CN117271530B publication Critical patent/CN117271530B/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/22Indexing; Data structures therefor; Storage structures
    • G06F16/2282Tablespace storage structures; Management thereof
    • 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/21Design, administration or maintenance of databases
    • G06F16/215Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
    • 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/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0608Saving storage space on storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614Improving the reliability of storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/062Securing storage systems
    • G06F3/0622Securing storage systems in relation to access
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Landscapes

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

Abstract

The embodiment of the application provides a relational modeling method and device for digital object languages of digital networking, and relates to the technical field of digital objects. The method comprises the following steps: determining digital object types for the start digital object and the end digital object, respectively; and carrying out digital object relation definition based on the digital object type of the starting digital object, the digital object type of the ending digital object and the language relation between the digital objects to obtain the digital object relation, wherein the language relation comprises the following steps: a reference relationship, a use relationship, and a version inheritance relationship; the digital object relationship is saved as metadata with the metadata of the starting digital object in a relationship registry. The method solves the problem of digital object relation authority management and the problem of information synchronization between the digital object relation information and the digital object information, has low storage cost, can quickly obtain all the digital object relations attached to one digital object, and is more convenient for managing the digital object.

Description

Digital object language relation modeling method and device for digital network
Technical Field
The application relates to the technical field of digital objects, in particular to a method and a device for modeling relation of digital object languages in digital network.
Background
The digital object is composed of three elements of identification, metadata and data entity, and is different from the traditional data file, the digital object can be directly searched and managed through the content of the digital object file, and in order to better manage the digital object, modeling of the digital object relation is also needed.
In the related art, a digital object relationship is used as another independent entity parallel to a digital object or is used as a digital object for modeling, and the two modeling methods have the problems of information synchronization, high storage cost, authority control and the like between the relationship information and the digital object information.
Disclosure of Invention
In view of the foregoing, embodiments of the present application provide a method and apparatus for relational modeling of digital object languages in the Internet of numbers, so as to overcome or at least partially solve the foregoing problems.
In a first aspect of an embodiment of the present application, a method for modeling relationships for digital object languages in digital networks is disclosed, the method comprising:
determining digital object types for a start digital object and an end digital object, respectively, the digital object types comprising: paper digital objects, code digital objects, and data set digital objects;
And carrying out digital object relation definition based on the digital object type of the starting digital object and the language relation between the digital object type of the ending digital object and the digital object to obtain a digital object relation, wherein the language relation comprises the following steps: a reference relationship, a use relationship, and a version inheritance relationship;
the digital object relationship is saved as metadata with the metadata of the starting digital object in a relationship registry.
Optionally, the method further comprises:
transmitting the digital object ID and/or the digital object relation ID to the relation registry for inquiring the digital object relation, wherein the digital object ID comprises: an ID of the start digital object, an ID of the end digital object;
the relation registry returns all digital object relations of the digital object corresponding to the digital object ID or the relation registry returns the digital object relation corresponding to the digital object relation ID.
Optionally, in the case where the digital object ID is the ID of the destination digital object, the method further comprises:
creating a relationship maintenance list, wherein the relationship maintenance list characterizes all digital object relationships taking the terminal digital object as a terminal;
Transmitting the digital object ID and/or the digital object relationship ID to the relationship registry for digital object relationship querying, comprising:
and sending the digital object ID and/or the digital object relation ID to the relation maintenance list so that the relation maintenance list returns all the digital object relations of the terminal digital object or returns the digital object relation corresponding to the digital object relation ID.
Optionally, the search types supported by the relation registry include: listing all digital objects, listing all incoming edges, listing digital objects of the target type, listing associated digital objects, path search; the method further comprises the steps of:
transmitting the search type and the search parameter corresponding to the search type to the relation registry;
and after searching according to the search type, the relation registry returns a search result corresponding to the search parameter.
Optionally, the method further comprises:
establishing a new digital object relation according to the changed starting digital object and/or the changed ending digital object;
acquiring a modification target digital object relation from the relation registry according to the digital logarithm ID and the digital object relation ID;
And replacing the modified target digital object relation by the new digital object relation to obtain a modified relation registry.
Optionally, the method further comprises:
acquiring a target digital object relation to be deleted from the relation registry according to the digital log ID and the digital object relation ID;
and deleting the target digital object relation to be deleted from the relation registry to obtain a relation registry after deleting the target digital object relation to be deleted.
Optionally, the digital object relationship comprises: the method comprises the following steps of using a relation of papers to codes, using a relation of papers to data sets, referencing a relation of papers to data sets, using a relation of data sets to data sets, inheriting a relation of codes to versions of codes, and inheriting a relation of data sets to versions of data sets.
In a second aspect of the embodiments of the present application, a relational modeling apparatus for digital object languages of the internet of numbers is disclosed, the apparatus comprising:
a type determination module for determining digital object types for a start digital object and an end digital object, respectively, the digital object types comprising: paper digital objects, code digital objects, and data set digital objects;
the relation definition module is used for carrying out digital object relation definition based on the digital object type of the starting digital object and the language relation between the digital object type of the ending digital object and the digital object to obtain the digital object relation, and the language relation comprises the following steps: a reference relationship, a use relationship, and a version inheritance relationship;
And the relation saving module is used for saving the digital object relation as metadata and the metadata of the starting digital object into a relation registry.
In a third aspect of the embodiments of the present application, an electronic device is disclosed, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the steps of the relational modeling method for digital object languages in the digital object language in the first aspect of the embodiments of the present application are implemented when the processor executes the computer program.
In a fourth aspect of the embodiments of the present application, a computer-readable storage medium is disclosed, on which a computer program is stored, which when executed by a processor, implements the steps of the method for modeling relationships for digital object languages in the digital network according to the first aspect of the embodiments of the present application.
Embodiments of the present application include the following advantages:
in the embodiment of the application, the definition of the digital object relation is performed according to the digital object type of the starting digital object and the language relation between the digital object type of the ending digital object and the digital object, so as to obtain the digital object relation, wherein the language relation comprises the following steps: the relation is referenced, used and inherited, and the digital object relation is used as metadata and stored in a relation registry together with the metadata of the starting digital object, so as to realize the relation modeling of the digital object language of the digital network.
Because the digital object relationship exists as metadata attached to one end of the digital object, the rights management policy for the digital object relationship is included in the rights management policy for the digital object to which it is attached, thereby solving the rights management problem for the digital object relationship. Moreover, because one end of the digital object relation is always determined to exist, the problem of information synchronization between the digital object relation information and the digital object information is avoided. In addition, the digital object relations are stored in the relation registry together with the metadata of the starting digital object as metadata, so that the structure of each digital object relation is simpler and the storage cost is smaller. Under the condition of scale expansion of a digital object architecture, all digital object relations attached to the same digital object as metadata are stored in the same relation registry, so that all digital object relations attached to one digital object can be easily listed, and management of the digital object is facilitated.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments of the present application will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of steps of a method for modeling relationships for digital object languages in digital networking, provided in an embodiment of the present application;
FIG. 2 is a schematic diagram of a digital object architecture in which metadata includes digital object relationships provided in an embodiment of the present application;
FIG. 3 is a schematic structural diagram of a relational modeling apparatus for digital object languages of digital networking according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the above objects, features and advantages of the present application more comprehensible, the following description will make clear and complete a technical solution in the embodiments of the present application with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
The existing two digital object modeling methods are: the digital object relationship is modeled as another independent entity juxtaposed to the digital object, and the relationship is modeled as the digital object. (1) In another approach to representing a digital object relationship as another independent entity juxtaposed to the digital object, the relationship is represented as an edge connecting two digital objects, and the entire digital object architecture can then be viewed as a directed graph with the digital objects as nodes and the relationship objects as directed edges between the nodes. The relation system realized based on the method is easier to achieve higher throughput, and performance is not affected because of the need of storing complex structures. However, a digital object relationship exists independent of a digital object, and if a digital object exists no longer on both sides of a digital object relationship, the digital object loses meaning of existence. This property makes consistency between the relationship system and the digital object repository a difficulty. Meanwhile, the space-time distances of the digital objects at two ends of the same digital object relation can be very far away both physically and logically, owners of the digital objects at two ends of the digital object relation can be different, and different authority control strategies can be provided for visitors, in which case, ownership problems of the relation can be difficult to handle. In addition, adding a relationship object in the digital object architecture will make a large change to the overall architecture, and the added entity type makes it difficult to make the new architecture compatible with some old systems.
(2) In a method of using a relationship as a digital object, such a digital object does not have a data entity, a start point, an end point, and other attributes of the relationship as metadata for the digital object. This eliminates the need for such an extension to the digital object architecture by changing the original architecture and protocol and treats the digital object relationship as a digital object so that the digital object relationship can also be the starting point or ending point of other digital object relationships. This makes the extended digital object architecture no longer a simple directed graph of digital objects and relationships, greatly enhancing the expressive power of the relationships in the digital architecture. However, as the scale of the system increases, the number of relationships of the digital object generally increases at a much greater rate than the number of nodes, and if the relationships are stored as digital objects, they cannot be optimized according to the structural specificity of the relationship digital object, and the storage of each relationship must be burdened with the same overhead as a general digital object, which makes the storage overhead of a single relationship large. Second, the digital object relationship also exists independent of its two endpoints, as does the problem of information synchronization between the relationship system and the digital object repository.
In summary, the existing digital object modeling method has the problems of asynchronous relation information and digital object information, high storage cost and authority control. Therefore, in order to solve the technical drawbacks of the existing methods, the applicant proposes the following technical ideas: modeling of digital object relationships is performed in a manner that the digital object relationships are represented as digital object metadata, and relationship registries are utilized to maintain relationships between digital objects. Specifically, the digital object relation definition is performed according to the digital object type of the starting digital object, the digital object type of the ending digital object and the language relation between the digital objects, and the digital object relation is used as metadata to be stored in a relation registry together with the metadata of the starting digital object so as to realize the modeling of the language relation of the digital object of the digital network.
The embodiment of the application provides a relational modeling method for digital object languages of digital networks, and referring to fig. 1, fig. 1 is a step flow chart of the relational modeling method for digital object languages of digital networks, which is provided by the embodiment of the application. As shown in fig. 1, the method may include steps S110 to S130:
step S110: determining digital object types for a start digital object and an end digital object, respectively, the digital object types comprising: paper digital objects, code digital objects, and data set digital objects.
In this embodiment, modeling is performed on the digital object relationships of three commonly used digital objects, where two ends of the digital object relationships correspond to two different digital objects, i.e., the digital object relationships correspond to a starting digital object and an ending digital object. Wherein the starting point number object refers to a starting party for establishing the relationship, and the ending point number object refers to an ending party for establishing the relationship. For example, for paper A and paper B, if paper A references paper B, then the digital object corresponding to paper A is determined to be the starting digital object and the digital object corresponding to paper B is determined to be the ending digital object.
The digital object type is determined based on the type of data represented by the digital object, and as long as the two digital objects represent different types of data, they differ in type of digital object. For example, the digital object corresponding to the paper is a paper digital object, the digital object corresponding to the code is a code digital object, and the digital object corresponding to the data set is a data set digital object.
In a specific embodiment, the metadata of the digital object includes type identification information of the digital object, for example, the type identification information of the paper digital object is a paper, the type identification information of the code digital object is a code, and the type identification information of the data set digital object is a dataset. Accordingly, the type of digital object is determined based on the type identification information in the digital object metadata, i.e., the digital object types of the start digital object and the end digital object are determined.
Step S120: and carrying out digital object relation definition based on the digital object type of the starting digital object and the language relation between the digital object type of the ending digital object and the digital object to obtain a digital object relation, wherein the language relation comprises the following steps: reference relationships, use relationships, version inheritance relationships.
In the embodiment of the application, considering that the digital object relation among the digital objects is defined according to the language relation, a certain problem exists. For example, references between paper digital objects and references between code digital objects, although both references are references, are different in the type of digital object at both ends and thus the operations that can be performed on this digital object relationship are also different; the version inheritance relationship between the code digital objects and the version inheritance relationship between the data set digital objects are both version inheritance relationships, but because the content forms of the data set digital objects and the code digital objects are different, the inheritance relationship of the data set digital objects and the inheritance relationship of the code digital objects may take different forms to record different information, and thus the digital object relationships cannot be defined only according to the language relationship.
Further, for accurate digital object relationship modeling, the semantic relationships between the digital object type of the start digital object, the digital object type of the end digital object, and the digital object are used to define the digital object relationships. For example, a citation relationship (i.e., a digital object relationship) between a paper digital object and a paper digital object is denoted as a "citation-paper". If the two digital object relationships are of the same type, then the semantic relationship, the starting digital object type, and the ending digital object type are all the same.
Specifically, the digital object relationship includes: the method comprises the following steps of using a relation of papers to codes, using a relation of papers to data sets, referencing a relation of papers to data sets, using a relation of data sets to data sets, inheriting a relation of codes to versions of codes, and inheriting a relation of data sets to versions of data sets.
The use relation of the paper to the code (namely use-paper-code) indicates that a certain paper uses a certain code in experiments, and the use relation of the paper to the code comprises the following steps: the ID of the experimental element of the paper (Identity Document, identity), the list of the elements and the literal description of the usage relation represent the information such as the code used in the experiment, the list of the elements of the character string, the command and the parameters used when the code is operated, how the code is used in the experiment and the like. The usage relation of the paper to the data set (namely, usage-paper-data set) means that a certain paper uses a certain data set in an experiment, and the usage relation of the paper to the data set includes: the ID of the experimental element of the paper, the mounting point and the text description of the usage relation, wherein the mounting point represents the mounting point of the data set in the running of the experiment. The citation relationship of papers to papers (i.e., citation-paper) indicates that one paper cited another, and that there is only one citation attribute in the citation relationship of papers to indicate one citation element in the starting point paper. The use relation of data sets to data sets (namely, use-data set) means that an end point data set is used in the creation process of an end point data set, the end point data set is obtained by executing a code on the end point data set, and the use relation of the data sets in the data set comprises: the code refers to the ID of the code digital object used for execution and the mounting point refers to the mounting point of the terminal digital object in the code execution process. The version inheritance relationship of the code to the code (i.e., version inheritance-code) indicates that the start code is derived on the basis of inheritance of the end code, and that there is only one version inheritance attribute in the version inheritance relationship of the code to the code. The version inheritance relationship (version inheritance-data set) of the data set by the data set indicates that the starting data set is obtained on the basis of the inheritance destination data set, and only one version inheritance attribute is included in the version inheritance relationship of the data set by the data set.
Step S130: the digital object relationship is saved as metadata with the metadata of the starting digital object in a relationship registry.
In the present embodiment, the digital object relationship is stored as a special metadata with the metadata of the starting digital object. Fig. 2 is a schematic diagram of a digital object architecture in which metadata includes a relationship between digital objects, where a tag characterizes the digital object, and related information such as a location of the digital object can be resolved according to the tag; the metadata disclosure information includes digital object type, author information, digital object content description, etc.; a digital object relationship refers to all digital object relationships associated with the digital object; the data entity is the data itself contained in the digital object.
Because the digital object relationship exists as metadata attached to one end of the digital object, the rights management policy for the digital object relationship is included in the rights management policy for the digital object to which it is attached, thereby solving the rights management problem for the digital object relationship. Moreover, because one end of the digital object relation is always determined to exist, the problem of information synchronization between the digital object relation information and the digital object information is avoided. In addition, the digital object relations are stored in the relation registry together with the metadata of the starting digital object as metadata, so that the structure of each digital object relation is simpler and the storage cost is smaller. In the case of scale-up of a digital object architecture, when digital objects, metadata and digital object relationships are distributed in a plurality of data warehouses, registries worldwide, since the digital object relationships of the existing method are independent of their endpoints (start digital object and end digital object), the digital object relationships are stored in all systems worldwide in a scattered manner, which makes it difficult to implement listing all digital object relationships associated with one digital object, and it is inconvenient to manage the digital objects, while storing all relationships of the digital object relationships attached to one digital object as digital object metadata in the same registry, all digital object relationships attached to one digital object can be easily listed, thereby facilitating management of the digital objects.
In an alternative embodiment, after modeling the relationships of the digital object language for the digital network is completed, a query for the digital object relationships is implemented in the following manner to better manage the digital objects based on the digital object relationships. Specifically, the method includes steps A1 and A2:
step A1: transmitting the digital object ID and/or the digital object relation ID to the relation registry for inquiring the digital object relation, wherein the digital object ID comprises: the ID of the start digital object, the ID of the end digital object.
Step A2: the relation registry returns all digital object relations of the digital object corresponding to the digital object ID or the relation registry returns the digital object relation corresponding to the digital object relation ID.
In the embodiment of the present application, the digital object ID refers to an identification of the digital object, each digital object has a unique ID, and the digital object ID is determined in the process of creating the digital object. The digital object relation ID refers to an identity of each digital object relation, each digital object relation ID corresponds to one digital object relation, and the digital object relation ID is an ID designated by the digital object relation after the digital networking digital object language is modeled by the relation.
In particular implementations, the following two cases are included: 1) The digital object relationship query is made based only on the digital object ID. At this time, the digital object ID is sent to the relation registry, and the relation registry queries according to the digital object ID and returns all the digital object relations of the digital object corresponding to the digital object ID. For example, digital object A has 10 digital object relationships in a relationship registry, which returns the 10 digital object relationships of digital object A when queried according to the digital object ID of digital object A. 2) And carrying out digital object relation inquiry based on the digital object ID and the digital object relation ID, and returning the digital object relation corresponding to the digital object relation ID by the relation registry.
Further, because the digital object relationship exists in adherence to the starting digital object, the digital object relationship query for the ending digital object is performed by creating an index or the like to obtain the digital object relationship associated with the ending digital object. Specifically, in the case where the digital object ID is the ID of the destination digital object, the method further includes steps B1 and B2:
step B1: a relationship maintenance list is created that characterizes all digital object relationships that are terminated by the endpoint digital object.
Step B2: and sending the digital object ID and/or the digital object relation ID to the relation maintenance list so that the relation maintenance list returns all the digital object relations of the terminal digital object or returns the digital object relation corresponding to the digital object relation ID.
In the embodiment of the application, since the digital object relationship is used as metadata to store the relationship registry together with the metadata of the starting digital object, all the digital object relationships associated with the ending digital object cannot be obtained from the relationship registry directly based on the ID of the ending digital object. Further, a relationship maintenance list is created to store all digital object relationships terminating in the destination digital object, e.g., 10 different digital object relationships each terminating in digital object B are stored in the digital object B correspondence maintenance list.
Specifically, when querying the digital object relationship of the end point digital object, two cases are also included: 1) And sending the ID of the terminal digital object to a relation maintenance list, inquiring the relation maintenance list according to the ID of the terminal digital object, and returning all digital object relations of the terminal digital object. For example, digital object B has 10 digital object relationships in a relationship maintenance list that returns the 10 digital object relationships of digital object B when queried according to the digital object ID of digital object B. 2) And sending the ID of the terminal digital object and the digital object relation ID to a relation maintenance list so that the relation maintenance list returns the digital object relation corresponding to the digital object relation ID.
In an alternative embodiment, after the digital object language modeling of the digital object language is completed, the operations supported by the digital object relationship may also be queried through the relationship registry. And sending the digital object ID and the digital object relation ID to a relation registry to perform supported operation inquiry, and returning all operations supported by the digital object relation corresponding to the digital object relation ID by the relation registry.
In an alternative embodiment, the relationship registry is allowed to define different search types and search parameters for searching. The search types supported by the relation registry include: listing all digital objects, listing all incoming edges, listing digital objects of the target type, listing associated digital objects, path search.
Further, the method further comprises: transmitting the search type and the search parameter corresponding to the search type to the relation registry; and after searching according to the search type, the relation registry returns a search result corresponding to the search parameter.
Wherein, listing all the digital objects refers to: given the ID of the relationship registry, all digital objects involved in the digital object relationship in the relationship registry are returned. Listing all incoming edges refers to: given a digital object ID, all digital object relationships that point to this digital object are returned. The number objects listing the target types refer to: given the ID of the relationship registry and the type of a digital object (i.e., the target type), all corresponding types of digital objects that are involved in the relationship registry are returned. Listing the associated digital objects refers to: given the digital object ID, all digital objects having a direct relationship with this digital object are returned. Path search refers to: giving a digital object ID at the starting point, giving a path mode taking the digital object as a node and the relationship as an edge, simultaneously giving the type of each digital object, the type of the relationship and the direction of each relationship on the path, and returning to the end points of all possible paths in the relationship registry.
In the embodiment of the application, the data search is performed by defining different search types, so that the flexibility of the data search is improved, and meanwhile, the management of the digital object is more convenient.
In an alternative embodiment, to ensure real-time availability of digital object relationships, when a digital object relationship is changed, the changed digital object relationship is modified to obtain an accurate and efficient new digital object relationship as follows. Specifically, the method comprises the steps C1 to C3:
step C1: a new digital object relationship is established based on the changed starting digital object and/or the changed ending digital object.
Step C2: and acquiring the modification target digital object relation from the relation registry according to the digital logarithm ID and the digital object relation ID.
Step C3: and replacing the modified target digital object relation by the new digital object relation to obtain a modified relation registry.
In this embodiment, the change of the digital object relationship specifically refers to the change of the digital object relationship at the start point or the change of the digital object at the end point. Because the digital object relation number is stored in the relation registry, for the changed digital object relation, the digital object relation needing to be modified is required to be obtained from the relation registry, and the modified digital object relation is replaced by the new digital object relation, so that the modification of the digital object relation is completed, and the modified relation registry is obtained. The maintenance of the digital object relation is realized, and the accuracy and the effectiveness of the digital object relation are ensured.
In an alternative embodiment, when a digital object relationship does not exist, the non-existing digital object relationship is deleted as follows. Specifically, the method comprises the steps of D1 and D2:
step D1: and acquiring the target digital object relation to be deleted from the relation registry according to the digital log ID and the digital object relation ID.
Step D2: and deleting the target digital object relation to be deleted from the relation registry to obtain a relation registry after deleting the target digital object relation to be deleted.
In this embodiment of the present application, the target digital object relationship to be deleted refers to a digital object relationship in which the digital object relationship does not exist due to the absence of the start digital object or the end digital object, and for such a digital object relationship, it is required to delete it from the relationship registry to implement maintenance of the digital object relationship.
In an embodiment of the present application, a log-networking digital object language is modeled with relationships by using digital object relationships as metadata. And defining the digital object relation according to the digital object type of the starting digital object, the digital object type of the ending digital object and the language relation between the digital objects to obtain the digital object relation, and storing the digital object relation as metadata and metadata of the starting digital object into a relation registry to realize the modeling of the language relation of the digital object of the digital network. Because the digital object relationship exists as metadata attached to one end of the digital object, the rights management policy for the digital object relationship is included in the rights management policy for the digital object to which it is attached, thereby solving the rights management problem for the digital object relationship. Moreover, because one end of the digital object relation is always determined to exist, the problem of information synchronization between the digital object relation information and the digital object information is avoided. In addition, the digital object relations are stored in the relation registry together with the metadata of the starting digital object as metadata, so that the structure of each digital object relation is simpler and the storage cost is smaller. Under the condition of scale expansion of a digital object architecture, all digital object relations attached to the same digital object as metadata are stored in the same relation registry, so that all digital object relations attached to one digital object can be easily listed, and management of the digital object is facilitated.
The embodiment of the application also provides a relational modeling device for digital object language of digital network, referring to fig. 3, fig. 3 is a schematic structural diagram of the relational modeling device for digital object language of digital network, provided in the embodiment of the application, the device includes:
a type determination module 310 for determining digital object types for a start digital object and an end digital object, respectively, the digital object types comprising: paper digital objects, code digital objects, and data set digital objects;
a relationship definition module 320, configured to perform a digital object relationship definition based on a semantic relationship between the digital object type of the starting digital object and the digital object type of the ending digital object, to obtain a digital object relationship, where the semantic relationship includes: a reference relationship, a use relationship, and a version inheritance relationship;
a relationship saving module 330 for saving the digital object relationship as metadata with the metadata of the starting digital object into a relationship registry.
In an alternative embodiment, the apparatus further comprises a query module, the query module comprising:
a first query sub-module, configured to send a digital object ID and/or a digital object relationship ID to the relationship registry for performing a digital object relationship query, where the digital object ID includes: an ID of the start digital object, an ID of the end digital object;
And the second inquiry submodule is used for returning all digital object relations of the digital object corresponding to the digital object ID by the relation registry or returning the digital object relation corresponding to the digital object relation ID by the relation registry.
In an alternative embodiment, where the digital object ID is the ID of the destination digital object, the query module comprises:
the creation module is used for creating a relation maintenance list which characterizes all digital object relations taking the terminal digital object as a terminal;
and the third inquiry submodule is used for sending the digital object ID and/or the digital object relation ID to the relation maintenance list so that the relation maintenance list returns all the digital object relations of the terminal digital object or returns the digital object relation corresponding to the digital object relation ID.
In an alternative embodiment, the search types supported by the relationship registry include: listing all digital objects, listing all incoming edges, listing digital objects of the target type, listing associated digital objects, path search; the apparatus further includes a search module, the search module including:
The first searching sub-module is used for sending the search type and the search parameter corresponding to the search type to the relation registry;
and the second searching sub-module is used for returning search results corresponding to the searched parameters after the relation registry searches according to the search type.
In an alternative embodiment, the apparatus further comprises a modification module comprising:
a first modification sub-module, configured to establish a new digital object relationship according to the changed starting digital object and/or the changed ending digital object;
the second modification submodule is used for acquiring a modification target digital object relation from the relation registry according to the digital logarithmic ID and the digital object relation ID;
and a third modification sub-module, configured to replace the modification target digital object relationship with the new digital object relationship, to obtain a modified relationship registry.
In an alternative embodiment, the apparatus further comprises a deletion module, the deletion module comprising:
the first deleting submodule is used for acquiring a target digital object relation to be deleted from the relation registry according to the digital logarithmic ID and the digital object relation ID;
And the second deleting submodule is used for deleting the target digital object relation to be deleted from the relation registry to obtain a relation registry after deleting the target digital object relation to be deleted.
In an alternative embodiment, the digital object relationship comprises: the method comprises the following steps of using a relation of papers to codes, using a relation of papers to data sets, referencing a relation of papers to data sets, using a relation of data sets to data sets, inheriting a relation of codes to versions of codes, and inheriting a relation of data sets to versions of data sets.
The embodiment of the application also provides an electronic device, and referring to fig. 4, fig. 4 is a schematic structural diagram of the electronic device. As shown in fig. 4, the electronic device 400 includes: the memory 410 and the processor 420 are connected through bus communication, and the memory 410 is stored with a computer program which can run on the processor 420, so as to realize the steps of the relational modeling method for digital object languages in digital networking according to the embodiment of the application.
The embodiment of the application also provides a computer readable storage medium, on which a computer program is stored, and the computer program is executed by a processor to implement the steps of the relational modeling method for digital object languages in digital networking.
In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described by differences from other embodiments, and identical and similar parts between the embodiments are all enough to be referred to each other.
Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present embodiments have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the embodiments of the present application.
Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or terminal device comprising the element.
The above description has been made in detail about a method and apparatus for modeling relationship for digital object language of digital network, and specific examples are applied herein to illustrate the principles and embodiments of the present application, and the above description of the examples is only for helping to understand the method and core ideas of the present application; meanwhile, as those skilled in the art will have modifications in the specific embodiments and application scope in accordance with the ideas of the present application, the present description should not be construed as limiting the present application in view of the above.

Claims (10)

1. A method for modeling relationships for digital object languages of the Internet of things, which is characterized by comprising the following steps:
determining digital object types for a start digital object and an end digital object, respectively, the digital object types comprising: paper digital objects, code digital objects, and data set digital objects;
and carrying out digital object relation definition based on the digital object type of the starting digital object and the language relation between the digital object type of the ending digital object and the digital object to obtain a digital object relation, wherein the language relation comprises the following steps: a reference relationship, a use relationship, and a version inheritance relationship;
The digital object relationship is saved as metadata with the metadata of the starting digital object in a relationship registry.
2. The method according to claim 1, wherein the method further comprises:
transmitting the digital object ID and/or the digital object relation ID to the relation registry for inquiring the digital object relation, wherein the digital object ID comprises: an ID of the start digital object, an ID of the end digital object;
the relation registry returns all digital object relations of the digital object corresponding to the digital object ID or the relation registry returns the digital object relation corresponding to the digital object relation ID.
3. The method of claim 2, wherein in the event that the digital object ID is the ID of the destination digital object, the method further comprises:
creating a relationship maintenance list, wherein the relationship maintenance list characterizes all digital object relationships taking the terminal digital object as a terminal;
transmitting the digital object ID and/or the digital object relationship ID to the relationship registry for digital object relationship querying, comprising:
and sending the digital object ID and/or the digital object relation ID to the relation maintenance list so that the relation maintenance list returns all the digital object relations of the terminal digital object or returns the digital object relation corresponding to the digital object relation ID.
4. The method of claim 1, wherein the search types supported by the relational registry comprise: listing all digital objects, listing all incoming edges, listing digital objects of the target type, listing associated digital objects, path search; the method further comprises the steps of:
transmitting the search type and the search parameter corresponding to the search type to the relation registry;
and after searching according to the search type, the relation registry returns a search result corresponding to the search parameter.
5. The method according to claim 1, wherein the method further comprises:
establishing a new digital object relation according to the changed starting digital object and/or the changed ending digital object;
acquiring a modification target digital object relation from the relation registry according to the digital logarithm ID and the digital object relation ID;
and replacing the modified target digital object relation by the new digital object relation to obtain a modified relation registry.
6. The method according to claim 1, wherein the method further comprises:
acquiring a target digital object relation to be deleted from the relation registry according to the digital log ID and the digital object relation ID;
And deleting the target digital object relation to be deleted from the relation registry to obtain a relation registry after deleting the target digital object relation to be deleted.
7. The method of claim 1, wherein the digital object relationship comprises: the method comprises the following steps of using a relation of papers to codes, using a relation of papers to data sets, referencing a relation of papers to data sets, using a relation of data sets to data sets, inheriting a relation of codes to versions of codes, and inheriting a relation of data sets to versions of data sets.
8. A digital object language relational modeling apparatus for digital internet, the apparatus comprising:
a type determination module for determining digital object types for a start digital object and an end digital object, respectively, the digital object types comprising: paper digital objects, code digital objects, and data set digital objects;
the relation definition module is used for carrying out digital object relation definition based on the digital object type of the starting digital object and the language relation between the digital object type of the ending digital object and the digital object to obtain the digital object relation, and the language relation comprises the following steps: a reference relationship, a use relationship, and a version inheritance relationship;
And the relation saving module is used for saving the digital object relation as metadata and the metadata of the starting digital object into a relation registry.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the steps of the digital object language relational modeling method for digital networking of any one of claims 1-7 when the computer program is executed by the processor.
10. A computer readable storage medium having stored thereon a computer program, which when executed by a processor performs the steps of the method for relational modeling of digital object languages of the digital network as claimed in any of claims 1 to 7.
CN202311549759.0A 2023-11-21 2023-11-21 Digital object language relation modeling method and device for digital network Active CN117271530B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311549759.0A CN117271530B (en) 2023-11-21 2023-11-21 Digital object language relation modeling method and device for digital network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311549759.0A CN117271530B (en) 2023-11-21 2023-11-21 Digital object language relation modeling method and device for digital network

Publications (2)

Publication Number Publication Date
CN117271530A CN117271530A (en) 2023-12-22
CN117271530B true CN117271530B (en) 2024-02-06

Family

ID=89210849

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311549759.0A Active CN117271530B (en) 2023-11-21 2023-11-21 Digital object language relation modeling method and device for digital network

Country Status (1)

Country Link
CN (1) CN117271530B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6003039A (en) * 1997-06-27 1999-12-14 Platinum Technology, Inc. Data repository with user accessible and modifiable reuse criteria
CN113779417A (en) * 2021-11-12 2021-12-10 中国信息通信研究院 Digital asset object searching method and device, electronic equipment and storage medium
CN116719817A (en) * 2023-06-12 2023-09-08 北京大学 Digital object relationship tracing method and system for technological resources
CN116932614A (en) * 2023-09-18 2023-10-24 北京大学 Distributed searching method and system oriented to digital networking

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9268849B2 (en) * 2007-09-07 2016-02-23 Alexander Siedlecki Apparatus and methods for web marketing tools for digital archives—web portal advertising arts
US20230177097A1 (en) * 2021-12-02 2023-06-08 Yandex Europe Ag Multi-phase training of machine learning models for search ranking

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6003039A (en) * 1997-06-27 1999-12-14 Platinum Technology, Inc. Data repository with user accessible and modifiable reuse criteria
CN113779417A (en) * 2021-11-12 2021-12-10 中国信息通信研究院 Digital asset object searching method and device, electronic equipment and storage medium
CN116719817A (en) * 2023-06-12 2023-09-08 北京大学 Digital object relationship tracing method and system for technological resources
CN116932614A (en) * 2023-09-18 2023-10-24 北京大学 Distributed searching method and system oriented to digital networking

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Pathways:Augmenting interoperability across scholarly repositories;Simeon Warner etc.;arXiv;全文 *
基于OAIS信息模型的数字档案馆元数据体系设计;周丽霞等;档案学研究(第01期);全文 *
数据空间基础设施的技术挑战及数联网解决方案;黄罡等;大数据(第02期);全文 *
面向人机物融合的数联网标识解析技术;黄罡等;软件学院;全文 *

Also Published As

Publication number Publication date
CN117271530A (en) 2023-12-22

Similar Documents

Publication Publication Date Title
EP3701680B1 (en) Network slice configuration
CN113760971B (en) Method, computing device and storage medium for retrieving data of a graph database
US10936559B1 (en) Strongly-consistent secondary index for a distributed data set
US20090287800A1 (en) Method, device and system for managing network devices
CN109726038B (en) Method and apparatus for managing virtual machines
CN110807028B (en) Method, apparatus and computer program product for managing a storage system
CN117271460B (en) Scientific research digital networking service method and system based on scientific research digital object language relation
US10262024B1 (en) Providing consistent access to data objects transcending storage limitations in a non-relational data store
CN105631019A (en) Metadata extension method and device
CN117271530B (en) Digital object language relation modeling method and device for digital network
CN115705313A (en) Data processing method, device, equipment and computer readable storage medium
EP1110160A1 (en) Data structure and operations for time-varying variable in an enterprise model
CN111291137A (en) Entity relationship-based searching method and system
CN107463618B (en) Index creating method and device
US10289710B2 (en) Method for modifying root node, and modification apparatus
KR102169930B1 (en) Semantic Information Management Method for a M2M/IoT platform
CN115221360A (en) Tree structure configuration method and system
CN109885542A (en) Item file management method, device and storage medium
US20240007876A1 (en) Restoration of a network slice
CN110347711B (en) Fragment storage graph database query method and device
KR100461349B1 (en) A method for automatically recognizing network elements's entity-management-information by using snmp
CN112612797A (en) Multi-source same-table data loading method, device, equipment and medium
CN115510112A (en) Data reporting method and device, storage medium and electronic equipment
CN116610711A (en) Data query method, device, equipment and storage medium
CN115599743A (en) Method and device for migrating files 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
GR01 Patent grant
GR01 Patent grant