Full Text

Abstract

In this paper explores on compression of Aadhaar number storage through the concepts of reduced bit level ordering. The Aadhaar number is an unique number used in various government schemes. It is a twelve digit number. The population of our country is more than 135 crores. It means more than 135 crores of Aadhaar numbers will be available. The uniqueness of beneficiary is ensured by avoiding duplicate beneficiary. The uniqueness needs Aadhaar number comparison with minimal amount of time. Hence there is a need for reducing the Aadhaar storage for minimizing the search time. The numbers are represented by using various number representations with their needed storage. The compression of Aadhaar storage implemented by using the concept of bit level ordering which takes sorted integer as an input. The expected saved space shown in graphs and tables. The input from various bit level taken and output obtained as index bit and content bit. The obtained saved space depicted through table and graphs.

References

1. M. K.Kakhani, S. Kakhani and S. R.Biradar, Research issues in big data analytics, International Journal of Application or Innovation in Engineering & Management, 2(8),pp.228-232, 2015.

2. Available online at: http://en.wikipedia.org/wiki/Data_compression

3. United Nations, Department of Economic and Social Affairs, Population Division (2019). World Population Prospects Highlights. ST/ESA/SER.A/423.2019.

4. Available online at: https://uidai.gov.in/

5. Available online at: https://www.npci.org.in/product-overview/aeps-product-overview

6. C. E. Shannon: A Mathematical Theory of Communication, The Bell System Technical Journal(27): 379-423, 623-656, July, October, 1948.

7. Justin Zobel and Alistair Moffat. 2006. Inverted files for text search engines. ACM Comput. Surv. 38, 2, Article 6, 2006.

8. S.R.Khonde and V. Ulagamuthalvi, "Fusion of Feature Selection and Random Forest for an Anomaly-Based Intrusion Detection System", Journal of Computational and Theoretical Nanoscience, vol. 16, pp. 1-5, 2019.

9. S.R.Khonde and V. Ulagamuthalvi, "Hybrid Architecture for Intrusion Detection System", Ingenierie des Systemes d\"Information, vol. 24, no. 1, pp. 19-28, 2019.

10. Sebastiano Vigna, "Quasi-succinct indices", In Proceedings of the sixth ACM international conference on Web search and data mining (WSDM ‘13). ACM, New York, NY, USA, 83-92,2013.

11. P. Elias, "On binary representation of monotone sequences", Proceedings of the 6-th Princeton Conference on Information Sciences and Systems: 54-47, Princeton University, 1972.

12. P. Elias, "Efficient storage and retrieval by content and address of static files", J. ACM 21(2): 246-260, 1974.

13. R. M. Fano, "On the number of bits required to implement an associative memory", Memorandum 61, Computer Structures Group, Project MAC, Massachusetts Institute of Technology, 1971.

14. S. Büttcher and C. L. A. Clarke. Index compression is good, especially for random access. In M. J. Silva, A. H. F.

15. S. Buttcher, C. L. A. Clarke, and G. V. Cormack. ¨ Information retrieval. "Implementing and evaluating search engines", MIT Press, Cambridge, Mass., 2010.

16. C. D. Manning, P. Raghavan, and H. Schulze, "Introduction to Information Retrieval", Cambridge University Press, 2008.

17. J. Zobel and A. Moffat, "Inverted files for text search engines", ACM Comput. Surv., 38(2), 2006.

18. D. Lemire and L. Boytsov, "Decoding billions of integers per second through vectorization", Software: Practice & Experience, 2013.

19. A. Moffat and L. Stuiver, "Binary interpolative coding for effective index compression",. Inf. Retr., 3(1), 2000.

20. D. Salomon,"Variable-length Codes for Data Compression", Springer, 2007.

21. A. A. Stepanov, A. R. Gangolli, D. E. Rose, R. J. Ernst, and P. S. Oberoi. "Simd-based decoding of posting lists", In CIKM, pages 317-326, 2011.

22. H. Yan, S. Ding, and T. Suel, "Inverted index compression and query processing with optimized document ordering", In WWW, pages 401-410, 2009.

23. Ezhilarasu P, Mahapatra RP, Senthil R, "Analysis and Interpretation of Elias-Fano coding for Sorted Integers", LAP LAMBERT Academic Publishing, 2019.

Keywords

Big data, Compression, Aadhaar, Bit level ordering, Space reduction.