Data expansion and computation
time complexity comparison with Paillier cryptosystem are analyzed in Section 5.
As a solution, they use an algorithm with similar
time complexity as the one we propose in the next section, 0(logaN).
(2) It uses bucket sort to speed up the BWT encoding and decoding with
time complexity O(N), so that the BWT block size can rise to 2 GB or more to fit the big data compression.
The proposed system has different advantages like complexity is less for a large amount of data, less
time complexity and has high accuracy rate of classification.
Finding an efficient flight path at the cost of
time complexity of this algorithm is always the most concerned issue of researchers.
However, the
time complexity will be increased exponentially with the increase of the thresholds, which limits its application in real time and cannot be tolerated.