A Structured Data Representation Method Based on Byte Stream

Abstract

The invention discloses a structuralized data representation method based on a byte stream. The method comprises the following steps that 1, the structuralized data representation range is appointed; 2, a universal representation mode for single structuralized data is established, unified modeling is conduced on the single structuralized data, and the field name and the field content representation mode of the single structuralized data are stipulated; 3, formalized specification is conducted on additive attributes of the single structuralized data; 4, a data type specification for the content of the single structuralized data is established, all data types of the single structuralized data are enumerated and limited, and a representation specification for complex data types is established; 5, a unified structuralized data representation specification based on the byte stream is established; 6, the unified structuralized data representation specification based on the byte stream is simplified and appointed; 7, the receiving and sending process of a structuralized data package based on the byte stream on a network is stipulated.

Description

technical field [0001] The invention belongs to the technical field of computer software, and in particular relates to a structured data representation method based on byte stream. Background technique [0002] In today's Internet applications, XML (Extensible Markup Language) and JSON (JavaScript Object Notation) are usually used to represent structured data. [0003] XML is widely used in data exchange, integration and management due to its rich extensibility and easy-to-understand grammatical structure. However, while improving flexibility, XML's document-centric structure also brings some shortcomings : [0004] First, the paired tag structure of XML results in redundancy of content, causing unnecessary bandwidth occupation when XML is transmitted in the communication channel; [0005] Second, the general process of XML parsing by mainstream XML parsers is to first establish an XML document tree, and then search for the corresponding leaf nodes of the document tree acc...

AI Technical Summary

Problems solved by technology

[0004] First, the paired tag structure of XML results in redundancy of content, causing unnecessary bandwidth occupation when XML is transmitted in the communication channel;

[0005] Second, the general process of XML parsing by mainstream XML parsers is to first establish an XML document tree, and then search for the corresponding leaf nodes of the document tree according to the tag name, so as to obtain the data content. This process is essentially an analysis of the "tree" data structure "Addition, deletion, modification and query" involves a large number of operations on scattered memory blocks. Compared with the "streaming" data structure, the processing efficiency is low, especially when the XML document is large in size.

[0006] JSON describes structured data in the form of "key-value" pairs, and describes data affiliation through paired curly braces, which solves the problem of XML content redundancy. However, compared with XML, the "key-value" pair The data representation method results in poor scalability, and it is difficult to represent structured data with tight and complex logical relationships

[0007] In the existing large-scale distributed software systems, the problem of structured data transmission between hosts is often involved. The traditional transmission of structured data generally adopts the method based on database triggers. When the amount of data transmission becomes large, it is easy to use The database becomes the bottleneck of the system, and on the other hand, it is not conducive to the flexible expansion of the specific data structure of structured data

Images