dc.contributor.author | OBJELEAN, Alexandru | |
dc.date.accessioned | 2019-11-08T10:35:57Z | |
dc.date.available | 2019-11-08T10:35:57Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | OBJELEAN, Alexandru. JSON Compression Algorithms. In: Microelectronics and Computer Science: proc. of the 7th intern. Conf., September 22-24, 2011. Chişinău, 2011, vol. 1, pp. 244-247. ISBN 978-9975-45-174-1. | en_US |
dc.identifier.isbn | 978-9975-45-174-1 | |
dc.identifier.uri | http://repository.utm.md/handle/5014/6418 | |
dc.description.abstract | JSON (Java Script Object Notation) [1] is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It can be used as a data interchange format, just like XML. When comparing JSON [1] to XML, it has several advantages over the last one. JSON [1] is really simple, it has a self-documenting format, it is much shorter because there is no data configuration overhead. That is why JSON is considered a fat-free alternative to XML. However, the purpose of this article is not to discuss the pros and cons of JSON [1] over XML. Though it is one of the most used data interchanged format, there is still room for improvement. For instance, JSON [1] uses excessively quotes and key names are very often repeated. This problem can be solved by JSON [1] compression algorithms. There are more than one available. Here you'll find an analysis of two JSON [1] compressors algorithms and a conclusion whether JSON [1] compression is useful and when it should be used. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Technical University of Moldova | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | Java Script Object Notation | en_US |
dc.title | JSON Compression Algorithms | en_US |
dc.type | Article | en_US |
The following license files are associated with this item: