Resource searching method and device and electronic equipment

Abstract

The invention provides a resource searching method and device and electronic equipment, and is applied to the technical field of resource discovery and scheduling. The method comprises the following steps: in response to a resource search request configured with a target resource number and sent by a request node, performing intra-domain search in a resource section based on a neighborhood node set of the request node to obtain a first resource result subset; in response to the fact that the number of resources in the first resource result subset does not meet the target number of resources, cross-domain search is carried out in cross-domain neighbors of the request node according to attributes of domains where neighbor nodes of the request node are located, and a second resource result subset is obtained; combining the first resource result subset and the second resource result subset to obtain a resource result set, and comparing the relationship between the number of resources in the resource result set and the number of target resources; and pushing the resource result set in response to the condition that the resource number in the resource result set meets the target resource number. According to the method, efficient discovery of resources can be realized, and the resource search efficiency and accuracy are improved.

Description

Technical Field

[0001] The present invention relates to the technical field of resource discovery and scheduling, and in particular to a resource search method, device and electronic equipment. Background Art

[0002] Cross-domain resource modeling and discovery, as a cutting-edge comprehensive methodology, aims to deeply organize, map and retrieve digital resources scattered in different geographical locations, management domains and organizational structures. Cross-domain resources can include storage resources, data resources, service resources and user resources. Modeling these cross-domain resources is a way to efficiently utilize these resources. Specifically, cross-domain resource modeling is the process of forming corresponding theoretical models based on the characteristics of different types of resources using different theoretical modeling methods. Furthermore, the core of theoretical modeling of cross-domain resources and cross-domain resource discovery lies in the development of an efficient resource search process. However, the current resource search process is difficult to use different types of resource representation and discovery requirements, which makes the resource search efficiency and accuracy low, and it is difficult to achieve efficient discovery of cross-domain resources. Summary of the invention

[0003] In view of the above problems, the present invention provides a resource search method, device and electronic device for improving resource search efficiency and accuracy.

[0004] One aspect of the present invention provides a resource search method, comprising: in response to a resource search request configured with a target number of resources sent by a requesting node, loopingly performing the following operations until the number of resources in a resource result set meets the target number of resources: performing an intra-domain search based on a set of neighboring nodes of the requesting node in a resource aspect to obtain a first resource result subset, wherein the resource aspect is obtained by mapping a multi-dimensional stacked network containing multiple domains and multiple heterogeneous resources; in response to the number of resources in the first resource result subset not meeting the target number of resources, performing a cross-domain search among the cross-domain neighbors of the requesting node according to the attributes of the domain where the neighboring nodes of the requesting node are located to obtain a second resource result subset; merging the first resource result subset and the second resource result subset to obtain a resource result set, and comparing the relationship between the number of resources in the resource result set and the target number of resources; in response to the number of resources in the resource result set meeting the target number of resources, pushing the resource result set.

[0005] According to an embodiment of the present invention, a resource slice is obtained by mapping a multi-dimensional stacked network containing multi-domain and multi-heterogeneous resources, including: constructing a heterogeneous graph structure based on the multi-domain and multi-heterogeneous resources on the multi-dimensional stacked network; constructing a mask gate array based on resource characteristic semantics and the heterogeneous graph structure; and mapping the multi-dimensional stacked network into different types of resource slices through the mask gate array.

[0006] According to an embodiment of the present invention, a mask gate array is constructed based on resource characteristic semantics and a heterogeneous graph structure, including: obtaining resource characteristic semantics; generating a mask gate array according to an inter-node path reachability matrix of the heterogeneous graph structure under the resource characteristic semantics, and a transposed matrix of the inter-node path reachability matrix.

[0007] According to an embodiment of the present invention, the resource search request is also configured with constraints, and the neighborhood node set includes multiple resource nodes; an intra-domain search is performed based on the neighborhood node set of the requesting node in the resource aspect to obtain a first resource result subset, including: initializing the access preference of the resource node; in response to the presence of resources satisfying the constraints in the queue, the resources satisfying the constraints are added to the first resource result subset, wherein the queue is generated based on the access preference of the resource node.

[0008] According to an embodiment of the present invention, a queue is generated based on the access preference of resource nodes, including: arranging the preference weights of the resource nodes in descending order to obtain a sorting result; adding the first K resource nodes in the sorting result to the queue, where K is a positive integer.

[0009] According to an embodiment of the present invention, in the cross-domain neighbors of the requesting node, a cross-domain search is performed according to the attributes of the domain where the neighboring nodes of the requesting node are located, and a second resource result subset is obtained, including: for the requesting node, in the cross-domain neighbors of the requesting node, according to the collaborative management mode of the domain where the neighboring nodes are located, the first K′ resource nodes are selected to join the queue, and the collaborative management mode includes at least one of centralized, delegated and autonomous modes, and K′ is a positive integer; traverse each resource in the queue, dequeue the resource, and search within the resource domain where the resource is located; in response to the resources searched within the domain satisfying the constraints, the resources satisfying the constraints are added to the second resource result subset.

[0010] According to an embodiment of the present invention, the method further includes: caching the information of the resource node to the target node; and distributing the information of the resource node to the requesting node through the target node in response to the state of network connectivity.

[0011] According to an embodiment of the present invention, the access preference of a resource node is obtained in the following manner: the number of times each resource node has been searched is obtained to obtain the number of historical searches; the historical search rate of the resource node is obtained based on the ratio of the number of historical searches to the number of target resources; and the access preference of the resource node is generated based on predetermined hyperparameters, the degree of the resource node and the historical search rate of the resource node.

[0012] Another aspect of the present invention also provides a resource search device, which includes: a response module, which is used to respond to a resource search request configured with a target number of resources sent by a requesting node, and cyclically perform the following operations until the number of resources in the resource result set meets the target number of resources: in the resource section, a domain search is performed based on a set of neighboring nodes of the requesting node to obtain a first resource result subset, wherein the resource section is obtained by mapping a multi-dimensional stacked network including multiple domains and multiple heterogeneous resources; in response to the number of resources in the first resource result subset not meeting the target number of resources, a cross-domain search is performed among the cross-domain neighbors of the requesting node according to the attributes of the domain where the neighboring nodes of the requesting node are located to obtain a second resource result subset; the first resource result subset and the second resource result subset are merged to obtain a resource result set, and the relationship between the number of resources in the resource result set and the target number of resources is compared; a push module, which is used to push the resource result set in response to the number of resources in the resource result set meeting the target number of resources.

[0013] Another aspect of the present invention provides an electronic device, comprising: one or more processors; a memory for storing one or more computer programs, wherein the one or more processors execute the one or more computer programs to implement the steps of the above method.

[0014] According to the resource search method, device and electronic device provided by the embodiment of the present invention, by performing an intra-domain search on the resource section obtained by mapping the multi-dimensional stacked network, and when the number of resources in the first resource result subset does not meet the target resource number, a cross-domain search is performed based on the neighbor nodes of the requesting node to obtain a resource result subset that meets the resource number. Since multiple heterogeneous resources are taken into account in the resource search process, and only the same type of resources are no longer considered, and the two methods of intra-domain search and cross-domain search are combined, efficient discovery of resources can be achieved, achieving the technical effect of improving the efficiency and accuracy of resource search. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] The above contents and other objects, features and advantages of the present invention will become more apparent through the following description of the embodiments of the present invention with reference to the accompanying drawings, in which:

[0016] Figure 1 An application scenario diagram of a resource search method according to an embodiment of the present invention is shown;

[0017] Figure 2 A flow chart of a resource search method according to an embodiment of the present invention is shown;

[0018] Figure 3 A schematic diagram showing mapping a multi-dimensional stacked network into resource slices according to an embodiment of the present invention is shown;

[0019] Figure 4A flowchart of a resource search method according to another embodiment of the present invention is shown;

[0020] Figure 5 It shows a structural block diagram of a resource search device according to an embodiment of the present invention;

[0021] Figure 6 A block diagram of an electronic device suitable for implementing a resource search method according to an embodiment of the present invention is shown. DETAILED DESCRIPTION

[0022] Below, embodiments of the present invention will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present invention. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of embodiments of the present invention. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of concepts of the present invention.

[0023] The terms used herein are only for describing specific embodiments and are not intended to limit the present invention. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0024] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification and should not be interpreted in an idealized or overly rigid manner.

