EP1787474A1 - Procede de codage d'un document xml - Google Patents

Procede de codage d'un document xml

Info

Publication number
EP1787474A1
EP1787474A1 EP05787133A EP05787133A EP1787474A1 EP 1787474 A1 EP1787474 A1 EP 1787474A1 EP 05787133 A EP05787133 A EP 05787133A EP 05787133 A EP05787133 A EP 05787133A EP 1787474 A1 EP1787474 A1 EP 1787474A1
Authority
EP
European Patent Office
Prior art keywords
document
information
coding
context
paths
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.)
Ceased
Application number
EP05787133A
Other languages
German (de)
English (en)
Inventor
Jörg Heuer
Andreas Hutter
Uwe Rauschenbach
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 EP1787474A1 publication Critical patent/EP1787474A1/fr
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/235—Processing of additional data, e.g. scrambling of additional data or processing content descriptors
    • H04N21/2353—Processing of additional data, e.g. scrambling of additional data or processing content descriptors specifically adapted to content descriptors, e.g. coding, compressing or processing of metadata
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/235—Processing of additional data, e.g. scrambling of additional data or processing content descriptors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/435—Processing of additional data, e.g. decrypting of additional data, reconstructing software from modules extracted from the transport stream

Definitions

  • the invention relates to a method for encoding an XML-based document according to the preamble of claim 1, a corresponding decoding method according to the preamble of claim 18 and corresponding to a coding device according to claim 19 and decoding device according to claim 20.
  • XML Extensible Markup Language
  • XML schema language definitions Ei ⁇ ne more detailed description of the XML schema and the ver ⁇ is applied structures, data types and content models can be found in references [7], [8] and [9].
  • fragment update units It is often necessary to categorize fragment update units according to their content and, for example, to store them in a categorized form in tables. This enables fragments of a category to be called up quickly if required and to be able to represent them, for example. It is advantageous in this case if the categorization requires little computational complexity, since the categorization is carried out during reception without concrete retrieval alongside other tasks of a recipient. that must. For example, in addition to receiving, decoding and displaying a broadcast, XML fragments are also received which contain information that accompanies the program and can be categorized quickly. In this case, it is advantageous if the context information by means of which the fragments are categorized are of fixed length, since these can then be read out with low complexity and compared for categorization.
  • a data stream is generated, which is divided into several units (access units), which in turn consist of several fragments, the above-mentioned fragment Update Units.
  • the units are encoded and, if required, sent as MPEG7 BiM stream to one or more receivers.
  • the fragments here contain context information which, depending on the fragment content, is represented by a different number of bits.
  • the possible fragment content here is not limited to a subset of the XML elements to be transferred.
  • TVA TV Anytime
  • the set of possible XML elements of an XML document is defined by a namespace in the referenced document [6].
  • the contents of fragments are set to a subset of these XML elements.
  • the Sig ⁇ alization the context information of these fragments is at da ⁇ by a fixed length code specified. This allowed ⁇ light-efficient categorization of received Frag ⁇ elements, however, the fragmentation is limited to the spezifizier- th fragment content. If new Informationsele ⁇ ment be transmitted this is not possible without re-assignment of codes.
  • the object of the invention is therefore a method for encoding and a method for decoding XML-based
  • This object is achieved on the basis of the method for coding according to the preamble of claim 1 by its characterizing features nenden. Furthermore, this is achieved by the method for decoding according to claim 18 and by the coding device according to claim 19 and the decoding device according to claim 20.
  • a significant advantage of the invention is that the categorization can be done faster than is the case with methods according to the prior art. This is achieved in an advantageous manner without restricting the amount of possible Fragmen ⁇ te.
  • the invention also enables efficient coding of the context information.
  • the invention comprises a method for decoding a data structure, wherein the method is designed such that a data structure coded with the coding method described above is decoded.
  • the invention comprises a method for coding and decoding a data structure, which comprises the above-described coding method and decoding method.
  • the invention also comprises an encoder with the encoding method according to the invention is practicable, and a decoding apparatus according to the invention Deco ⁇ with the coding method is feasible. Furthermore, the invention relates to a corresponding device for encoding and decoding, with which the above-described combined coding and Deco ⁇ dierhabilit is feasible.
  • the type of information in an XML element or XML attribute of a document is declared by the names of all the parent elements and their types.
  • the XML elements and XML attributes are arranged according to a structure definition in a document tree.
  • the paths are ginnen this Absolutpfa ⁇ de, which be from the root node of the document structure tree ⁇ and an element of the document structure tree wit ⁇ ren, which is exclusively contained in a fragment, that is a root element of a coded fragment.
  • This table called the context path table, is pre-transferred to initialize the decoder.
  • Each entry table of the encoder and decoder belongs to the context path ⁇ a context code ( "Con text code") of fixed length.
  • Context code Prior to the transfer of a codier ⁇ th fragment is the absolute path to the root element of the fragment as context information by the associated Con- text code signals.
  • This context is code transmission via an over ⁇ away in length fixed.
  • using a Initi ⁇ al Deutschenstabelle allows during initialization of the transfer free choice of splitting into fragments.
  • the paths are stored relative to the previous path in a table and transferred. This can reduce the memory overhead for the table.
  • the paths are stored and transmitted in the table according to the context path ("ContextPath") coding of the MPEG-7 BiM format [1] [2], making it possible to use a standardized, widely distributed structure and the Reduction of Speicherauf ⁇ wall to be further increased.
  • ContextPath context path
  • the context path tables are repeatedly stored and transmitted in the data stream.
  • the length of the context code is hereby gene codes by variable countries, for example with variable length unsigned integer most signiffigcant bit first "vluimsbf" as elements in the document ⁇ [1] [2] is defined signaled. This allows receivers to dial into a broadcast, immediately categorize fragments, and associate context paths as soon as a context path label is received.
  • the context path table only context paths the paths to be transmitted root ⁇ elements from previously transmitted and until the next transmission Students ⁇ the context path table to be transmitted fragments included. New paths to root elements of fragments extend the context path table.
  • This method is advantageous, in particular, in the case of repeated transmission of context paths , since the context path table contains only previously necessary information.
  • This context path table is there ⁇ with smaller than those of all paths included root elements of fragments of the entire transmission. If the context paths contained in the context path table is not associated aufein ⁇ other following context codes so's Kon ⁇ text path table to code in addition to the respective context path the assigned context code.
  • FIG. 1a is an XML document structured according to the prior art
  • FIG. 1b shows a representation of the structured XML document tree known from the prior art
  • FIG. 1a is an XML document structured according to the prior art
  • FIG. 1b shows a representation of the structured XML document tree known from the prior art
  • FIG. 1b shows a representation of the structured XML document tree known from the prior art
  • FIG. 1c a division of the tree known from the prior art into fragments
  • FIG. 1d A data stream resulting from the prior art, comprising access units and fragments
  • Fig.3 Structure of a context path table.
  • FIG. 1a shows a structured XML document in textual form known from the prior art. It can be seen here that between structural elements denoted by pointed brackets-simplistically also referred to as elements-in part, further structural elements as well as for this representation exemplarily selected data (Wer ⁇ teaus rempligungen) are embedded. For this purpose, also with the English term "tag" structure elements denoted are partly designed as a pair of a preamble and abschlie- sequent day, with the final day le ⁇ diglich stroked by one of the angle bracket following Schräg ⁇ different from the initial day.
  • Figure Ib shows the known from the figure Ia struc ⁇ tured XML document in the tree representation.
  • said structural elements or pairs of Strukturelemen ⁇ give te respectively a shown as an ellipse element or node of the document, wherein, in case containing an element in a wide ⁇ res element - so it embeds -, a path from node directly ei ⁇ nem leads to a new node, whereas if the element immediately embeds data - that is, contains a value - a path from a node opens directly into a rectangular value expression.
  • each node DEI... can thus be determined or described by an absolute path leading to it.
  • the node DE5 is determined by the path resulting from the steps A2 and B1.
  • Tree representation The tree structure in subtrees ST1 ... ST4 is subdivided representing the fragments of XML Do ⁇ kuments mentioned.
  • each sub-tree ST1 ... ST4 in each case from one of the elements DEl ... DElO, which is exclusive ⁇ siv in a subtree ST1 ... ST4 included, a root element or node FRE1 ... FRE4 of the respective fragment (sub-tree) ST1... ST4, which in turn opens either in remaining elements DE5... DE10 or in value expressions.
  • the subtrees ST1 ... ST4 can analogously to the above-described method ⁇ nen by paths to the root elements FRE1 ... FRE4 the subtrees are identified.
  • Figure Id shows the structure of a coded Da ⁇ tenstroms BS as it presents itself according to a well-known from the prior Tech ⁇ nik specified representation.
  • the data stream is divided into Access Units AU, which consist of several fragments of FUU.
  • the fragments corresponding to FIG FUU Ib sub trees ⁇ represent an XML document.
  • the fragments FUU be represented by a fragment command (FC), by a context path (CP) and Posi ⁇ tion code to the root element FRE1 ... FRE4 of a subtree and a representation of the subtree (PL).
  • context path CP according to an XPATH notation [3] known from the prior art is shown, which consists of a sequence of names, which is separated by slashes, from a parent node (also father node) to its parent or its subsequent node (also successor or child node) results.
  • the context path can identify any XML element or attribute of a namespace declared in the instance. In general, it is, however, apply for a transfer useful only certain elements or attributes as the root element of a subtree for the representation of a fragment FUU to ver ⁇ .
  • context paths with variable length codes of the length of a context path are represented according to the XPATH Notati on ⁇ [3] similar. However, this is associated with disadvantages as described above.
  • An encoding according to the invention therefore creates a possibility in which, in particular in the case of several questions, elements with the same context path efficient encoding with context fixed length codes is light in the fragments FUU made ⁇ .
  • FIG. 2 shows a structure of a data stream generated by the method according to the invention, which represents the coded XML document. It can be seen that the stream contains, in addition to fragments FUU, at the beginning of the transmission a context path table CPT which comprises a list of context paths CP1... CP4.
  • the bit length of the context codes CC is determined, which remains constant for the duration of a transmission to a decoder, so that all entries can be uniquely identified.
  • the bit length (CC)> ld (number of entries) is chosen, where Id is the base two logarithm.
  • the root nodes of the sub-trees are signaled in the respective fragments by the value of the context code CC which refers to entries in the context-path table CPT containing the context path CP1 ... CP4 to the root node.
  • the value "1" identifies the second entry in the context path table CPT, since "0" identifies the first entry.
  • Figure 3 shows an example of a context path table for the partitioning shown in Figure Ic.
  • two addressable context paths CP '1, CP' 2 are encoded.
  • the context code can be coded with the above given calculation with one bit: 0 signals the first context path, 1 the second.
  • FIG. 4 shows an alternative exemplary embodiment of a context path table in which the number of bits (8) corresponds to that of the
  • Context code encoded is explicitly coded in the data stream - so the decoder is signaled. This is special advantageous to be when the Kontextpfadta ⁇ beauty during transmission expanded with additional context paths. This is particularly necessary in the case of methods for coding XML documents in which the complete XML document is not yet available at the beginning of the encoding and thus not yet all the context paths of the root elements of sub-trees are known.
  • FIG. 5 shows the structure of a data stream generated by the method according to the invention, in which a first context path table CPT was coded at the beginning of the data stream and an extension or update of the context path table CBTU was coded later in the data stream.
  • FIG. 6 shows another possible embodiment of an extension of a context path table CPTU according to the invention, which contains information at which position (3) in the context path table the following new context paths (/ Group / Chair) are entered.
  • ETSI TS 102 822-3-2 Broadcast and On-line Services:
  • DVB GBS0005rl6 Carriage of TVA Information in DVB TSs

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Library & Information Science (AREA)
  • Document Processing Apparatus (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

L'invention concerne un procédé de codage d'un document structurel selon lequel tous les éléments XML étant des éléments racine d'un fragment codé sont enregistrés dans un tableau en fonction de leur nom et du nom de leurs éléments père, c.-à-d. en fonction de leur chemin. Les chemins sont des chemins absolus issus du noeud racine de l'arbre de structure de document et menant à un élément de l'arbre de structure de document exclusivement contenu dans un fragment, c.-à-d. étant un élément racine d'un fragment codé. Ce tableau, appelé tableau de chemin de contexte, est transmis au préalable pour l'initialisation du décodeur. Le codeur/décodeur affecte un code de contexte ("ContextCode") de longueur fixe à chaque entrée dans le tableau de chemin de contexte. Avant transmission d'un fragment codé, le chemin absolu vers l'élément racine du fragment est signalisé en tant qu'information de contexte par le code de contexte affecté. Ce code de contexte présente une longueur fixe sur l'ensemble d'une transmission. L'utilisation d'un tableau d'initialsation permet toutefois de choisir librement la répartition en fragments lors de l'initialisation de la transmission.
EP05787133A 2004-09-07 2005-08-30 Procede de codage d'un document xml Ceased EP1787474A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102004043269A DE102004043269A1 (de) 2004-09-07 2004-09-07 Verfahren zur Codierung eines XML-basierten Dokuments
PCT/EP2005/054255 WO2006027323A1 (fr) 2004-09-07 2005-08-30 Procede de codage d'un document xml

Publications (1)

Publication Number Publication Date
EP1787474A1 true EP1787474A1 (fr) 2007-05-23

Family

ID=35539300

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05787133A Ceased EP1787474A1 (fr) 2004-09-07 2005-08-30 Procede de codage d'un document xml

Country Status (5)

Country Link
US (1) US20080189310A1 (fr)
EP (1) EP1787474A1 (fr)
JP (1) JP4668273B2 (fr)
DE (1) DE102004043269A1 (fr)
WO (1) WO2006027323A1 (fr)

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6745206B2 (en) * 2000-06-05 2004-06-01 International Business Machines Corporation File system with access and retrieval of XML documents
AUPQ867700A0 (en) * 2000-07-10 2000-08-03 Canon Kabushiki Kaisha Delivering multimedia descriptions
AUPR063400A0 (en) * 2000-10-06 2000-11-02 Canon Kabushiki Kaisha Xml encoding scheme
KR100865245B1 (ko) * 2000-10-17 2008-10-27 코닌클리케 필립스 일렉트로닉스 엔.브이. 인코딩 방법, 디코딩 방법, 인코더, 디코더, 전송 시스템, 및 저장 매체
FR2820228B1 (fr) * 2001-01-30 2004-03-12 Expway Procede de codage et de decodage d'un chemin dans l'arborescence d'un document structure
US7689901B2 (en) * 2001-03-01 2010-03-30 Sony Corporation Multiple updates to content descriptions using a single command
JP3832807B2 (ja) * 2001-06-28 2006-10-11 インターナショナル・ビジネス・マシーンズ・コーポレーション データ処理方法及びその手法を用いたエンコーダ、デコーダ並びにｘｍｌパーサ
US20030009472A1 (en) * 2001-07-09 2003-01-09 Tomohiro Azami Method related to structured metadata
JP4231261B2 (ja) * 2002-09-12 2009-02-25 株式会社エヌ・ティ・ティ・ドコモ 同一性判定装置
JP2004318188A (ja) * 2002-09-26 2004-11-11 Victor Co Of Japan Ltd 構造化データの受信プログラム
DE10309336B4 (de) * 2003-03-04 2005-11-24 Siemens Ag Verfahren zur Codierung eines strukturierten Dokuments
US8762381B2 (en) * 2004-05-21 2014-06-24 Ca, Inc. Storing multipart XML documents

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"Digital Video Broadcasting (DVB); Carriage and signalling of TV-Anytime information in DVB transport streams; ETSI TS 102 323", IEEE, LIS, SOPHIA ANTIPOLIS CEDEX, FRANCE, vol. BC, no. V1.1.1, 1 September 2004 (2004-09-01), XP014016292, ISSN: 0000-0001 *
See also references of WO2006027323A1 *

Also Published As

Publication number Publication date
DE102004043269A1 (de) 2006-03-23
US20080189310A1 (en) 2008-08-07
JP2008512886A (ja) 2008-04-24
JP4668273B2 (ja) 2011-04-13
WO2006027323A1 (fr) 2006-03-16

Similar Documents

Publication Publication Date Title
EP2197213B1 (fr) Procédé d'amélioration de la fonctionnalité de la représentation binaire de MPEG-7 et autres descriptions de contenu XML
EP1766982B1 (fr) Procede de codage d'un document xml, procede de decodage, procede de codage et decodage, dispositif de codage, dispositif de decodage et dispositif de codage et decodage
EP1522028B9 (fr) Procede et dispositif pour coder/decoder des documents structures, notamment des documents xml
DE60225785T2 (de) Verfahren zur codierung und decodierung eines pfades in der baumstruktur eines strukturierten dokuments
EP1561281B1 (fr) Procede de production d'un train de bits a partir d'un arbre d'indexation
EP1645133B1 (fr) Procede de codage de documents structures
EP1616274B1 (fr) Procede de codage d'un document structure
WO2004040441A2 (fr) Evolution de schema compatible en amont et en aval
EP1400124B1 (fr) Procede pour ameliorer la fonctionnalite de la representation binaire de descriptions de contenu mpeg-7 et basees sur d'autres langages xml
DE102004009617A1 (de) Verfahren und Vorrichtung zur Codierung und Decodierung von strukturierten Dokumenten
EP1787474A1 (fr) Procede de codage d'un document xml
EP1399857B1 (fr) Procede permettant une recherche rapide d'elements ou d'attributs, ou un filtrage rapide de fragments dans des representations binaires de documents structures
DE10339971A1 (de) Verfahren zur Codierung eines XML-basierten Dokuments
WO2005008521A1 (fr) Procédé d'indexation de documents structurés
EP3411803A1 (fr) Appareil et procédé de traitement d'un document de structure à codage binaire
DE10351896A1 (de) Verfahren zur Indizierung von strukturierten Dokumenten
DE10248758B4 (de) Verfahren und Vorrichtungen zum Encodieren/Decodieren von XML-Dokumenten
WO2004051502A2 (fr) Procede pour coder un document base sur le langage xml
DE10351897A1 (de) Verfahren zur Codierung von strukturierten Dokumenten
DE102004044164A1 (de) Verfahren und Vorrichtung zur Kodierung von XML-Dokumenten
WO2005053315A1 (fr) Procede de production et/ou de traitement d'une description de flux de donnees

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: 20070226

AK Designated contracting states

Kind code of ref document: A1

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

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

Effective date: 20090210

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: SIEMENS AKTIENGESELLSCHAFT

REG Reference to a national code

Ref country code: DE

Ref legal event code: R003

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

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20150504