CN115834715B - Data sharing exchange method and system - Google Patents
Data sharing exchange method and system Download PDFInfo
- Publication number
- CN115834715B CN115834715B CN202310139616.6A CN202310139616A CN115834715B CN 115834715 B CN115834715 B CN 115834715B CN 202310139616 A CN202310139616 A CN 202310139616A CN 115834715 B CN115834715 B CN 115834715B
- Authority
- CN
- China
- Prior art keywords
- request
- value
- exchange
- sharing
- execution
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000012216 screening Methods 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 7
- 238000004458 analytical method Methods 0.000 claims description 5
- 230000007246 mechanism Effects 0.000 claims description 4
- 238000010276 construction Methods 0.000 claims description 3
- 230000009286 beneficial effect Effects 0.000 description 9
- 230000008569 process Effects 0.000 description 4
- 238000010835 comparative analysis Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a data sharing exchange method and a system, wherein the method comprises the following steps: establishing a first association relation between the first equipment and the shared platform and a second association relation between the first equipment and the exchange platform; capturing a first request result of an active requester and a second request result of a passive requester, which are received by a first device in a request period; performing first request classification on the first request result and performing second request classification on the second request result, and constructing to obtain a classification chart; obtaining a first exchange value and a first sharing value according to the classification chart, and meanwhile, obtaining a reference sharing value according to the first incidence relation and obtaining a reference exchange value according to the second incidence relation; comparing the first exchange value with the reference exchange value and the first shared value and the reference shared value: and controlling the first equipment to perform data sharing exchange according to the primary execution request. The data sharing exchange of the first equipment is effectively controlled, and the sharing exchange with the maximum efficiency is ensured.
Description
Technical Field
The present invention relates to the field of data sharing technologies, and in particular, to a data sharing and exchanging method and system.
Background
The existing data sharing and exchanging system can complete fine-grained access right control of data and stop the state of shared and exchanged data, generally, in the process of sharing and exchanging by adopting equipment, because a plurality of requests can be received at the same time, the congestion condition of sharing and exchanging can occur in the process of sharing and exchanging by the equipment, and further the sharing and exchanging efficiency is reduced.
Therefore, the present invention provides a data sharing and exchanging method and system.
Disclosure of Invention
The invention provides a data sharing exchange method and a data sharing exchange system, which are used for carrying out comparative analysis on exchange and sharing by establishing an association relation between equipment and a platform and a classification chart constructed by different request results, realizing effective control on data sharing exchange of first equipment and ensuring the most efficient sharing exchange.
The invention provides a data sharing and exchanging method, which comprises the following steps:
step 1: establishing a first association relation between first equipment and a shared platform, and simultaneously establishing a second association relation between the first equipment and an exchange platform;
step 2: determining a request period of a first device, and capturing a first request result of an active requester and a second request result of a passive requester received by the first device in each request period;
and step 3: according to the request classification rule, performing first request classification on the first request result and performing second request classification on the second request result, and constructing a classification chart;
and 4, step 4: obtaining a first exchange value and a first sharing value according to the classification chart, and simultaneously obtaining a reference sharing value according to the first incidence relation and a reference exchange value according to a second incidence relation;
and 5: comparing the first exchange value with the reference exchange value and the first shared value and the reference shared value:
when the first swap value is less than or equal to a reference swap value and the first shared value is less than or equal to a reference shared value, treating the first request and the second request as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first shared value is greater than the reference shared value, extracting a first number of sharing requests and a second number of exchanging requests in the classification map and regarding the first number of sharing requests and the second number of exchanging requests as primary execution requests;
when the first exchange value is larger than the reference exchange value and the first sharing value is smaller than or equal to the reference sharing value, extracting a third number of exchange requests and a total number of sharing requests in the classification map and regarding the exchange requests and the sharing requests as primary execution requests;
when the first exchange value is less than or equal to the reference exchange value and the first sharing value is greater than the reference sharing value, extracting a fourth number of sharing requests and a total number of exchanging requests in the classification chart, and regarding the sharing requests and the total number of exchanging requests as primary execution requests;
and 6: and controlling the first equipment to perform data sharing exchange according to the primary execution request.
Preferably, the establishing of the first association relationship between the first device and the shared platform includes:
acquiring output sharing events of the first equipment to obtain a sharing index of each output sharing event;
acquiring the total index frequency of the shared events, different shared indexes of all output shared events and the index occurrence frequency of the different shared indexes, and determining a first incidence relation with the shared platform.
Preferably, the establishing a second association relationship between the first device and the switching platform includes:
collecting the exchange data events of the first equipment to obtain an exchange index of each exchange data event;
and acquiring the total index frequency in the same exchange event, different exchange indexes in all exchange data events and the index occurrence frequency of the different exchange indexes, and determining a second association relation with the exchange platform.
Preferably, determining a request period of the first device, and capturing a first request result of the active requester and a second request result of the passive requester received by the first device in each request period includes:
determining a request period matched with the device unique symbol of the first device according to a preset device mechanism;
respectively capturing a first sharing request and a first exchanging request which are actively sent to the first equipment by the second equipment in each request period;
respectively capturing a second sharing request and a second exchange request which are actively sent to a third device by a first device in each request period;
the first sharing request, the first exchanging request, the number of the first sharing requests and the number of the first exchanging requests form a first request result;
and the second sharing request, the second exchanging request, the number of the second sharing requests and the number of the second exchanging requests form a second request result.
Preferably, according to the request classification rule, performing a first request classification on the first request result and performing a second request classification on the second request result, and constructing a classification diagram, including:
determining a plurality of active sharing requests of the same type and a plurality of active exchanging requests of the same type according to the first request classification result, and determining a plurality of passive sharing requests of the same type and a plurality of passive exchanging requests of the same type according to the second request classification result;
constructing a first graph according to the request quantity and the type weight of each type of request, wherein the first graph is a pie graph;
obtaining the occurrence condition of the requests involved by the first device at the same time, giving a request label to each request, adjusting the boundary of the graph blocks according to the label set of each graph block in the first graph to obtain a second graph, and regarding the second graph as a classification graph, wherein the classification graph comprises an active sharing block, an active switching block, a passive sharing block and a passive switching block.
Preferably, obtaining the first exchange value and the first shared value according to the classification map includes:
acquiring a first area of an active sharing request and a second area of an active exchange request in the classification chart, and simultaneously acquiring a third area of a passive sharing request and a fourth area of a passive exchange request in the classification chart;
obtaining a first shared value according to the first area and the third area;
and obtaining a first exchange value according to the second area and the fourth area.
Preferably, the extracting a third number of exchange requests in the classification map includes:
determining a remaining idle number according to a first difference between the reference shared value and the first shared value;
determining the number of redundant requests according to a second difference between the first exchange value and the reference exchange value;
and determining the final excess quantity according to the spare space of the residual spare quantity and the space to be occupied of the excess request quantity, and regarding the final excess quantity as a third quantity.
Preferably, the controlling the first device to perform data sharing exchange according to the primary execution request includes:
first ordering shared requests in the primary execution requests and second ordering the exchange requests;
constructing a request execution list according to the first sequencing result and the second sequencing result, wherein each column in the request execution list represents the same execution time;
constructing an execution function Z1 according to the execution columns in the request execution list at the same execution time;
wherein z01 represents the sharing request information of the active requester in the corresponding execution column; z02 represents the exchange request information of the active requesting party in the corresponding execution column; z03 represents the shared request information of the passive requesters in the corresponding execution column; z04 represents the exchange request information of the passive requesters in the corresponding execution column; n01 represents the request number of the sharing requests of the active requesters in the corresponding execution column; n02 represents the request number of the exchange requests of the corresponding active requesters in the execution column; n03 represents the request number of the sharing requests of the passive requesters in the corresponding execution column; n04 represents the request number of the exchange requests of the passive requesters in the corresponding execution column; x01 represents the request weight of each sharing request of the active requesting party in the corresponding execution column; x02 denotes the request weight of each exchange request of the active requester in the corresponding execution column; x03 represents the request weight of each shared request of the passive requesters in the corresponding execution column; x04 denotes the request weight of each exchange request of the passive requesters in the corresponding execution column; y1 represents a first request function; y2 represents a second request function; y3 represents a third request function; y4 represents a fourth request function;
acquiring an execution channel matched with the execution function Z1 from an execution database;
if the number of the execution channels is 1, performing data sharing and data exchange between the first equipment and the requester in the execution channels;
if the number of the execution channels is m1, determining a channel execution value of each execution channel;
wherein, yj1 represents the channel execution value corresponding to the j1 st execution channel; m1 represents the number of execution channels present; sim (yi, ui) represents the similarity value of the ith request function and the matching function existing in the jth execution channel;
the standard value of the matching function existing between the ith request function and the jth execution channel is represented; n0i represents the number of requests involved by the ith request function; />
Representing the request weight of the jth request in the ith request function in the jth execution channel;
according to
Screening maximum execution values, and if only one maximum execution value exists, acquiring an optimal channel consistent with the maximum execution value to perform data sharing and data exchange between the first equipment and the requester;
if there are multiple maximum execution values, the method is based on
The maximum individual execution value of the execution channel corresponding to the maximum execution value is obtained, which is in, or is greater than, the maximum individual execution value of the execution channel corresponding to the maximum execution value>
The ith individual execution value in the execution channel corresponding to the maximum execution value is represented;
and screening the optimal execution channel corresponding to the maximum value from all the maximum individual execution values to share and exchange data between the first equipment and the requester.
The invention provides a data sharing exchange system, comprising:
the system comprises a relation establishing module, a sharing module and a switching module, wherein the relation establishing module is used for establishing a first incidence relation between first equipment and a sharing platform and establishing a second incidence relation between the first equipment and a switching platform;
the result determining module is used for determining the request period of the first equipment and capturing a first request result of the active requester and a second request result of the passive requester, which are received by the first equipment in each request period;
the classification chart construction module is used for carrying out first request classification on the first request result and carrying out second request classification on the second request result according to the request classification rule and constructing to obtain a classification chart;
the value acquisition module is used for acquiring a first exchange value and a first shared value according to the classification chart, and meanwhile acquiring a reference shared value according to the first incidence relation and acquiring a reference exchange value according to a second incidence relation;
the value comparison analysis module is used for comparing and analyzing the first exchange value, the reference exchange value and the first shared value and the reference shared value:
when the first swap value is less than or equal to a reference swap value and the first shared value is less than or equal to a reference shared value, treating the first request and the second request as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first shared value is greater than the reference shared value, extracting a first number of sharing requests and a second number of exchanging requests in the classification map and regarding the first number of sharing requests and the second number of exchanging requests as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first sharing value is less than or equal to the reference sharing value, extracting a third number of exchange requests and a total number of sharing requests in the classification chart, and regarding the third number of exchange requests and the total number of sharing requests as primary execution requests;
when the first exchange value is less than or equal to the reference exchange value and the first shared value is greater than the reference shared value, extracting a fourth number of sharing requests and a total number of exchanging requests in the classification map and regarding the sharing requests and the total number of exchanging requests as primary execution requests;
and the shared switching module is used for controlling the first equipment to perform data shared switching according to the primary execution request.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
FIG. 1 is a flow chart of a data sharing exchange method according to an embodiment of the present invention;
fig. 2 is a block diagram of a data sharing switching system according to an embodiment of the present invention.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it should be understood that they are presented herein only to illustrate and explain the present invention and not to limit the present invention.
The invention provides a data sharing exchange method, as shown in fig. 1, comprising:
step 1: establishing a first association relation between first equipment and a shared platform, and simultaneously establishing a second association relation between the first equipment and an exchange platform;
step 2: determining a request period of a first device, and capturing a first request result of an active requester and a second request result of a passive requester received by the first device in each request period;
and step 3: according to the request classification rule, performing first request classification on the first request result and performing second request classification on the second request result, and constructing a classification chart;
and 4, step 4: obtaining a first exchange value and a first sharing value according to the classification chart, and simultaneously obtaining a reference sharing value according to the first incidence relation and a reference exchange value according to a second incidence relation;
and 5: comparing the first exchange value with the reference exchange value and the first shared value with the reference shared value:
when the first swap value is less than or equal to a reference swap value and the first shared value is less than or equal to a reference shared value, treating the first request and the second request as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first sharing value is greater than the reference sharing value, extracting a first number of sharing requests and a second number of exchanging requests in the classification chart and regarding the sharing requests and the exchanging requests as primary execution requests;
when the first exchange value is larger than the reference exchange value and the first sharing value is smaller than or equal to the reference sharing value, extracting a third number of exchange requests and a total number of sharing requests in the classification map and regarding the exchange requests and the sharing requests as primary execution requests;
when the first exchange value is less than or equal to the reference exchange value and the first sharing value is greater than the reference sharing value, extracting a fourth number of sharing requests and a total number of exchanging requests in the classification chart, and regarding the sharing requests and the total number of exchanging requests as primary execution requests;
step 6: and controlling the first equipment to perform data sharing exchange according to the primary execution request.
In this embodiment, the first association relationship refers to a relationship between the first device and the active sharing request and the passive sharing request in the sharing platform, for example, the first device is defined based on the number of the maximum active sharing request and the maximum passive sharing request of the sharing platform at the same time, and the types of different active sharing types and passive sharing types are defined, which are preset and can be used as a reference standard to facilitate subsequent comparison.
In this embodiment, the second association relationship refers to a relationship between the first device and the active exchange request and the passive exchange request in the exchange platform, for example, the first device is defined based on the maximum active exchange request and the maximum passive exchange request of the exchange platform at the same time, and the types of different active exchange types and passive exchange types are defined, which are preset and can be used as a reference standard to facilitate subsequent comparison.
The first association relation and the second association relation are determined to better clarify the relation between the request type, the request quantity, and the active and passive between platforms of the first device.
In this embodiment, a request cycle is a preset time period, for example, 10 seconds is a cycle, to acquire all requests existing in the cycle, a sharing request refers to transmitting shared data 1 existing in a first device to a requesting party, the requesting party is another device, the device may be an intelligent device, for example, a mobile phone, a notebook, and the like, and the sharing request is to acquire a shared resource that exists in the first device and can be called from a sharing platform, and the shared resource is various shared data.
In this embodiment, exchanging the request means that the shared data 2 existing in the first device is transmitted to the requester, and the shared data 3 of the requester is transmitted to the first device, and the two devices are exchanged.
In this embodiment, the first request result is a sharing request and an exchanging request sent by an active requester, and the second request result is a sharing request and an exchanging request sent by a passive requester, where the active requester may be a party that artificially controls a request actively sent by a device to a first device, and the passive requester may be a party that is not artificially controlled and has been previously set to actively send a request to the requester by the first device (i.e., the requester passively receives the request).
In this embodiment, the classification map is obtained by classifying based on active sharing and switching and passive sharing and switching, and is a pie chart.
In this embodiment, the first exchange value and the first share value are obtained by comparing areas of different tiles in the classification map.
In this embodiment, the reference shared value and the reference exchange value are obtained by comparing the occupied areas corresponding to the standard active and passive sharing request quantities and the occupied areas corresponding to the standard active and passive exchange request quantities.
In this embodiment, the primary execution request refers to being derived based on the first request and the second request.
In this embodiment, the shared exchange refers to a shared exchange based on the first device and a device corresponding to the active requester and a shared exchange based on the first device and a device corresponding to the passive requester.
The beneficial effects of the above technical scheme are: the exchange and sharing comparison analysis is carried out by establishing the association relationship between the equipment and the platform and the classification chart constructed by different request results, so that the effective control of the data sharing exchange of the first equipment is realized, and the most efficient sharing exchange is ensured.
The invention provides a data sharing exchange method, which establishes a first association relation between first equipment and a sharing platform and comprises the following steps:
acquiring output sharing events of the first equipment to obtain a sharing index of each output sharing event;
acquiring the total index frequency in the shared events, different shared indexes in all output shared events and the index occurrence frequency of the different shared indexes, and determining a first association relation with the shared platform.
In this embodiment, the output sharing event is preset, so that the sharing index of the output sharing event can be effectively obtained, and the sharing index includes the resource type and the resource amount that can be shared, so as to obtain all preset sharing indexes and the maximum occurrence frequency of different sharing indexes.
For example, there are events 1, 2, and 3, where event 1 corresponds to indicators 01 and 02, event 2 corresponds to indicators 01, 22, and 23, and event 3 corresponds to indicators 31, 02, 33, and 01, and in this case, the total frequency of event 1 is 2, the total frequency of event 2 is 3, and the total frequency of event 3 is 4.
In this embodiment, the maximum frequency of occurrence of the shared index, for example, the maximum frequency of occurrence of 01 is 3, and so on.
The beneficial effects of the above technical scheme are: by collecting and outputting the sharing events, the indexes, the frequency and the like can be obtained conveniently, and then the first incidence relation can be obtained, so that a basis is provided for the subsequent comparative analysis, and the high efficiency of sharing exchange is ensured.
The invention provides a data sharing exchange method, which establishes a second association relation between first equipment and an exchange platform and comprises the following steps:
collecting the exchange data events of the first equipment to obtain an exchange index of each exchange data event;
and acquiring the total index frequency in the same exchange event, different exchange indexes in all the exchange data events and the index occurrence frequency of the different exchange indexes, and determining a second incidence relation with the exchange platform.
The beneficial effects of the above technical scheme are: by collecting the exchange data event, the indexes, the frequency and the like are conveniently obtained, and then the second incidence relation is obtained, so that a basis is provided for the follow-up comparative analysis, and the high efficiency of the sharing exchange is ensured.
The invention provides a data sharing exchange method, which determines a request period of first equipment, captures a first request result of an active requester and a second request result of a passive requester received by the first equipment in each request period, and comprises the following steps:
determining a request period matched with the device unique symbol of the first device according to a preset device mechanism;
respectively capturing a first sharing request and a first exchanging request which are actively sent to the first equipment by the second equipment in each request period;
respectively capturing a second sharing request and a second exchange request which are actively sent to a third device by a first device in each request period;
the first sharing request, the first exchanging request, the number of the first sharing requests and the number of the first exchanging requests form a first request result;
and the second sharing request, the second exchanging request, the number of the second sharing requests and the number of the second exchanging requests form a second request result.
In this embodiment, the preset device mechanism is related to the device unique symbol and the corresponding request period, and therefore, the request period corresponding to the first device may be directly obtained.
In this embodiment, the second device refers to a device corresponding to an active requester, and the third device refers to a device corresponding to a passive requester.
In this embodiment, the sharing request is related to shared data that needs to be obtained based on the first device, the exchange data that needs to be obtained based on the first device and the exchange data that needs to be obtained based on the second device or the third device when the exchange request is performed, and the types of the different shared data are different, mainly the types of the resources are different, for example, both the network resource 1 and the network resource 2 may be regarded as different types.
The beneficial effects of the above technical scheme are: different request results are effectively obtained by determining the request period of the equipment and acquiring the sharing request and the exchange request of the second equipment and the third equipment, and a basis is provided for subsequent data sharing exchange.
The invention provides a data sharing exchange method, which carries out first request classification on a first request result and second request classification on a second request result according to a request classification rule, and constructs a classification chart, and comprises the following steps:
determining a plurality of active sharing requests of the same type and a plurality of active exchanging requests of the same type according to the first request classification result, and determining a plurality of passive sharing requests of the same type and a plurality of passive exchanging requests of the same type according to the second request classification result;
constructing a first graph according to the request quantity and the type weight of each type of request, wherein the first graph is a pie graph;
acquiring the occurrence condition of requests related to the first equipment at the same time, giving a request label to each request, adjusting the boundaries of the image blocks according to the label set of each image block in the first image to obtain a second image which is regarded as a classification image, wherein the classification image comprises an active sharing block, an active switching block, a passive sharing block and a passive switching block.
In this embodiment, the first request classification result includes sharing requests 01, 02, and 03, the exchange requests are 22, 23, 45, and 44, and the obtained active sharing requests of the same type are: 01 and 02, 03, and the active same type exchange requests are: 22, 23, 45, and 44, and passive related requests are similar to active related requests and are not described in detail herein.
In this embodiment, the tiles in the first graph are related to the type of request, where the area of each tile is:
because the corresponding image blocks have errors in the processes of the actual active request and the actual passive request, the request tags are set by acquiring the occurrence condition of the requests, namely the occurrence weight of each request in the same type of requests at the corresponding moment, and the request tags are related to the corresponding occurrence weights.
Comparing the accumulated sum of all occurrence weights of the requests related to the corresponding image blocks with the standard total weight of the corresponding type requests, if the ratio is within a set range, keeping the size of the corresponding image block unchanged, and if the ratio is smaller than the minimum value of the set range, setting the corresponding image block as an adjustment block to be small;
if the ratio is greater than the maximum value of the set range, the corresponding tile block can be set as the block to be adjusted greatly.
In the subsequent process of adjusting the boundaries of the image blocks, if the small-to-be-adjusted block and the large-to-be-adjusted block do not exist, or only the small-to-be-adjusted block does not exist, or only the large-to-be-adjusted block does not exist, the original first graph is kept unchanged, wherein the active same type shared image blocks are regarded as a whole to be used as an active shared image block, the active same type exchange image blocks are regarded as a whole to be used as an active exchange image block, the passive same type shared image blocks are regarded as a whole to be used as a passive shared image block, and the passive same type exchange image blocks are regarded as a whole to be used as a passive exchange image block.
If the block to be adjusted to be small also exists the block to be adjusted to be large, determining the area to be adjusted according to a first difference between the ratio of the block to be adjusted to be small and the minimum value and a second difference between the ratio of the block to be adjusted to be large and the maximum value;
and realizing the adjustment of the boundary of the image blocks according to the first adjustment area and the second adjustment area.
The adjustment area is determined based on the block to be adjusted to be small and the block to be adjusted to be large, the block to be adjusted to be small is the block with the area reduced, the block to be adjusted to be large is the block with the area increased, and it should be noted that the total area of the block to be adjusted to be small and the block to be adjusted to be large is not changed.
The beneficial effects of the above technical scheme are: the first graph is constructed by obtaining different types of requests and type weights, the boundaries of the graph blocks are adjusted according to the areas by setting the label set, and finally the classification graph is obtained, so that the efficiency of data sharing exchange is further ensured.
The invention provides a data sharing exchange method, which obtains a first exchange value and a first sharing value according to the classification chart and comprises the following steps:
acquiring a first area of an active sharing request and a second area of an active exchange request in the classification chart, and acquiring a third area of a passive sharing request and a fourth area of a passive exchange request in the classification chart;
obtaining a first shared value according to the first area and the third area;
and obtaining a first exchange value according to the second area and the fourth area.
In this embodiment, the first shared value = (first area + third area)/(first area + second area + third area + fourth area);
the first exchange value = (second area + fourth area)/first area + second area + third area + fourth area).
The beneficial effects of the above technical scheme are: by determining the areas of different requests in the classification chart, the shared value and the exchange value are effectively obtained, and a foundation is provided for subsequent shared exchange.
The invention provides a data sharing exchange method, which extracts a third number of exchange requests in the classification chart and comprises the following steps:
determining a remaining idle number according to a first difference between the reference shared value and the first shared value;
determining the number of redundant requests according to a second difference between the first exchange value and the reference exchange value;
and determining the final excess quantity according to the spare space of the residual spare quantity and the space to be occupied of the excess request quantity, and regarding the final excess quantity as a third quantity.
In this embodiment, the reference shared value is a ratio of a standard shared area determined based on the first association relation and the second association relation to a total area, where the total area is a sum of the first area + the second area + the third area + the fourth area.
The shared exchange value is the ratio of the standard exchange area to the total area.
And if the free space is larger than the space to be occupied and the residual free quantity is larger than the quantity of the redundant requests, the final redundant quantity is equal to the quantity of the redundant requests.
And if the free space is larger than the space to be occupied and the residual free number is smaller than the quantity of the redundant request, the final redundant quantity is equal to the residual free number.
The beneficial effects of the above technical scheme are: the number of idle requests and the number of redundant requests can be effectively determined by comparison, and a basis is provided for the third number.
The invention provides a data sharing exchange method, which controls first equipment to carry out data sharing exchange according to a primary execution request and comprises the following steps:
first ordering shared requests in the primary execution request and second ordering the exchange request;
constructing a request execution list according to the first sequencing result and the second sequencing result, wherein each column in the request execution list represents the same execution time;
constructing an execution function Z1 according to the execution columns in the request execution list at the same execution time;
wherein z01 represents the shared request information of the active requester in the corresponding execution column; z02 represents the exchange request information of the active requesting party in the corresponding execution column; z03 represents the shared request information of the passive requesters in the corresponding execution column; z04 represents the exchange request information of the passive requesters in the corresponding execution column; n01 represents the request number of the sharing requests of the active requesters in the corresponding execution column; n02 represents the request number of the exchange requests of the corresponding active requesters in the execution column; n03 represents the request number of the sharing requests of the passive requesters in the corresponding execution column; n04 represents the request number of the exchange requests of the passive requesters in the corresponding execution column; x01 represents the request weight of each sharing request of the active requesting party in the corresponding execution column; x02 denotes the request weight of each exchange request of the active requester in the corresponding execution column; x03 represents the request weight of each sharing request of the passive requesters in the corresponding execution column; x03 represents the request weight of each exchange request of the passive requesters in the corresponding execution column; y1 represents a first request function; y2 represents a second request function; y3 represents a third request function; y4 represents a fourth request function;
acquiring an execution channel matched with the execution function Z1 from an execution database;
if the number of the execution channels is 1, performing data sharing and data exchange between the first equipment and the requester in the execution channels;
if the number of the execution channels is m1, determining a channel execution value of each execution channel;
wherein Yj1 represents a channel execution value corresponding to the j1 st execution channel; m1 represents the number of execution channels present; sim (yi, ui) represents a similarity value of the ith request function and the matching function existing in the jth execution channel;
the standard value of the matching function existing between the ith request function and the jth execution channel is represented; n0i represents the number of requests involved in the ith request function; />
Representing the request weight of the jth request in the ith request function in the jth execution channel;
according to
Screening maximum execution values, and if only one maximum execution value exists, acquiring an optimal channel consistent with the maximum execution value to perform data sharing and data exchange between the first equipment and the requester;
if there are more than one maximum execution value, based on
The maximum individual execution value of the execution channel corresponding to the maximum execution value is obtained, which is in, or is greater than, the maximum individual execution value of the execution channel corresponding to the maximum execution value>
The ith individual execution value in the execution channel corresponding to the maximum execution value is represented;
and screening the optimal execution channel corresponding to the maximum value from all the maximum individual execution values to share and exchange data between the first equipment and the requester.
In this embodiment, the request execution list includes several requests involved in different execution time. And the first ordering and the second ordering are determined according to the execution time.
In this embodiment, the channel is executed to share and exchange data.
In this embodiment, the comparison ranges of the three parameters in different request functions are respectively set in the execution database based on the four request functions, so that the execution channel can be locked according to the range to which each parameter in each request function belongs, and the four functions corresponding to different execution channels and the range to which the parameter in each function belongs are preset, so that the corresponding execution channel can be determined.
The beneficial effects of the above technical scheme are: the method comprises the steps of sequencing requests, constructing an execution list, further obtaining execution channels, and conducting channel execution value calculation and maximum execution value screening on the execution channels, so that channel screening is facilitated, wherein when a plurality of maximum execution values exist, the maximum value in the maximum independent execution values is effectively determined according to a maximum function to determine the execution channels to conduct sharing exchange, and sharing exchange efficiency is guaranteed.
The present invention provides a data sharing and switching system, as shown in fig. 2, including:
the system comprises a relation establishing module, a switching module and a processing module, wherein the relation establishing module is used for establishing a first association relation between first equipment and a shared platform and establishing a second association relation between the first equipment and an exchange platform;
the result determining module is used for determining the request period of the first device and capturing a first request result of the active requester and a second request result of the passive requester, which are received by the first device in each request period;
the classification chart construction module is used for carrying out first request classification on the first request result and carrying out second request classification on the second request result according to the request classification rule and constructing to obtain a classification chart;
the value acquisition module is used for acquiring a first exchange value and a first shared value according to the classification chart, and meanwhile acquiring a reference shared value according to the first incidence relation and acquiring a reference exchange value according to a second incidence relation;
the value comparison analysis module is used for comparing and analyzing the first exchange value, the reference exchange value, the first sharing value and the reference sharing value:
when the first swap value is less than or equal to a reference swap value and the first shared value is less than or equal to a reference shared value, treating the first request and the second request as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first sharing value is greater than the reference sharing value, extracting a first number of sharing requests and a second number of exchanging requests in the classification chart and regarding the sharing requests and the exchanging requests as primary execution requests;
when the first exchange value is larger than the reference exchange value and the first sharing value is smaller than or equal to the reference sharing value, extracting a third number of exchange requests and a total number of sharing requests in the classification map and regarding the exchange requests and the sharing requests as primary execution requests;
when the first exchange value is less than or equal to the reference exchange value and the first shared value is greater than the reference shared value, extracting a fourth number of sharing requests and a total number of exchanging requests in the classification map and regarding the sharing requests and the total number of exchanging requests as primary execution requests;
and the shared switching module is used for controlling the first equipment to perform data shared switching according to the primary execution request.
The beneficial effects of the above technical scheme are: the exchange and sharing comparison analysis is carried out by establishing the association relationship between the equipment and the platform and the classification chart constructed by different request results, so that the effective control of the data sharing exchange of the first equipment is realized, and the most efficient sharing exchange is ensured.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (9)
1. A method for data sharing exchange, comprising:
step 1: establishing a first association relation between first equipment and a shared platform, and simultaneously establishing a second association relation between the first equipment and an exchange platform;
and 2, step: determining a request period of a first device, and capturing a first request result of an active requester and a second request result of a passive requester, which are received by the first device in each request period;
and step 3: according to the request classification rule, performing first request classification on the first request result and performing second request classification on the second request result, and constructing a classification chart;
and 4, step 4: obtaining a first exchange value and a first sharing value according to the classification chart, and simultaneously obtaining a reference sharing value according to the first incidence relation and a reference exchange value according to a second incidence relation;
and 5: comparing the first exchange value with the reference exchange value and the first shared value and the reference shared value:
when the first swap value is less than or equal to a reference swap value and the first shared value is less than or equal to a reference shared value, treating the first request and the second request as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first shared value is greater than the reference shared value, extracting a first number of sharing requests and a second number of exchanging requests in the classification map and regarding the first number of sharing requests and the second number of exchanging requests as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first sharing value is less than or equal to the reference sharing value, extracting a third number of exchange requests and a total number of sharing requests in the classification chart, and regarding the third number of exchange requests and the total number of sharing requests as primary execution requests;
when the first exchange value is less than or equal to the reference exchange value and the first shared value is greater than the reference shared value, extracting a fourth number of sharing requests and a total number of exchanging requests in the classification map and regarding the sharing requests and the total number of exchanging requests as primary execution requests;
and 6: and controlling the first equipment to perform data sharing exchange according to the primary execution request.
2. The data sharing exchange method of claim 1, wherein establishing the first association of the first device with the sharing platform comprises:
acquiring output sharing events of the first equipment to obtain a sharing index of each output sharing event;
acquiring the total index frequency of the shared events, different shared indexes of all output shared events and the index occurrence frequency of the different shared indexes, and determining a first incidence relation with the shared platform.
3. The data sharing exchange method of claim 1, wherein establishing a second association relationship between the first device and the exchange platform comprises:
collecting the exchange data events of the first equipment to obtain an exchange index of each exchange data event;
and acquiring the total index frequency in the same exchange event, different exchange indexes in all exchange data events and the index occurrence frequency of the different exchange indexes, and determining a second association relation with the exchange platform.
4. The data sharing exchange method of claim 1, wherein determining a request period of a first device and capturing a first request result of an active requester and a second request result of a passive requester received by the first device in each request period comprises:
determining a request period matched with the device unique symbol of the first device according to a preset device mechanism;
respectively capturing a first sharing request and a first exchanging request which are actively sent to the first equipment by the second equipment in each request period;
respectively capturing a second sharing request and a second exchange request which are actively sent to a third device by a first device in each request period;
the first sharing request, the first exchanging request, the number of the first sharing requests and the number of the first exchanging requests form a first request result;
and the second sharing request, the second exchanging request, the number of the second sharing requests and the number of the second exchanging requests form a second request result.
5. The data sharing exchange method according to claim 1, wherein performing a first request classification on the first request result and performing a second request classification on the second request result according to a request classification rule, and constructing a classification graph, includes:
determining a plurality of active sharing requests of the same type and a plurality of active exchanging requests of the same type according to the first request classification result, and determining a plurality of passive sharing requests of the same type and a plurality of passive exchanging requests of the same type according to the second request classification result;
constructing a first graph according to the request quantity and the type weight of each type of request, wherein the first graph is a pie graph;
obtaining the occurrence condition of the requests involved by the first device at the same time, giving a request label to each request, adjusting the boundary of the graph blocks according to the label set of each graph block in the first graph to obtain a second graph, and regarding the second graph as a classification graph, wherein the classification graph comprises an active sharing block, an active switching block, a passive sharing block and a passive switching block.
6. The data sharing switching method of claim 1, wherein obtaining the first switching value and the first sharing value according to the classification chart comprises:
acquiring a first area of an active sharing request and a second area of an active exchange request in the classification chart, and simultaneously acquiring a third area of a passive sharing request and a fourth area of a passive exchange request in the classification chart;
obtaining a first shared value according to the first area and the third area;
and obtaining a first exchange value according to the second area and the fourth area.
7. The data sharing switching method of claim 1 wherein extracting a third number of switching requests in the classification map comprises:
determining a remaining idle number according to a first difference between the reference shared value and the first shared value;
determining the number of redundant requests according to a second difference between the first exchange value and the reference exchange value;
and determining the final excess quantity according to the spare space of the residual spare quantity and the space to be occupied of the excess request quantity, and regarding the final excess quantity as a third quantity.
8. The data sharing exchange method of claim 1, wherein controlling the first device to perform the data sharing exchange according to the primary execution request comprises:
first ordering shared requests in the primary execution request and second ordering the exchange request;
constructing a request execution list according to the first sequencing result and the second sequencing result, wherein each column in the request execution list represents the same execution time;
constructing an execution function Z1 according to the execution columns in the request execution list at the same execution time;
wherein z01 represents the shared request information of the active requester in the corresponding execution column; z02 represents the exchange request information of the active requesting party in the corresponding execution column; z03 represents the shared request information of the passive requesters in the corresponding execution column; z04 represents the exchange request information of the passive requesters in the corresponding execution column; n01 represents the request number of the sharing requests of the active requesters in the corresponding execution column; n02 represents the request number of the exchange requests of the corresponding active requesters in the execution column; n03 represents the request number of the sharing requests of the passive requesters in the corresponding execution column; n04 represents the request number of the exchange requests of the passive requesters in the corresponding execution column; x01 represents the request weight of each sharing request of the active requesting party in the corresponding execution column; x02 represents the request weight of each exchange request of the active requesting party in the corresponding execution column; x03 represents the request weight of each shared request of the passive requesters in the corresponding execution column; x04 represents the request weight of each exchange request of the passive requesters in the corresponding execution column; y1 represents a first request function; y2 represents a second request function; y3 represents a third request function; y4 represents a fourth request function;
acquiring an execution channel matched with the execution function Z1 from an execution database;
if the number of the execution channels is 1, performing data sharing and data exchange between the first equipment and the requester in the execution channels;
if the number of the execution channels is m1, determining a channel execution value of each execution channel;
wherein Yj1 represents a channel execution value corresponding to the j1 st execution channel; m1 represents the number of execution channels present; sim (yi, ui) represents a similarity value of the ith request function and the matching function existing in the jth execution channel;
the standard value of the matching function existing between the ith request function and the jth execution channel is represented; n0i represents the number of requests involved by the ith request function; />
Representing the request weight of the jth request in the ith request function in the jth execution channel;
according to
Screening maximum execution values, and if only one maximum execution value exists, acquiring an optimal channel consistent with the maximum execution value to perform data sharing and data exchange between the first equipment and the requester;
if there are multiple maximum execution values, the method is based on
Obtaining the maximum individual execution value of the execution channel corresponding to the maximum execution value, and in which, a device in conjunction with the maximum individual execution value is present>
The ith individual execution value in the execution channel corresponding to the maximum execution value is represented;
and screening the optimal execution channel corresponding to the maximum value from all the maximum individual execution values to share and exchange data between the first equipment and the requester.
9. A data sharing switching system, comprising:
the system comprises a relation establishing module, a sharing module and a switching module, wherein the relation establishing module is used for establishing a first incidence relation between first equipment and a sharing platform and establishing a second incidence relation between the first equipment and a switching platform;
the result determining module is used for determining the request period of the first device and capturing a first request result of the active requester and a second request result of the passive requester, which are received by the first device in each request period;
the classification chart construction module is used for carrying out first request classification on the first request result and carrying out second request classification on the second request result according to the request classification rule and constructing to obtain a classification chart;
the value acquisition module is used for acquiring a first exchange value and a first shared value according to the classification chart, and meanwhile acquiring a reference shared value according to the first incidence relation and acquiring a reference exchange value according to a second incidence relation;
the value comparison analysis module is used for comparing and analyzing the first exchange value, the reference exchange value, the first sharing value and the reference sharing value:
when the first swap value is less than or equal to a reference swap value and the first shared value is less than or equal to a reference shared value, treating the first request and the second request as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first sharing value is greater than the reference sharing value, extracting a first number of sharing requests and a second number of exchanging requests in the classification chart and regarding the sharing requests and the exchanging requests as primary execution requests;
when the first exchange value is greater than the reference exchange value and the first sharing value is less than or equal to the reference sharing value, extracting a third number of exchange requests and a total number of sharing requests in the classification chart, and regarding the third number of exchange requests and the total number of sharing requests as primary execution requests;
when the first exchange value is less than or equal to the reference exchange value and the first shared value is greater than the reference shared value, extracting a fourth number of sharing requests and a total number of exchanging requests in the classification map and regarding the sharing requests and the total number of exchanging requests as primary execution requests;
and the shared switching module is used for controlling the first equipment to carry out data shared switching according to the primary execution request.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310139616.6A CN115834715B (en) | 2023-02-21 | 2023-02-21 | Data sharing exchange method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310139616.6A CN115834715B (en) | 2023-02-21 | 2023-02-21 | Data sharing exchange method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115834715A CN115834715A (en) | 2023-03-21 |
| CN115834715B true CN115834715B (en) | 2023-04-14 |
Family
ID=85521963
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310139616.6A Active CN115834715B (en) | 2023-02-21 | 2023-02-21 | Data sharing exchange method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115834715B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020221158A1 (en) * | 2019-04-30 | 2020-11-05 | 上海连尚网络科技有限公司 | Method and device for sharing information in social application |
| CN111914026A (en) * | 2020-07-31 | 2020-11-10 | 南京朗赢信息技术有限公司 | General data exchange sharing service platform |
| CN115794839A (en) * | 2023-02-08 | 2023-03-14 | 南昌维网数字传媒有限公司 | Data collection method based on Php + Mysql system, computer equipment and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6885874B2 (en) * | 2001-11-27 | 2005-04-26 | Motorola, Inc. | Group location and route sharing system for communication units in a trunked communication system |
| US20220414667A1 (en) * | 2016-09-23 | 2022-12-29 | Raise Marketplace, Llc | Dynamically sharing an exchange item |
| US10285026B2 (en) * | 2017-08-08 | 2019-05-07 | T-Mobile Usa, Inc. | Service sharing between devices |
-
2023
- 2023-02-21 CN CN202310139616.6A patent/CN115834715B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020221158A1 (en) * | 2019-04-30 | 2020-11-05 | 上海连尚网络科技有限公司 | Method and device for sharing information in social application |
| CN111914026A (en) * | 2020-07-31 | 2020-11-10 | 南京朗赢信息技术有限公司 | General data exchange sharing service platform |
| CN115794839A (en) * | 2023-02-08 | 2023-03-14 | 南昌维网数字传媒有限公司 | Data collection method based on Php + Mysql system, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115834715A (en) | 2023-03-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110610242B (en) | Method and device for setting weights of participants in federal learning | |
| EP3644581B1 (en) | Edge-cloud collaboration system for analyzing internet of things data and operating method thereof | |
| WO2022134424A1 (en) | Service flow processing method and apparatus, and computer device and storage medium | |
| CN113347267A (en) | MEC server deployment method in mobile edge cloud computing network | |
| Zhou et al. | Task scheduling for mobile edge computing enabled crowd sensing applications | |
| CN112039861B (en) | Risk identification method and device, electronic equipment and computer readable storage medium | |
| CN115834715B (en) | Data sharing exchange method and system | |
| CN112416558B (en) | Business data processing method, device and storage medium based on blockchain | |
| CN113269339B (en) | Method and system for automatically creating and distributing network appointment tasks | |
| CN117472549B (en) | A distributed computing power scheduling system based on AIGC | |
| Wang et al. | Application of improved Naive Bayes classification algorithm in 5G signaling analysis | |
| CN113891466A (en) | Online scheduling system and method for UDL task in edge wireless network | |
| CN107889115A (en) | Opportunistic spectrum access method based on mahalanobis distance map | |
| CN114969756B (en) | A trusted participant selection method based on historical data interpolation verification | |
| CN117614850A (en) | Method, device, equipment and medium for predicting network traffic | |
| CN111723169B (en) | Map display method and device, electronic equipment and storage medium | |
| CN110505635A (en) | Terminal permeability prediction method and device | |
| Liu et al. | Online task dispatching and pricing for quality-of-service-aware sensing data collection for mobile edge clouds | |
| Barros et al. | Mesfla: Model efficiency through selective federated learning algorithm | |
| He et al. | Social welfare maximization for collaborative edge computing: A deep reinforcement learning-based approach | |
| CN119293045B (en) | Database access method and device based on data storage system | |
| CN118521946B (en) | Visual networking task understanding and scheduling method and system based on continuous learning | |
| CN114726731A (en) | Bandwidth cost determination method, electronic device and storage medium | |
| CN119728556A (en) | Antenna downtilt angle optimization method and system based on traffic prediction and reinforcement learning | |
| CN115018385A (en) | Production data processing method and related device |
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 |