[0025] When using expressions such as "at least one of A, B, and C, etc.", they should generally be interpreted according to the meaning of the expression commonly understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0026] In the technical solution of the present invention, the user information (including but not limited to user personal information, user image information, user device information, such as location information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved are all information and data authorized by the user or fully authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of the relevant data comply with relevant laws, regulations and standards, take necessary confidentiality measures, do not violate public order and good morals, and provide corresponding operation entrances for users to choose to authorize or refuse.

[0027] In the scenario of using personal information for automated decision-making, the methods, devices, and systems provided by the embodiments of the present invention provide users with corresponding operation portals for users to choose to agree or reject the automated decision-making results; if the user chooses to reject, the expert decision-making process will be entered. The expression "automated decision-making" here refers to the activity of automatically analyzing and evaluating an individual's behavioral habits, interests and hobbies, or economic, health, credit status, etc. through computer programs, and making decisions. The expression "expert decision-making" here refers to the activity of making decisions by people who specialize in a certain field, have specialized experience, knowledge and skills, and have reached a certain level of professionalism.

[0028] At present, the academic and industrial circles have carried out extensive and in-depth research on the modeling and discovery of cross-domain resources. The existing methods mainly include cross-domain resource discovery based on ontology modeling, cross-domain resource representation based on representation learning methods, sparse cross-domain resource representation and scheduling, etc. For example, a global resource discovery method for specific tasks mainly targets the problems of large global resources and opaque resource information between domains. Based on the resource ontology model, it uses technologies such as ontology similarity matching, triangular fuzzy number and fuzzy C-means clustering to complete the search for target resources in three stages. For another example, when modeling resources, a cross-modal information aggregation method is adopted. First, according to the recall sorting strategy, a dual encoder is used to achieve rough recall, and then a fusion encoder is used to achieve precise sorting; secondly, according to the algorithm of constructing dual encoders and fusion encoders based on multi-channel Transformer pre-training models, high-quality semantic alignment of cross-modal information is achieved to improve model performance. For another example, when modeling resources, starting from the law of resource utilization, a feature matrix is ​​constructed for the resources of each domain, and a hierarchical sparse resource representation method is proposed to accurately describe the resource status of each domain in real time with low complexity. Furthermore, a cross-domain dynamic multi-resource scheduling algorithm is designed to achieve efficient cross-domain resource scheduling by introducing advantage factors and policy-oriented hyperparameters.

[0029] Although the above methods realize resource scheduling, these cross-domain resource modeling technologies usually only consider resources of the same type and are difficult to adapt to different types of resource representation and discovery requirements. In addition, in the cross-domain discovery process of resources, the above methods ignore the fact that in reality, each resource can only know the resource status in its neighborhood, and do not consider the different preferences for resource access within and between domains. Therefore, an embodiment of the present invention proposes a method for multi-dimensional stacking networking of heterogeneous resources, combines the usage characteristics of various types of resources to construct a semantic-based mask gate array, hierarchically maps the global resource space into resource slices, and realizes the chain-type space conversion of hybrid topology resources "physical space-logical space-hierarchical slices". When discovering heterogeneous cross-domain resources, a "intra-domain-inter-domain" segmented resource discovery method is proposed. According to the constraint description of the required resource characteristics, a cross-domain resource discovery technology with a dynamic preference strategy is designed to achieve efficient discovery of cross-domain resources.

[0030] Figure 1 An application scenario diagram of a resource search method according to an embodiment of the present invention is shown.

[0031] like Figure 1 As shown, the application scenario 100 according to this embodiment may include a first terminal device 101, a second terminal device 102, a third terminal device 103, a network 104, and a server 105. The network 104 is used to provide a medium for a communication link between the first terminal device 101, the second terminal device 102, the third terminal device 103, and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or optical fiber cables, etc.

[0032] The user can use the first terminal device 101, the second terminal device 102, and the third terminal device 103 to interact with the server 105 through the network 104 to receive or send messages, etc. Various communication client applications can be installed on the first terminal device 101, the second terminal device 102, and the third terminal device 103, such as search applications, shopping applications, web browser applications, instant messaging tools, email clients, social platform software, etc. (only for example).

[0033] The first terminal device 101, the second terminal device 102, and the third terminal device 103 may be various electronic devices having display screens and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.

[0034] The server 105 may be a server that provides various services, such as a background management server (only as an example) that provides support for websites browsed by users using the first terminal device 101, the second terminal device 102, and the third terminal device 103. The background management server may analyze and process the received data such as resource search requests, and feed back the processing results (such as resource result sets, web pages, information, or data obtained or generated according to the request) to the terminal device.

[0035] It should be noted that the resource search method provided in the embodiment of the present invention can generally be executed by the server 105. Accordingly, the resource search device provided in the embodiment of the present invention can generally be set in the server 105. The resource search method provided in the embodiment of the present invention can also be executed by a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105. Accordingly, the resource search device provided in the embodiment of the present invention can also be set in a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105.

[0036] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.

[0037] The following will be based on Figure 1 The scene described by Figure 2~Figure 4 The resource search method according to the embodiment of the present invention is described in detail.

[0038] Figure 2 A flow chart of a resource search method according to an embodiment of the present invention is shown.

[0039] like Figure 2 As shown, the resource search method of this embodiment includes operations S210 to S220.

[0040] In operation S210, in response to a resource search request sent by a requesting node and configured with a target number of resources, the following operations of intra-domain search, cross-domain search, and search result merging are performed cyclically until the number of resources in the resource result set meets the target number of resources:

[0041] In the resource slice, a domain search is performed based on a set of neighboring nodes of the requesting node to obtain a first resource result subset, wherein the resource slice is obtained by mapping a multi-dimensional stacked network containing multiple domains and multiple heterogeneous resources;

[0042] In response to the number of resources in the first resource result subset not satisfying the target resource number, performing a cross-domain search among cross-domain neighbors of the requesting node according to the attributes of the domain where the neighboring nodes of the requesting node are located, to obtain a second resource result subset;

[0043] The first resource result subset and the second resource result subset are merged to obtain a resource result set, and the relationship between the number of resources in the resource result set and the number of target resources is compared.

[0044] In operation S220 , in response to the number of resources in the resource result set satisfying the target number of resources, the resource result set is pushed.

[0045] Optionally, the requesting node may be a node that initiates a resource search request. The resource search request may be a query instruction issued by a user or a system to obtain files or data, etc. The number of target resources may be the number of resources to be found in the resource search request, such as the number of files or data to be found. The resource result set may be files or data searched according to the resource search request.

[0046] Optionally, multiple domains and multiple heterogeneous resources, such as user resources, service resources, storage and computing resources, data resources and other resources, can be distributed in multiple domains, and the properties and functions of these resources are different.

[0047] A multi-dimensional stacked network can represent a relationship network between multiple domains and multiple heterogeneous resources. The multi-dimensional stacked network can contain multiple types of nodes and edges, such as physical nodes, logical nodes, intra-layer nodes, inter-layer nodes, physical edges, logical edges, intra-layer edges, and inter-layer edges. This multi-dimensional stacked network can describe the relationship between resources from multiple dimensions (such as users, services, storage, data, etc.).

[0048] Resource slices can be obtained by mapping a multi-dimensional stacked network. Each slice can be composed of cross-domain resources of the same type and their relationships, so as to classify and manage resources. For example, the user resource slice can include all user resources and their relationships, and the service resource slice contains all service resources and their relationships.

[0049] In one example, the neighborhood node set may include resource nodes directly connected to the requesting node in the same domain or layer in the multi-dimensional stacked network. In the neighborhood node set, an intra-domain search may be performed in the domain where the resource node is located, and the results of the intra-domain search may be added to the first resource result subset. In one example, the resource search request may be configured with constraints, which may include the number of target resources, a set of resource attributes, a set of resource types, and a set of resource domains. In one example, the intra-domain search may define a queue, select the first K (K is a positive integer) resource nodes in the neighborhood nodes in descending order of preference weight to enter the queue, and traverse each resource node in the queue. If the resource indicated by the resource node meets the constraint, the resource is added to the first resource result subset. The resources in the first resource result subset may be resources whose resource attributes, resource types, and domains where the resources are located all meet the resource attribute set, resource type set, and resource domain set in the constraint.

[0050] If the number of resources in the first resource result subset meets the target number of resources in the constraint condition, the first resource result subset can be used as the resource result set pushed to the user or system; if the number of resources in the first resource result subset does not meet the target number of resources, for example, is less than the target number of resources, in this case, a cross-domain search can be performed.

[0051] In one example, a cross-domain neighbor can be a resource node that is directly connected to the requesting node in a different domain or layer in a multi-dimensional stacked network. The attribute of the domain, for example, is a collaborative management mode. When performing a cross-domain search, cross-domain access can be performed according to the collaborative management mode of different domains and the clustered opportunistic distribution strategy, and the above-mentioned intra-domain resource search process is called in the domain of the cross-domain access. For example, K′ is selected, K′ is a positive integer number of resource nodes or resource domains added to the above-mentioned queue queue, and each element in the queue, such as a resource node, is traversed, and the intra-domain search process described above is repeated in the resource domain where the resource node is located. If the resource indicated by the resource node meets the above-mentioned constraints, the resource is added to the second resource result subset.

[0052] When the sum of the number of resources in the first resource result subset and the number of resources in the second resource result subset is equal to the target number of resources, the resources in the first resource result subset and the resources in the second resource result subset can be merged to obtain a resource result set, which can be pushed to the user or system. In one example, the resources in the first resource result subset can carry an identification of an intra-domain search, and the resources in the second resource result subset can carry an identification of a cross-domain search, so that the user or system can distinguish between resources searched within the domain and resources searched across domains according to the identification.

[0053] According to the resource search method, device and electronic device provided by the embodiment of the present invention, by performing an intra-domain search on the resource section obtained by mapping the multi-dimensional stacked network, and when the number of resources in the first resource result subset does not meet the target resource number, a cross-domain search is performed based on the neighbor nodes of the requesting node to obtain a resource result subset that meets the resource number. Since multiple heterogeneous resources are taken into account in the resource search process, and only the same type of resources are no longer considered, and the two methods of intra-domain search and cross-domain search are combined, efficient discovery of resources can be achieved, achieving the technical effect of improving the efficiency and accuracy of resource search.

[0054] Figure 3 A schematic diagram of mapping a multi-dimensional stacked network into resource slices according to an embodiment of the present invention is shown.

[0055] like Figure 3 As shown in the figure, the organization of various cross-domain resources is related to the resource type and the topological relationship of the physical nodes where the resources are located. In the actual physical topology, the central domain and its multiple slave domains form a ring structure. For example, the central domain and slave domains A, B, C, D and E form a ring structure. The slave domain resource service center can serve as a central node to provide computing and storage resources for its nodes. Therefore, the global computing and storage resource directory is organized in a ring and star hybrid topology. The services between multiple nodes in a single system domain can access each other. The service directory between multiple nodes presents a mesh structure. The data resources in a single domain are usually organized in a tree topology. For this reason, the global service resource directory is organized in a cloud-edge cascade multi-level ring and single-domain mesh hybrid topology, and the global data resource directory is organized in a cloud-edge cascade multi-level ring and single-domain tree hybrid topology. Since user resources can have an organizational hierarchical relationship, user resources can be distributed according to the tree topology organization. User resources, service resources, storage and computing resources, and data resources can rely on self-organizing and reloadable distributed resource management services to logically organize various types of resources distributed over a wide area.

[0056] Based on this, the embodiments of the present invention can map various heterogeneous resources to corresponding resource slices to realize the conversion of "physical space-logical space-layered slices" of hybrid topology resources; then according to the "intra-domain-inter-domain" segmented resource discovery method, efficient cross-domain resource discovery based on dynamic preference strategy can be realized. In one example, the resource slice can be as follows Figure 3 As shown, in each resource aspect, there can be resources of the same type and relationships between resources.

[0057] Optionally, Figure 3The resource slices in the can be obtained in the following ways: construct a heterogeneous graph structure based on multi-domain and multi-type heterogeneous resources on the multi-dimensional stacked network; construct a mask gate array based on resource characteristic semantics and the heterogeneous graph structure; and map the multi-dimensional stacked network into different types of resource slices through the mask gate array.

[0058] In some embodiments, a semantics-based mask gate array can be defined for mapping a multi-dimensional stacked network composed of multiple domains and multiple heterogeneous resources into different types of resource slices. In one example, the semantics-based mask gate array can be constructed based on resource feature semantics and a heterogeneous graph structure. Optionally, the process may include the following operations: obtaining resource feature semantics; generating a mask gate array based on the inter-node path reachability matrix of the heterogeneous graph structure under the resource feature semantics, and the transposed matrix of the inter-node path reachability matrix.

[0059] In some embodiments, various types of resources rely on a self-organizing reloadable distributed resource management service to logically organize various types of resources distributed over a wide area.

[0060] Heterogeneous resources can be represented as a heterogeneous graph structure , graph structure Each node on can represent a resource. It can represent the collection of all resource nodes. The nodes in the collection can include various types, such as users, services, storage and computing, and data. It can represent a collection of relationships between resource nodes. This relationship can include multiple types of relationships, such as the relationship between users and services, the relationship between services and data, etc. When performing multi-dimensional stacking mapping of heterogeneous resources, resource feature semantics can be used. In heterogeneous graphs middle, It can represent a meta-path or meta-structure. Meta-path can be used to describe the path pattern between resource nodes. Meta-path can be composed of a series of node types and edge types, representing the path from one node type to another. For example, user Serve Data can be a meta-path. Meta-structure can be an extension of meta-path, describing the structural pattern between resource nodes, such as a hierarchical structure or network structure between multiple resource nodes, such as user Serve data Serve Users, etc. Meta structures can represent not only line paths, but also tree shapes, rings, etc.

[0061] In semantics The mask gate array can be calculated as ,in ,in Representing heterogeneous graph structures exist The node path reachability matrix below can indicate whether there is a certain path between resource nodes, that is, whether they are reachable. Can be The transposed matrix of is a mask gate array, which can be expressed in semantic The reachability between resource nodes.

[0062] According to the above solution process, the reachability matrix of user resources, service resources, storage resources and data resources can be obtained, such as the reachability matrix of user resources , the reachability matrix of service resources , the reachability matrix of storage and computing resources , and the reachability matrix of data resources So far, it has been achieved to map the multi-dimensional stacked network composed of multi-domain and multi-heterogeneous resources into different types of resource slices, each of which is composed of the same type of cross-domain resources and the relationships between them.

[0063] According to an embodiment of the present invention, by constructing a method based on a mask gate array and using a semantic-based mask gate array to map a multi-dimensional stacked network into a resource slice, multi-domain and multi-type heterogeneous resources can be effectively organized and classified, facilitating resource management and access.

[0064] Optionally, the resource search request described above may be configured with constraints, and the neighborhood node set may include multiple resource nodes; the process of performing an intra-domain search based on the neighborhood node set of the requesting node in the resource aspect to obtain a first subset of resource results may include the following operations: initializing the access preferences of the resource nodes; in response to the presence of resources satisfying the constraints in the queue, adding the resources satisfying the constraints to the first subset of resource results, wherein the queue is generated based on the access preferences of the resource nodes.

[0065] Optionally, the queue is generated based on the access preference of the resource nodes. In one embodiment, it can be generated in the following manner: the preference weights of the resource nodes are arranged in descending order to obtain a sorting result; the first K resource nodes in the sorting result are added to the queue, where K is a positive integer.

[0066] In some embodiments, the present invention proposes a biased breadth-first resource access strategy based on resource historical discovery rate and topology. In one example, for the current requesting node, given a set of constraints on the required resources , the number of target resources, that is, the number of resources requested , a collection of properties for each resource , a collection of resource types , the domain collection where the resource is located .

[0067] Under the condition that each resource can only obtain the status of its neighboring resources, for the current node , initialize the access preference of resource nodes in its neighborhood node set: ,in , Represents a resource node , The degree, Represents a resource node The degree of a node refers to the number of edges directly connected to a node. The higher the degree of a node, the more neighboring nodes the node is connected to, which usually means that the node is more important in the network. The higher the access preference The larger the The higher the probability of a node being visited.

[0068] Define a queue, select the first K resource nodes in descending order of neighborhood node preference weights and enter the queue, that is, . Traverse each resource in the queue, if the resource meets the constraints , then add the resource to the first resource result subset.

[0069] Optionally, the access preference of resource nodes in the above process can be obtained in the following way: obtain the number of times each resource node has been searched to obtain the historical search number; obtain the historical search rate of the resource node based on the ratio of the historical search number to the target resource number; generate the access preference of the resource node based on predetermined hyperparameters, the degree of the resource node and the historical search rate of the resource node.

[0070] Optionally, after multiple domain search resource tasks have been executed, the historical search rate of each resource can be calculated. , which can be obtained by the ratio of the number of historical searches for the resource to the number of target resources, that is, the total number of tasks for searching for resources in the domain, that is, . The historical search rate can reflect the resource node By introducing the historical discovery rate, the access order can be dynamically adjusted to give priority to more popular resources.

[0071] Based on this, the resource node The access preference can be calculated as: ,in is a hyperparameter that can be used to balance the impact of topology and historical discovery rate. When it is close to 1, the preference can be mainly determined by the topological structure. When it is close to 0, the preference can be mainly determined by the historical search rate.

[0072] According to an embodiment of the present invention, the above-mentioned intra-domain search method adds preference weights when searching for resources, which can make the order of searching resources more intelligent. The above-mentioned intra-domain search method dynamically adjusts the preference weights of resource searches through the degree and historical discovery rate of the nodes, selects the top K nodes with the highest preference weights to enter the queue, and screens resources that meet the constraints, and balances the influence of the topological structure and the historical discovery rate through hyperparameters, making the intra-domain search method more flexible and intelligent, improving the efficiency of resource discovery and search, and can be applied to scenarios with uneven resource distribution or complex network topology.

[0073] Optionally, if resources that meet the constraints are searched within the above-mentioned domain and added to the first resource result subset, but the number of resources in the first resource result subset is less than the number of target resources, in this case, cross-domain search can be performed on heterogeneous resources, and cross-domain access can be performed according to the collaborative management mode and clustered opportunistic distribution rules of different domains, and the resource discovery process within the domain can be called in the new domain.

[0074] Optionally, the above-mentioned process of performing a cross-domain search among the cross-domain neighbors of the requesting node according to the attributes of the domain where the neighbor nodes of the requesting node are located to obtain the second resource result subset may include the following operations: for the requesting node, among the cross-domain neighbors of the requesting node, according to the collaborative management mode of the domain where the neighbor nodes are located, select the first K′ resource nodes to join the queue, the collaborative management mode includes at least one of centralized, delegated and autonomous modes, and K′ is a positive integer; traverse each resource in the queue, dequeue the resource, and perform an intra-domain search in the resource domain where the resource is located; in response to the resources searched within the domain satisfying the constraints, add the resources that satisfy the constraints to the second resource result subset.

[0075] Optionally, different domains have different collaborative management modes and different cross-domain access policies, including centralized , Delegated and autonomous The centralized mode uses direct access, which means that the requesting node can directly access the target resource without intermediate steps. The delegated mode uses conditional access, and the requesting node needs to meet the conditions to access the target resource, which may require an intermediary or authorization. The autonomous mode uses indirect access, and the requesting node cannot directly access the target resource, and may need to access it indirectly through other nodes.

[0076] For the resource node of the requesting node , in its cross-domain neighbors According to the different collaborative management modes of the domain where the neighboring nodes are located, select resource domains are added to the queue, and this process can be expressed as ,in Represents a resource node The resource domain.

[0077] Traverse each element in the queue, such as a resource, dequeue it, and repeat the resource discovery process described above in the resource domain where the resource is located. If the resource indicated by the resource node meets the constraint conditions , then add it to the second resource result subset.

[0078] According to the embodiments of the present invention, the process of searching for resources across domains can discover resources in multiple domains, and no longer only considers resources of the same type, thereby improving the comprehensiveness and efficiency of resource discovery and search.

[0079] Optionally, in the case of cross-domain search, the network may be temporarily unavailable. Based on this, the method provided by the embodiment of the present invention, on the basis of the above operations, may also include the following operations: caching the information of the resource node to the target node; in response to the network connectivity status, distributing the information of the resource node to the requesting node through the target node.

[0080] Optionally, the cross-domain connection may be temporarily unavailable. When the network connectivity is insufficient, the embodiment of the present invention can cache the resource node information to the target node, such as the central node, which can be a global management node responsible for storing and distributing resource information.

[0081] According to the opportunistic distribution strategy, access continues after the network is connected to achieve global discovery of resources and their search paths. When the network is restored to connectivity, the central node can distribute resource node information to the requesting node based on the cached information. This distribution strategy can be "opportunistic", which means that the distribution behavior depends on the connectivity of the network. Resources are distributed only when the network is connected.

[0082] According to an embodiment of the present invention, global discovery of resources and their search paths can be achieved through caching and opportunistic distribution, and resources can be obtained even when the network is temporarily unavailable, thereby improving the reliability of resource access and global coverage capabilities.

[0083] In one example, the above process can be described as follows:

[0084] Input: Request Node , the set of constraints for requesting resources , the number of target resources requested , a collection of properties for each resource , corresponding to the resource type set , the domain set of the domain where the resource is located .

[0085] Output: Satisfy the constraints Resource result set .

[0086] Get the resource type described by the constraint, search the domain, and add the search results to the resource result set. If the resource result set The number of resources in is less than , a cross-domain search is performed.

[0087] When searching within the domain, the first K nodes in terms of node neighborhood preference weight can be put into a queue, and the resources in the queue that meet the constraints can be inserted into the resource result set.

[0088] During cross-domain search, the cross-domain relationship of resources in the current resource group is obtained, and the first K′ cross-domain nodes are selected into the queue according to the collaborative management mode and cluster opportunistic distribution. The resources in the queue are judged whether they meet the constraints, and the resources that meet the constraints are added to the resource result set.

[0089] Figure 4 A flow chart of a resource search method according to another embodiment of the present invention is shown.

[0090] The embodiment of the present invention also provides another resource search method, such as Figure 4 As shown, the method may include operations S410 to S450.

[0091] In operation S410, a multi-dimensional stacked network composed of multiple domains and multiple heterogeneous resources is mapped into different types of resource slices.

[0092] In operation S420, a resource satisfying the constraint set is searched in the domain where the requesting node is located.

[0093] In operation S430, it is determined whether the current resource group meets the quantity of the requested resources. If so, operation S450 may be performed; if not, operation S440 may be performed.

[0094] In operation S440, cross-domain access is performed according to the collaborative management mode of different domains and the cluster opportunistic distribution rule.

[0095] In operation S450, the obtained resource result set is returned.

[0096] In an example, operations S410 to S440 may refer to operation S210, and operation S450 may refer to operation S220.

[0097] The resource search method provided in the embodiment of the present invention combines the multi-dimensional stacked networking based on the semantic mask gate array and the segmented cross-domain resource discovery algorithm based on the dynamic preference strategy. Aiming at the difficulty of multiple resource types and cross-domain distribution, a multi-dimensional stacked networking method based on the semantic mask gate array is proposed. The semantic-based mask gate array is constructed in combination with the usage characteristics of various resources, and the global resource space is hierarchically mapped into resource slices to realize the chain-type space conversion of the "physical space-logical space-layered slice" of the hybrid topology resource. Aiming at the difficulty that only the status of local neighborhood resources can be detected for actual cross-domain resources, and it is difficult to realize the global resource discovery, a "intra-domain-inter-domain" segmented resource discovery method is proposed. According to the constraint description of the required resource characteristics, a cross-domain resource discovery technology with a dynamic preference strategy is designed to realize efficient discovery of cross-domain resources.

[0098] It should be noted that, unless it is explicitly stated that there is a sequence of execution between different operations shown in the flowchart in the embodiments of the present invention, or different operations have a sequence of execution in technical implementation, otherwise, the execution order of multiple operations may not be particular, and multiple operations may also be executed simultaneously.

[0099] Based on the above resource search method, the present invention also provides a resource search device. Figure 5 The device is described in detail.

[0100] Figure 5 A structural block diagram of a resource search device according to an embodiment of the present invention is shown.

[0101] like Figure 5 As shown, the resource search device 500 of this embodiment includes a response module 510 and a push module 520 .

[0102] The response module 510 is used to respond to a resource search request configured with a target number of resources sent by a requesting node, and to loop through the following operations until the number of resources in a resource result set meets the target number of resources: performing an intra-domain search based on a set of neighboring nodes of the requesting node in a resource aspect to obtain a first resource result subset, wherein the resource aspect is obtained by mapping a multi-dimensional stacked network containing multiple domains and multiple heterogeneous resources; in response to the number of resources in the first resource result subset not meeting the target number of resources, performing a cross-domain search among the cross-domain neighbors of the requesting node based on the attributes of the domain where the neighboring nodes of the requesting node are located to obtain a second resource result subset; merging the first resource result subset and the second resource result subset to obtain a resource result set, and comparing the relationship between the number of resources in the resource result set and the target number of resources.

[0103] The push module 520 is configured to push the resource result set in response to the number of resources in the resource result set satisfying the target number of resources.

[0104] According to the resource search method, device and electronic device provided by the embodiment of the present invention, by performing an intra-domain search on the resource section obtained by mapping the multi-dimensional stacked network, and when the number of resources in the first resource result subset does not meet the target resource number, a cross-domain search is performed based on the neighbor nodes of the requesting node to obtain a resource result subset that meets the resource number. Since multiple heterogeneous resources are taken into account in the resource search process, and only the same type of resources are no longer considered, and the two methods of intra-domain search and cross-domain search are combined, efficient discovery of resources can be achieved, achieving the technical effect of improving the efficiency and accuracy of resource search.

[0105] According to an embodiment of the present invention, the response module 510 may include a first construction submodule, a second construction submodule and a mapping submodule.

[0106] The first construction submodule is used to construct a heterogeneous graph structure according to multi-domain and multi-heterogeneous resources on a multi-dimensional stacked network.

[0107] The second construction submodule is used to construct a mask gate array based on resource feature semantics and heterogeneous graph structure.

[0108] The mapping submodule is used to map the multi-dimensional stacked network into different types of resource slices through a mask gate array.

[0109] According to an embodiment of the present invention, the second construction submodule may include an acquisition unit and a first generation unit.

[0110] The acquisition unit is used to obtain resource attribute semantics.

[0111] The first generating unit is used to generate a mask gate array according to the inter-node path reachability matrix of the heterogeneous graph structure under the resource characteristic semantics and the transposed matrix of the inter-node path reachability matrix.

[0112] According to an embodiment of the present invention, the response module 510 may further include an initialization submodule and a first adding submodule.

[0113] The initialization submodule is used to initialize the access preference of the resource node.

[0114] The first adding submodule is used for adding the resources satisfying the constraint condition to the first resource result subset in response to the existence of resources satisfying the constraint condition in the queue, wherein the queue is generated based on the access preference of the resource node.

[0115] According to an embodiment of the present invention, the first adding submodule may include a sorting unit and an adding unit.

[0116] The sorting unit is used to sort the preference weights of the resource nodes in descending order to obtain a sorting result.

[0117] The adding unit is used to add the first K resource nodes in the sorting result to the queue, where K is a positive integer.

[0118] According to an embodiment of the present invention, the response module 510 may further include a selection submodule, a traversal submodule and a second adding submodule.

[0119] A selection submodule is used to select the first K′ resource nodes from the cross-domain neighbors of the requesting node to join the queue according to the collaborative management mode of the domain where the neighboring nodes are located. The collaborative management mode includes at least one of centralized, delegated and autonomous modes, and K′ is a positive integer.

[0120] The traversal submodule is used to traverse each resource in the queue, dequeue the resource, and search within the resource domain where the resource is located.

[0121] The second adding submodule is used for adding the resources satisfying the constraint condition to the second resource result subset in response to the resources searched in the domain satisfying the constraint condition.

[0122] According to an embodiment of the present invention, the resource search device may further include a cache module and a distribution module.

[0123] The cache module is used to cache the information of the resource node to the target node.

[0124] The distribution module is used to distribute the information of the resource node to the request node through the target node in response to the state of network connectivity.

[0125] According to an embodiment of the present invention, the first adding submodule may further include an acquiring unit, a result unit and a second generating unit.

[0126] The acquisition unit is used to obtain the number of times each resource node has been searched, and obtain the historical search number.

[0127] The result unit is used to obtain the historical search rate of the resource node according to the ratio of the historical search times to the target resource times.

[0128] The second generating unit is used to generate the access preference of the resource node based on the predetermined hyperparameter, the degree of the resource node and the historical search rate of the resource node.

[0129] According to an embodiment of the present invention, any multiple modules in the response module 510 and the push module 520 can be combined into one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module. According to an embodiment of the present invention, at least one of the response module 510 and the push module 520 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application-specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware and firmware or in any appropriate combination of any of them. Alternatively, at least one of the response module 510 and the push module 520 can be at least partially implemented as a computer program module, and when the computer program module is run, the corresponding function can be executed.

[0130] Figure 6 A block diagram of an electronic device suitable for implementing a resource search method according to an embodiment of the present invention is shown.

[0131] like Figure 6 As shown, the electronic device 600 according to an embodiment of the present invention includes a processor 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage part 608 to a random access memory (RAM) 603. The processor 601 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 601 may also include an onboard memory for caching purposes. The processor 601 may include a single processing unit or multiple processing units for performing different actions of the method flow according to an embodiment of the present invention.

[0132] In RAM 603, various programs and data required for the operation of electronic device 600 are stored. Processor 601, ROM 602 and RAM 603 are connected to each other via bus 604. Processor 601 performs various operations of the method flow according to the embodiment of the present invention by executing the program in ROM 602 and / or RAM 603. It should be noted that the program can also be stored in one or more memories other than ROM 602 and RAM 603. Processor 601 can also perform various operations of the method flow according to the embodiment of the present invention by executing the program stored in the one or more memories.

[0133] According to an embodiment of the present invention, the electronic device 600 may further include an input / output (I / O) interface 605, which is also connected to the bus 604. The electronic device 600 may further include one or more of the following components connected to the input / output (I / O) interface 605: an input portion 606 including a keyboard, a mouse, etc.; an output portion 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage portion 608 including a hard disk, etc.; and a communication portion 609 including a network interface card such as a LAN card, a modem, etc. The communication portion 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the input / output (I / O) interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 610 as needed, so that a computer program read therefrom is installed into the storage portion 608 as needed.

[0134] The present invention also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiment; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present invention is implemented.

[0135] According to an embodiment of the present invention, the computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, it may include but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present invention, the computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, an apparatus or a device. For example, according to an embodiment of the present invention, the computer-readable storage medium may include the ROM 602 and / or RAM 603 described above and / or one or more memories other than ROM 602 and RAM 603.

[0136] The embodiment of the present invention also includes a computer program product, which includes a computer program, and the computer program contains program code for executing the method shown in the flowchart. When the computer program product is run in a computer system, the program code is used to enable the computer system to implement the resource search method provided by the embodiment of the present invention.

[0137] The computer program executes the above functions defined in the system / device of the embodiment of the present invention when it is executed by the processor 601. According to the embodiment of the present invention, the system, device, module, unit, etc. described above can be implemented by a computer program module.

[0138] In one embodiment, the computer program may rely on tangible storage media such as optical storage devices, magnetic storage devices, etc. In another embodiment, the computer program may also be transmitted and distributed in the form of signals on a network medium, and downloaded and installed through the communication part 609, and / or installed from a removable medium 611. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0139] In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 609, and / or installed from the removable medium 611. When the computer program is executed by the processor 601, the above functions defined in the system of the embodiment of the present invention are performed. According to the embodiment of the present invention, the system, device, means, module, unit, etc. described above can be implemented by a computer program module.

[0140] According to an embodiment of the present invention, the program code for executing the computer program provided by the embodiment of the present invention can be written in any combination of one or more programming languages. Specifically, these computing programs can be implemented using high-level process and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, Java, C++, python, "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on the remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (e.g., using an Internet service provider to connect through the Internet).

[0141] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0142] It will be appreciated by those skilled in the art that the features described in the various embodiments of the present invention may be combined and / or combined in various ways, even if such combinations or combinations are not explicitly described in the present invention. In particular, without departing from the spirit and teachings of the present invention, the features described in the various embodiments of the present invention may be combined and / or combined in various ways. All of these combinations and / or combinations fall within the scope of the present invention.

[0143] The embodiments of the present invention are described above. However, these embodiments are only for the purpose of illustration, and are not intended to limit the scope of the present invention. Although each embodiment is described above, it does not mean that the measures in each embodiment cannot be used in combination advantageously. Without departing from the scope of the present invention, those skilled in the art may make various substitutions and modifications, which should all fall within the scope of the present invention.

Claims

1. A resource search method, characterized in that: include: In response to a resource search request sent by a requesting node and configured with a target number of resources, the following operations are performed cyclically until the number of resources in the resource result set meets the target number of resources: Performing an intra-domain search based on a set of neighboring nodes of the requesting node in a resource slice to obtain a first resource result subset, wherein the resource slice is obtained by mapping a multi-dimensional stacked network containing multiple domains and multiple heterogeneous resources; In response to the number of resources in the first resource result subset not satisfying the target number of resources, performing a cross-domain search among the cross-domain neighbors of the requesting node according to the attributes of the domain where the neighboring nodes of the requesting node are located, to obtain a second resource result subset; Merging the first resource result subset and the second resource result subset to obtain the resource result set, and comparing the relationship between the number of resources in the resource result set and the number of target resources; In response to the number of resources in the resource result set satisfying the target number of resources, the resource result set is pushed.

