This master’s thesis is dealing with problems of XML data compression. It describes a characterization and important concepts of XML language as well as AIXM as XML data format. It documents contemporary compression methods of XML and divides them into appropriate groups. Thereinafter a testing of XML data compression using mentioned methods and evaluation of results is implemented. With a consideration of processed data there is created and presented an application which enables lossy and lossless compression of AIXM with the help of particular elements data analysis. All of it with user selection options of AIXM objects and way of resultant compression.

The master's thesis deals with encoding payment data invoices into QR codes in accordance with the by square standard. The SAP system along with a process of encoding data into QR codes and by square PAY standard is introduced in my thesis. In compliance with the standard function module is designed for the SAP system which is in the ABAB language, using Smartforms form allowing the QR codes to generate the invoice. The module is then subjected to testing. The results are evaluated in conclusion of the master's thesis and a description of potential further development is assessed as a final step.

In this thesis we investigated whether using compression when sending inter-process communication (IPC) messages can be beneficial or not. A literature study on lossless compression resulted in a compilation of algorithms and techniques. Using this compilation, the algorithms LZO, LZFX, LZW, LZMA, bzip2 and LZ4 were selected to be integrated into LINX as an extra layer to support lossless message compression. The testing involved sending messages with real telecom data between two nodes on a dedicated network, with different network configurations and message sizes. To calculate the effective throughput for each algorithm, the round-trip time was measured. We concluded that the fastest algorithms, i.e. LZ4, LZO and LZFX, were most efficient in our tests. / I detta examensarbete har vi undersökt huruvida komprimering av meddelanden för interprocesskommunikation (IPC) kan vara fördelaktigt. En litteraturstudie om förlustfri komprimering resulterade i en sammanställning av algoritmer och tekniker. Från den här sammanställningen utsågs algoritmerna LZO, LZFX, LZW, LZMA, bzip2 och LZ4 för integrering i LINX som ett extra lager för att stödja komprimering av meddelanden. Algoritmerna testades genom att skicka meddelanden innehållande riktig telekom-data mellan två noder på ett dedikerat nätverk. Detta gjordes med olika nätverksinställningar samt storlekar på meddelandena. Den effektiva nätverksgenomströmningen räknades ut för varje algoritm genom att mäta omloppstiden. Resultatet visade att de snabbaste algoritmerna, alltså LZ4, LZO och LZFX, var effektivast i våra tester.