Research on interactive data packet storage algorithm for Hadoop cloud computing platform
by Yu-feng Ou; Yan-Xi Li; Wei-Guo Liu
International Journal of Information and Communication Technology (IJICT), Vol. 21, No. 3, 2022

Abstract: The accuracy of traditional interactive data packet storage algorithms for data packet storage is not high, the storage time is very large, and the integrity of the data cannot be guaranteed. Therefore, a new type of interactive data packet storage algorithm is proposed. First, Bayes' theorem is used to calculate the frequency of grouping categories, so as to construct the interactive data classification model of the Hadoop cloud computing platform. By using the relationship between Smart-DIRPE codes and rules, the integrity of data packet storage is effectively ensured, and the domain conversion method is used to realise the range matching design of interactive data packets. Based on this, the design of the interactive data packet storage algorithm is completed. Experimental results show that the algorithm has higher grouping accuracy, better data integrity and shorter time consumption. When the data size is 90 MB, the time consumption is 2.3 s.

Online publication date: Wed, 14-Sep-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com