Global Patent Index - EP 1872279 A1

EP 1872279 A1 20080102 - METHOD FOR PROCESSING A DATA TREE STRUCTURE

Title (en)

METHOD FOR PROCESSING A DATA TREE STRUCTURE

Title (de)

VERFAHREN ZUM VERARBEITEN EINER DATENBAUMSTRUKTUR

Title (fr)

PROCEDE DE TRAITEMENT D'UNE STRUCTURE DE DONNEES ARBORESCENTE

Publication

EP 1872279 A1 20080102 (FR)

Application

EP 06726323 A 20060407

Priority

  • FR 2006050317 W 20060407
  • FR 0503642 A 20050412

Abstract (en)

[origin: WO2006108983A1] The invention relates to a method for processing a data tree structure organised into inter-connected elements. According to the invention, the method comprises the steps: definition of processing units as sub-sets of inter-connected elements, allocation to each processing unit a processing date on which the data of the allocated processing unit are to be used by a recipient unit for said data. The above is of application to progressive transmission of meta-data, in particular for adaptation of scalable multimedia content.

IPC 8 full level

G06F 17/30 (2006.01); G06F 40/143 (2020.01); H04N 21/44 (2011.01); H04N 21/84 (2011.01); H04N 21/8547 (2011.01)

CPC (source: EP KR US)

G06F 16/80 (2018.12 - EP US); G06F 17/40 (2013.01 - KR); G06F 40/143 (2020.01 - EP US); G06F 40/149 (2020.01 - EP US)

Citation (search report)

See references of WO 2006108983A1

Designated contracting state (EPC)

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

DOCDB simple family (publication)

WO 2006108983 A1 20061019; CN 101198954 A 20080611; CN 101198954 B 20100825; EP 1872279 A1 20080102; JP 2008536423 A 20080904; JP 5026407 B2 20120912; KR 101324103 B1 20131031; KR 20070121835 A 20071227; US 2009063519 A1 20090305; US 9081755 B2 20150714

DOCDB simple family (application)

FR 2006050317 W 20060407; CN 200680020972 A 20060407; EP 06726323 A 20060407; JP 2008505936 A 20060407; KR 20077026300 A 20060407; US 91856506 A 20060407