2. The method according to claim 1, characterized in that The resource slice is obtained by mapping a multi-dimensional stacked network containing multiple domains and multiple heterogeneous resources, including: Constructing a heterogeneous graph structure based on multiple domains and multiple heterogeneous resources on the multi-dimensional stacked network; Constructing a mask gate array based on resource characteristic semantics and the heterogeneous graph structure; The multi-dimensional stacked network is mapped into different types of resource slices through the mask gate array.

3. The method according to claim 2, characterized in that The step of constructing a mask gate array based on resource characteristic semantics and the heterogeneous graph structure includes: Get resource feature semantics; The mask gate array is generated according to the inter-node path reachability matrix of the heterogeneous graph structure under the resource characteristic semantics and the transposed matrix of the inter-node path reachability matrix.

4. The method according to claim 1, wherein: The resource search request is further configured with a constraint condition, and the neighborhood node set includes a plurality of resource nodes; The performing an intra-domain search based on a set of neighboring nodes of the requesting node in the resource section to obtain a first resource result subset includes: Initializing the access preference of the resource node; In response to the presence of resources satisfying the constraint condition in a queue, the resources satisfying the constraint condition are added to the first resource result subset, wherein the queue is generated based on the access preference of the resource node.

5. The method according to claim 4, characterized in that The queue is generated based on the access preference of the resource node, including: Arrange the preference weights of the resource nodes in descending order to obtain a sorting result; The first K resource nodes in the sorting result are added to the queue, where K is a positive integer.

6. The method according to claim 5, characterized in that The step of performing a cross-domain search among the cross-domain neighbors of the requesting node according to the attribute of the domain where the neighboring node of the requesting node is located to obtain a second resource result subset includes: For the requesting node, among the cross-domain neighbors of the requesting node, the first K′ resource nodes are selected to join the queue according to the collaborative management mode of the domain where the neighboring node is located, the collaborative management mode includes at least one of centralized, delegated and autonomous, and K′ is a positive integer; Traversing each resource in the queue, dequeuing the resource, and searching within the resource domain where the resource is located; In response to the resources searched in the domain satisfying the constraint condition, the resources satisfying the constraint condition are added to the second resource result subset.

7. The method according to claim 1, characterized in that The method further comprises: Cache the information of resource nodes to the target node; In response to the state of network connectivity, the information of the resource node is distributed to the requesting node through the target node.

8. The method according to claim 4, characterized in that The access preference of the resource node is obtained in the following way: Get the number of times each resource node has been searched and get the historical search count; Obtaining a historical search rate of the resource node according to a ratio of the historical search times to the target resource times; The access preference of the resource node is generated based on a predetermined hyperparameter, the degree of the resource node and the historical search rate of the resource node.

9. A resource search device, characterized in that: The device comprises: The response module is used to respond to the resource search request sent by the requesting node and configured with the target number of resources, and cyclically perform the following operations until the number of resources in the resource result set meets the target number of resources: Performing an intra-domain search based on a set of neighboring nodes of the requesting node in a resource section to obtain a first resource result subset, wherein the resource section is obtained by mapping a multi-dimensional stacked network including multiple domains and multiple heterogeneous resources; In response to the number of resources in the first resource result subset not satisfying the target number of resources, performing a cross-domain search among the cross-domain neighbors of the requesting node according to the attributes of the domain where the neighboring nodes of the requesting node are located, to obtain a second resource result subset; Merging the first resource result subset and the second resource result subset to obtain the resource result set, and comparing the relationship between the number of resources in the resource result set and the number of target resources; The push module is used to push the resource result set in response to the number of resources in the resource result set satisfying the target number of resources.

10. An electronic device, comprising: one or more processors; a memory for storing one or more computer programs, It is characterized in that the one or more processors execute the one or more computer programs to implement the steps of the method according to any one of claims 1 to 8.

Images