EP3227792A1 - Procédé de conversion d'un flux de données binaires - Google Patents

Procédé de conversion d'un flux de données binaires

Info

Publication number
EP3227792A1
EP3227792A1 EP15703246.7A EP15703246A EP3227792A1 EP 3227792 A1 EP3227792 A1 EP 3227792A1 EP 15703246 A EP15703246 A EP 15703246A EP 3227792 A1 EP3227792 A1 EP 3227792A1
Authority
EP
European Patent Office
Prior art keywords
grammar
grammars
binary data
combined
data stream
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP15703246.7A
Other languages
German (de)
English (en)
Inventor
Johannes Hund
Daniel Peintner
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Original Assignee
Siemens AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG filed Critical Siemens AG
Publication of EP3227792A1 publication Critical patent/EP3227792A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/10—Text processing
    • G06F40/12—Use of codes for handling textual entities
    • G06F40/149—Adaptation of the text data for streaming purposes, e.g. Efficient XML Interchange [EXI] format
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/10—Text processing
    • G06F40/12—Use of codes for handling textual entities
    • G06F40/14—Tree-structured documents
    • G06F40/143—Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/10—Text processing
    • G06F40/12—Use of codes for handling textual entities
    • G06F40/14—Tree-structured documents
    • G06F40/146—Coding or compression of tree-structured data

