Data sorting processing method and device, computer device, medium and program product

CN115544559BActive Publication Date: 2026-07-03SHENZHEN QIANHAI HUANRONG LIANYI INFORMATION TECHNOLOGY SERVICES CO LTD
View PDF 1 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
SHENZHEN QIANHAI HUANRONG LIANYI INFORMATION TECHNOLOGY SERVICES CO LTD
Filing Date
2022-09-23
Publication Date
2026-07-03

AI Technical Summary

Technical Problem

Existing multi-party sorting algorithms suffer from long sorting execution times due to the large number of communication connections required when protecting privacy, thus reducing sorting efficiency.

Method used

By using a secret sharing method, the data to be sorted by each participant is split into data shards and shared among them. The data shard groups are then grouped and iteratively sorted by multiple parties to reduce redundant sorting operations.

Benefits of technology

It improves the execution efficiency of multi-party secure sorting algorithms, enabling rapid output of sorting results while reducing communication volume and computational costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115544559B_ABST
    Figure CN115544559B_ABST
Patent Text Reader

Abstract

The application relates to the technical field of multi-party security sorting, and discloses a data sorting processing method and device, computer equipment, a medium and a program product, to solve the technical problem of low sorting efficiency. The method part comprises the following steps: grouping data shards obtained by each participant to obtain data shard groups of each participant, wherein each data shard group of each participant comprises at least two data shards, and the grouping mode of each participant is corresponding; based on the data shard groups of each participant, performing multi-party iterative sorting on to-be-sorted data corresponding to each data shard group to obtain first target sorting data corresponding to each data shard group; according to a first screening requirement, screening second target sorting data corresponding to each data shard group from the first target sorting data corresponding to each data shard group; and performing multi-party iterative sorting on the second target sorting data corresponding to each data shard group to obtain a target sorting result.
Need to check novelty before this filing date? Find Prior Art