Compression of information objects using combinatorial generation methods based on AND/OR trees

DOI: 10.21293/1818-0442-2024-27-4-74-79

Download article in PDF format

JATS xml

Abstract: This article discusses the problem of lossless data compression using combinatorial generation methods based on AND/OR trees. It presents a scheme for encoding information objects that are complex discrete structures with bijective mapping onto AND/OR trees. In addition, the features of the encoding pro-cess implementation are demonstrated using the following structures as an example: texts, information system event logs, relational databases, and raster images.

Keywords: combinatorial generation, AND/OR tree, encoding, lossless data compression, bijection

Funding: The work was carried out with financial support from the Russian Science Foundation as part of scientific project No. 22-71-10052.

For citation:
Shablya Yu. V. Compression of information objects using combinatorial generation methods based on AND/OR trees. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2024, vol. 27, no. 4, pp. 74–79. DOI: 10.21293/1818-0442-2024-27-4-74-79

Authors and copyright holders:

  • Shablya Yu. V. , Tomsk State University of Control Systems and Radioelectronics (Tomsk, Russia)

  • 1. Markov A.A. Vvedeniye v teoriyu kodirovaniya [Introduction to coding theory]. Moscow, Nauka Publishers, 1982, 192 p. (in Russ.).
  • 2. Vatolin D., Ratushnyak A., Smirnov M., Yoockin V. Metody szhatiya dannykh. Ustroystvo arkhivatorov, szhatiye izobrazheniy i video [Data compression methods. Organization of archivers, image and video compression]. Moscow, Dialog-MIFI, 2003. 384 p. (in Russ.).
  • 3. Salomon D., Motta G. Handbook of Data Compression. USA, Springer, 2010, 1360 p.
  • 4. Bellard F. Lossless Data Compression with Neural Networks. 2019. 11 p. Available at: https://bellard.org/nncp/nncp.pdf, free (Accessed: December 01, 2024).
  • 5. Kreher D.L., Stinson D.R. Combinatorial Algorithms: Generation, Enumeration, and Search. USA, CRC Press, 1999, 342 p.
  • 6. Ruskey F. Combinatorial Generation. 2003. 311 p. Available at: https://page.math.tu-berlin.de/~felsner/SemWS17-18/Ruskey-Comb-Gen.pdf, free (Accessed: December 01, 2024).
  • 7. Goldberg A.V., Sipser M. Compression and ranking. SIAM Journal on Computing, 1991, vol. 20, no. 3, pp. 524–536.
  • 8. Grishin M.L. Metody postroyeniya informatsionno-izmeritelnykh sistem globalnogo geomonitoringa podvizhnykh obyektov v realnom vremeni. Diss. kand. nauk [Methods of constructing information-measuring systems for global geomonitoring of moving objects in real time. Dissertation for the Candidate of Science degree]. Tula, 2012, 168 p. (in Russ.).
  • 9. Naganuma H., Hendrian D., Yoshinaka R., Shinohara A., Kobayashi N. Grammar compression with probabilistic context-free grammar. 2020 Data Compression Conference. IEEE, 2020.
  • 10. Kruchinin V.V., Lukschin B.A. [Method of coding of information objects on the basis of trees and or]. Proceedings of TUSUR University, 2010, no. 1(21), pp. 170–172 (in Russ.).
  • 11. Kruchinin V.V. Metody postroyeniya algoritmov generatsii i numeratsii kombinatornykh obyektov na osnove derevyev I/ILI [Methods for constructing algorithms for generating and numbering combinatorial objects based on AND/OR trees]. Tomsk, V-Spektr, 2007, 200 p. (in Russ.).
  • 12. Shablya Y., Kruchinin D., Kruchinin V. Method for developing combinatorial generation algorithms based on AND/OR trees and its application. Mathematics, 2020, vol. 8, no. 6, Article 962.
  • 13. Tokareva A.V., Kruchinin D.V. [Modification of the method for identifying and tracing complex technical products using combinatorial generation algorithms based on AND/OR trees]. The Herald of the Siberian State University of Telecommunications and Information Science, 2024, vol. 18, no. 3, pp. 73–85 (in Russ.).
  • 14. Shablya Y.V., Tokareva A.V. [Methods for storing AND/OR tree structures and their variants in RAM and ROM]. Proceedings of TUSUR University, 2024, vol. 27, no. 2, pp. 44–50 (in Russ.).
  • 15. Shablya Y.V. [A method for compressing event log data based on combinatorial generation using AND/OR tree structures]. Modern Information Technologies and IT-education, 2023, vol. 19, no. 3, pp. 564–574 (in Russ.).
  • 16. Kruchinin V.V., Shelupanov A.A. [Approaches to designing protected archives based on secret division]. Proceedings of TUSUR University, 2008, no. 2, pp. 67–72 (In Russ.).
  • 17. Evsutin O.O., Milikhin M.M. [Compression of digital images, used in geo-information system of electronic general plan in an industrial enterprise]. Proceedings of TUSUR University, 2012, no. 2, pp. 224–229 (in Russ.).
  • 18. Kulbaev S.S., Nemerov A.A., Krupsky A.S. [Efficiency evaluation of the service of digital image compressing on high-performance computing system]. Proceedings of TUSUR University, 2013, no. 4, pp. 142–146 (in Russ.).
Editorial office address

Executive Secretary of the Editor’s Office

 Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia

  Phone / Fax: + 7 (3822) 701-582

  journal@tusur.ru

 

Viktor N. Maslennikov

Executive Secretary of the Editor’s Office

 Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia

  Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02

Subscription for updates