Definitions

  • the invention relates to a method for converting a binary data stream, preferably an EXI data stream.
  • a known descrip ⁇ description language is "Extensible Markup Language", abbreviated XML, are with which hierarchically structured data in text form or "Piain text" described.
  • the description language XML is used for a platform-independent exchange of data between computer systems. Due to the textual nature of XML, it is readable both by machines and by people. Furthermore, schemes are known which are used to describe a structure and to define data types.
  • a schema for using XML data is also known as XML Schema Definition or XSD.
  • EXI "Efficient XML Interchange" abbreviated, EXI, called Bi ⁇ närreraceation XML to be processed faster than text-based XML data and requires less transmission bandwidth for data transfer between Rechnersyste- men.
  • EXI "Efficient XML Interchange” abbreviated, EXI, called Bi ⁇ närrecateation XML to be processed faster than text-based XML data and requires less transmission bandwidth for data transfer between Rechnersyste- men.
  • an application of EXI is not limited to a binary representation of XML alone, EXI can be used as an exchange format for the transmission of arbitrary semi-structured data.
  • the exchange format EXI develops particular advantages when used in XML-based applications with the use of a microcontroller with limited space and Re ⁇ chen arrangespetit.
  • microcontact scooters work such as intelligent sensors in ei ⁇ ner production line or in a vehicle, are redesignerwei ⁇ se for an on-device editing data furnished in a binary format and share this data via corresponding communication interfaces also usually on
  • Coding schemes into grammars is time consuming and labor intensive. Another problem arises from the fact that current methods for implementing and / or transmitting a binary EXI data stream often provide for the use of multiple schemes. In such cases, a combination of multiple schemas or schema files is required to encode a grammar. In many current applications, the process is unnecessarily if multiple EXI streams require the same or similar combinations of schemes.
  • the present invention is faced with the task of creating With ⁇ tel through which a provision of one or more combinations of schemes corresponding grammars is connected with less time and memory requirements.
  • the inventive method provides an initializing phase before ⁇ in a method for converting a binary data stream between a transmitter and a receiver, in the read out a plurality of pre-generated grammar from a memory area, and these are assembled into one combined grammar.
  • a conversion of binary data and / or text format data into a binary data stream takes place or a conversion of a binary data stream into binary data and / or text format data.
  • the first alternative relates preferably to an encoder, the second alterna tive ⁇ preferably to a decoder.
  • a delivery of text format data to the runtime environment or extraction of text format data from the runtime environment preferably takes place in the form of description language schemas, for example XML schema files, or data structures which are equivalent to XML.
  • a delivery of binary data to the runtime environment or removal of binary data from the runtime environment preferably takes place in the form of memory representations, for example using a format also known as a Document Object Model (DOM).
  • DOM Document Object Model
  • a memory representation is a directly replaceable and processable representation of the data described by a description language scheme and transferable through a binary data stream.
  • An encoder created from this memory representation a serializing th binary data stream, usually for the purpose of Studentstra ⁇ supply.
  • a decoder converts a serialized binary data stream into a memory representation. The memory representation is then used for on-device machining ⁇ processing of binary data.
  • runtime is to be understood as the actual implementation of the binary data stream, which is implemented, for example, by an encoder or EXI encoder or by a decoder or EXI decoder.
  • the coding device and the decoding device are alternatively combined in a single device, which is generally referred to as the runtime environment.
  • the invention is intended to persistently store »atomic « grammars generated from one or more schemas. If needed, the required grammars can be loaded individually and processed in combination, just as if they had already been combined.
  • the method according to the invention makes it possible to convert individual schemas or combinations of individual schemas into the corresponding grammar representation in advance or in the event of changes. From any combination of these atomic grammars, the combined grammar needed in the application is generated in a runtime environment as needed. On the one hand, this measure allows a significantly accelerated generation of the desired grammar, on the other hand, the storage space requirement can be kept small, since the provision of a combinatorial variety of grammars is eliminated.
  • Compu ⁇ terprogramm is processed in an encoder and / or decoder that uses the method executes with the execution.
  • the object is further by an encoder with the features of claim 11 and by a
  • FIGURE shows a schematic representation ofroissein ⁇ units of a coding, in which a conversion of the encoder supplied text format data of a writing language is done in a binary data stream.
  • Runtime Rewind ⁇ RTE which input data in Da- tei- or text form are supplied.
  • input data in the form of an XML document FLE is supplied to the runtime environment RTE.
  • a binary data stream DST is generated in the runtime environment RTE, which is transmitted via an interface IFC coding device to a receiver (not shown).
  • a plurality of advance of at least one description ⁇ schematic said generated atomic grammars GR1, GR2 are in an initialization of a a - read memory area and assembled into one combined grammar CGR - not represent ⁇ provided.
  • the combined Gram ⁇ matics CGR is supplied via a non-standard interface, for example EXI grammar interface, the runtime environment RTE.
  • the required grammars GR1, GR2 are loaded individually and processed as a combined grammar CGR on the composition, just as if already combined located in front ⁇ a grammar.
  • the input data FLE fed to the runtime environment RTE are processed into the binary data stream DST by means of structural coding STC and content coding CTC.
  • a grammar in a manner known to those skilled in the art, is an encoding and decoding instruction for an XML document, a data structure equivalent to XML, or a memory representation of an XML document, for example, a Document Object Model, DOM of an encoder.
  • a decoder uses the grammar as an instruction to convert an incoming data stream into an XML document, one to XML equivalent Data structure or memory representation of an XML document.
  • the functional units shown in FIG. 1 can be present both in a coding device on the side of a transmitter and in a decoding device on the side of a receiver.
  • the binary data stream DST On the receiver side, the binary data stream DST then forms the input data, which are fed via the interface IFC to the structure coding units STC and content coding CTC for generating the structure and the content.
  • the XML document, the in-memory representation or the equivalent to XML data structure then represent the ⁇ réelleda th of the recipient. According to one embodiment of the invention for the
  • Gk grammar (basket xsd)
  • Gka grammar (basket xsd + apple.xsd)
  • Gkb grammar (basket xsd + pear.xsd)
  • Gkc grammar (basket xsd + citrus. Xsd)
  • Gkab grammar (basket xsd + apple.xsd + pear.xsd)
  • Gkac grammar (basket xsd + apple.xsd + citrus. Xsd)
  • Gkbc grammar (basket xsd + pear.xsd + citrus. Xsd)
  • Gkabc grammar (basket xsd + apfel.xsd + pear.xsd + cit- rus.xsd)
  • G'k atomic grammar (basket xsd)
  • G'a atomic grammar (apple. Xsd)
  • G'b atomic grammar (pear. Xsd)
  • G'c atomic grammar (citrus. Xsd)
  • This atomic grammars allow in a runtime environment a substantial more efficient combination to a COM ⁇ bined grammar, as a previously known generating a grammar from a combination of schemes, so that composition into a combined grammar from a plurality of atomic grammars in the runtime environment allows much faster becomes.
  • G'd atomic_grammar (date .xsd)
  • G'k atomic_grammar (basket. Xsd) If the application now requires the grammar Gkbc, which should either be present in the cache or be generated by conventional methods, then it can be combined from the atomic grammars according to the inventive means, for example with a call combine defined as a combined grammar:
  • Gkbc combine (G'k + G'b + G'c)
  • the combined grammar at runtime is identical to the conventionally generated grammar, i. the grammar created with a call grammar defined from the combination of the schemes basket, pear, citrus and held:
  • Gkbc grammar (basket xsd + pear.xsd + citrus. Xsd)
  • the runtime environment in accordance with the provisions of the EXI standards, the resulting com ⁇ bined grammar of a grammar that would have occurred even with a combination of different schemes according to XML schema definition or XSD equivalent.
  • the requirement for combinability of atomic grammars to be demanded according to a general embodiment is that global elements of respective atomic, i. Prefabricated grammars are fed into a combined list of global elements of the combined grammar.
  • a qualified name is a globally unique identifier that consists of element names and a name space identifier.
  • a qualified name or QName can be composed of so-called NCNames (Non-Colonized Names), with each of the NCNames except for the last one namespace or namespace designated. The last NCName corresponds to the local name within the namespace.
  • NCNames Non-Colonized Names
  • the individual NCNames be composed of ⁇ means of dot (.) To a QName.
  • combinability is supported by global elements of the combined list of global elements of the combined grammar
  • Indirect refer to global elements of respective pre-generated grammars. This means for example that a combined list of global elements with the length (length + length Gl G2) is guided, which indirectly references the best ⁇ rising lists. Thus, a list of references to the respective atomic grammars is created. This list can be built in the initialization phase when combining different atomic grammars.
  • the compatibility is supported in that pre-generated fragmentary grammars are fed in a combined list of global elements of the combined gramma ⁇ tik per ⁇ irrir in the initialization phase elements, wherein upon a match of a qualified name or "QName" in different elements the matching qualified name is applied exactly once in the ⁇ combinatorial-defined list of global elements, name conflicts are resolved according to a schema-informed gramma ⁇ tik.
  • This embodiment relates to elements of a "Fragment Content Grammar" according to the EXI standard. The procedure for this is analogous to the global elements explained above. An exception to this is only definitions with identical names, which are composed of element name and a name space identifier.
  • combinability is supported by feeding in the initialization phase type-attributes of respective pre-generated grammars into a combined list of type-attributes built up, if necessary, from a combination of previously generated and type-attribute-containing grammars.
  • a type attribute "xsi: type cast” occurs, an EXI codec jumps to the referenced type "grammar", if it exists.
  • the list is rebuilt on first demand by building a combination of all type grammars (G1 + G2 + ).
  • combinability is supported by the fact that at least one global element from the combined grammar with the correct local name and / or name space designation is used in the initialization phase for wildcard expressions or wildcards.
  • game as defined in ⁇ in EXI wildcards such as AT (*), AT (uri, *), SE (*), SE (uri, *), is of a grammar possible usually a list of all global elements and / or attributes used as a possible comparison. An attempt is made to find a global element and / or attribute that in the list matches the local name and a Uniform Resource Identifier (URI) of the namespace. In the case of multiple combined grammars, the combined list is searched accordingly.
  • URI Uniform Resource Identifier
  • the compatibility is supported by the fact that an extended substitution group is formed in the initialization phase for elements of substitutional groups of various pre-generated grammars, in which elements of various pre-generated grammars a same substitution group associated with the ⁇ .
  • an element can be substituted with all elements that belong to the same substitution group or
  • substitutionGroup Belong to "substitutionGroup".
  • substitution group or the Substituti ⁇ onsrios associated list may need to be extended matiken if elements from different grammars of the same substitution group members.
  • the invention relates to a method for converting a binary data stream, preferably EXI data stream, wherein in an initialization phase, a plurality of grammars generated in advance from at least one description language scheme are read from a memory area and combined into a combined grammar, and wherein the combined Grammar of a runtime environment for the implementation of the binary data stream is supplied.
  • the invention allows one hand, a substantially ACCEL ⁇ nddle produce the desired grammar compared to a grammar generated as needed from individual schemes, on the other hand, the memory requirement can be kept small, since the provision of a combinatorial diversity at omitted grammars.
  • the invention provides for increased flexibility by enabling new, possibly unforeseen, combinations without having to generate a new grammar for this combination.
  • a faster update is possible for changes in individual schemes, since only the affected atomic grammar and not all combinations have to be re- generated .
  • the invention allows a reduced management of metadata, as an atomic grammar preferably relates to only a scheme and not a combina ⁇ tion of schemes.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Computational Linguistics (AREA)
  • Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Stored Programmes (AREA)

Abstract

L'invention concerne dans l'ensemble un procédé de conversion d'un flux de données binaires, de préférence d'un flux de données EXI ; dans une phase d'initialisation, une pluralité de grammaires, générées à l'avance à partir d'au moins un schéma de langage de description, sont lues dans une zone de mémoire et sont assemblées pour former une grammaire combinée et la grammaire combinée est amenée à un environnement de durée d'exécution pour convertir le flux de données binaires. L'invention permet d'une part de générer beaucoup plus rapidement la grammaire souhaitée par rapport à une grammaire générée à la demande, qui est constituée de données de schéma individuelles et, d'autre part, le besoin de place mémoire peut être maintenu faible car il n'est plus nécessaire d'avoir une diversité combinatoire de grammaires.
EP15703246.7A 2015-01-26 2015-01-26 Procédé de conversion d'un flux de données binaires Withdrawn EP3227792A1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2015/051502 WO2016119817A1 (fr) 2015-01-26 2015-01-26 Procédé de conversion d'un flux de données binaires

Publications (1)

Publication Number Publication Date
EP3227792A1 true EP3227792A1 (fr) 2017-10-11

Family

ID=52462903

Family Applications (1)

Application Number Title Priority Date Filing Date
EP15703246.7A Withdrawn EP3227792A1 (fr) 2015-01-26 2015-01-26 Procédé de conversion d'un flux de données binaires

Country Status (4)

Country Link
US (1) US10643024B2 (fr)
EP (1) EP3227792A1 (fr)
CN (1) CN107209755A (fr)
WO (1) WO2016119817A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108052320B (zh) * 2017-12-11 2021-03-05 上证所信息网络有限公司 一种将二进制结构体转换为json对象的方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10218812A1 (de) 2002-04-26 2003-11-20 Siemens Ag Generische Datenstrombeschreibung
EP2219117A1 (fr) 2009-02-13 2010-08-18 Siemens Aktiengesellschaft Module de traitement, dispositif et procédé de traitement de données XML
WO2012171965A1 (fr) * 2011-06-14 2012-12-20 Siemens Aktiengesellschaft Procédé et dispositifs destinés à l'échange de données
JP2014191613A (ja) * 2013-03-27 2014-10-06 Toshiba Corp エンコーダ、エンコード方法及びプログラム

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
None *
See also references of WO2016119817A1 *

Also Published As

Publication number Publication date
US10643024B2 (en) 2020-05-05
WO2016119817A1 (fr) 2016-08-04
CN107209755A (zh) 2017-09-26
US20180004716A1 (en) 2018-01-04

Similar Documents

Publication Publication Date Title
EP1522028B9 (fr) Procede et dispositif pour coder/decoder des documents structures, notamment des documents xml
DE68928190T2 (de) Dynamische Wiederbestimmung einer Rahmenstruktur
EP3158462A1 (fr) Appareil avec une interface de communication et procédé de commande d'un accès à des banques de données
EP2197213B1 (fr) Procédé d'amélioration de la fonctionnalité de la représentation binaire de MPEG-7 et autres descriptions de contenu XML
DE102005013639A1 (de) Verfahren und System zum Ausgeben von Daten
EP1719345B1 (fr) Procede et dispositif pour coder et decoder des documents structures
DE10250641A1 (de) Auf- und abwärtskompatible Schemaevolution
WO2016110356A1 (fr) Procédé d'intégration d'un traitement de données sémantique
WO2016119817A1 (fr) Procédé de conversion d'un flux de données binaires
EP1616274B1 (fr) Procede de codage d'un document structure
EP3411803B1 (fr) Appareil et procédé de traitement d'un document de structure à codage binaire
DE102016218656A1 (de) Verfahren zur Generierung eines User-Interfaces in Form einer Mindmap
EP3991064B1 (fr) Procédé et dispositif à processeur pour modifier un format de données de communication d'un appareil de communication ainsi qu'un véhicule à moteur
DE102015115797A1 (de) Verfahren zum Erzeugen von elektronischen Dokumenten
DE10047338C2 (de) Verfahren zur Datenkompression von strukturierten Dokumenten und Anordnung zur Durchführung des Verfahrens
EP2149844B1 (fr) Procédé et produit de programme informatique d'introduction automatique de données d'un système de base de données dans une structure de données
EP1659502B1 (fr) Génération automatique de feuilles de style pour les documents structurés
DE102012208179A1 (de) Verfahren zum Betreiben einer Elektronikeinrichtung eines Kraftfahrzeugs sowie eine entsprechende Elektronikeinrichtung
DE102011112076A1 (de) Verfahren zum Erzeugen eines Druckproduktes
EP1787474A1 (fr) Procede de codage d'un document xml
WO2001088748A2 (fr) Procede pour etablir un document de sortie dans un systeme informatique
WO2012171965A1 (fr) Procédé et dispositifs destinés à l'échange de données
DE10248758A1 (de) Verfahren und Vorrichtungen zum Encodieren/Decodieren von strukturierten Dokumenten, insbesondere von XML-Dokumenten
Web Linked Data
DE102004049821A1 (de) Verfahren zum Konvertieren von Daten

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20170626

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20181022

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Effective date: 20200805