blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Release notes
European Patent Register Assistant
European Patent Register Resource Book
European Patent Register – pocket guide
FAQ - European Patent Register
Federated Register (Flyer)
Global Dossier (Flyer)
Register events
Deep link coverage
Federated Register content
The Patent Information Tour
Fair use charter

Extract from the Register of European Patents

EP About this file: EP1483693

EP1483693 - COMPUTER REPRESENTATION OF A DATA TREE STRUCTURE AND THE ASSOCIATED ENCODING/DECODING METHODS [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  12.06.2009
Database last updated on 05.10.2024
Most recent event   Tooltip30.09.2011Lapse of the patent in a contracting state
New state(s): CY, TR		published on 02.11.2011  [2011/44]
Applicant(s)For all designated states
FRANCE TELECOM
6 Place d'Alleray
75015 Paris / FR
[N/P]
Former [2008/32]For all designated states
FRANCE TELECOM
6, Place d'Alleray
75015 Paris / FR
Former [2004/50]For all designated states
FRANCE TELECOM SA
6, Place d'Alleray
75015 Paris / FR
Inventor(s)01 / LASSALLE, Edmond
17, Rue du Hingar
F-22300 Lannion / FR
 [2004/50]
Representative(s)Vidon, Patrice
Cabinet Vidon
Technopole Atalante
16B Rue de Jouanet
BP 90333
35703 Rennes Cedex 7 / FR
[N/P]
Former [2008/15]Vidon, Patrice
Cabinet Vidon 16 B, rue Jouanet - B.P. 90333 Technopole Atalante
35703 Rennes Cedex 7 / FR
Former [2004/50]Maillet, Alain
Cabinet le Guen & Maillet, 5, Place Newquay, B.P. 70250
35802 Dinard Cedex / FR
Application number, filing date03718905.721.02.2003
[2004/50]
WO2003FR00576
Priority number, dateFR2002000266427.02.2002         Original published format: FR 0202664
[2004/50]
Filing languageFR
Procedural languageFR
PublicationType: A2 Application without search report
No.:WO03073320
Date:04.09.2003
Language:FR
[2003/36]
Type: A2 Application without search report 
No.:EP1483693
Date:08.12.2004
Language:FR
The application published by WIPO in one of the EPO official languages on 04.09.2003 takes the place of the publication of the European patent application.
[2004/50]
Type: B1 Patent specification 
No.:EP1483693
Date:06.08.2008
Language:FR
[2008/32]
Search report(s)International search report - published on:EP01.04.2004
ClassificationIPC:G06F17/30
[2004/50]
CPC:
G06F16/322 (EP,US)
Designated contracting statesAT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HU,   IE,   IT,   LI,   LU,   MC,   NL,   PT,   SE,   SI,   SK,   TR [2004/50]
Extension statesALNot yet paid
LTNot yet paid
LVNot yet paid
MKNot yet paid
RONot yet paid
TitleGerman:DARSTELLUNG EINER BAUMDATENSTRUKTUR UND ASSOZIIERTES KODIERUNGS-/DEKODIERUNGSVERFAHREN[2004/50]
English:COMPUTER REPRESENTATION OF A DATA TREE STRUCTURE AND THE ASSOCIATED ENCODING/DECODING METHODS[2004/50]
French:REPRESENTATION INFORMATIQUE D'UNE STRUCTURE DE DONNEES ARBORESCENTE ET METHODES DE CODAGE/DECODAGE ASSOCIEES[2004/50]
Entry into regional phase10.08.2004National basic fee paid 
10.08.2004Designation fee(s) paid 
10.08.2004Examination fee paid 
Examination procedure04.09.2003Request for preliminary examination filed
International Preliminary Examining Authority: EP
10.08.2004Examination requested  [2004/50]
15.11.2005Despatch of a communication from the examining division (Time limit: M04)
17.02.2006Reply to a communication from the examining division
10.08.2007Despatch of a communication from the examining division (Time limit: M02)
02.10.2007Reply to a communication from the examining division
15.02.2008Communication of intention to grant the patent
10.06.2008Fee for grant paid
10.06.2008Fee for publishing/printing paid
Opposition(s)07.05.2009No opposition filed within time limit [2009/29]
Fees paidRenewal fee
25.02.2005Renewal fee patent year 03
27.02.2006Renewal fee patent year 04
26.02.2007Renewal fee patent year 05
27.02.2008Renewal fee patent year 06
28.03.2008Renewal fee patent year 07
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court		 See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipAT06.08.2008
CY06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
TR06.08.2008
BG06.11.2008
SE06.11.2008
GR07.11.2008
PT06.01.2009
HU07.02.2009
LU21.02.2009
BE28.02.2009
CH28.02.2009
LI28.02.2009
MC28.02.2009
[2011/43]
Former [2011/31]AT06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
SE06.11.2008
GR07.11.2008
PT06.01.2009
HU07.02.2009
LU21.02.2009
BE28.02.2009
CH28.02.2009
LI28.02.2009
MC28.02.2009
Former [2011/21]AT06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
SE06.11.2008
GR07.11.2008
PT06.01.2009
LU21.02.2009
BE28.02.2009
CH28.02.2009
LI28.02.2009
MC28.02.2009
Former [2010/48]AT06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
SE06.11.2008
GR07.11.2008
PT06.01.2009
BE28.02.2009
CH28.02.2009
LI28.02.2009
MC28.02.2009
Former [2010/10]AT06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
SE06.11.2008
PT06.01.2009
BE28.02.2009
CH28.02.2009
LI28.02.2009
MC28.02.2009
Former [2010/09]AT06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
SE06.11.2008
PT06.01.2009
CH28.02.2009
LI28.02.2009
MC28.02.2009
Former [2009/47]AT06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
PT06.01.2009
CH28.02.2009
LI28.02.2009
MC28.02.2009
Former [2009/43]AT06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
PT06.01.2009
MC28.02.2009
Former [2009/36]AT06.08.2008
CZ06.08.2008
DK06.08.2008
EE06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
PT06.01.2009
Former [2009/25]AT06.08.2008
CZ06.08.2008
DK06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
PT06.01.2009
Former [2009/24]AT06.08.2008
CZ06.08.2008
DK06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
SK06.08.2008
BG06.11.2008
Former [2009/23]AT06.08.2008
DK06.08.2008
FI06.08.2008
IE06.08.2008
NL06.08.2008
SI06.08.2008
BG06.11.2008
Former [2009/20]AT06.08.2008
DK06.08.2008
FI06.08.2008
NL06.08.2008
SI06.08.2008
Former [2009/15]AT06.08.2008
FI06.08.2008
NL06.08.2008
SI06.08.2008
Former [2009/12]FI06.08.2008
NL06.08.2008
Cited inInternational search[A]US5752243  (REITER ALLEN [IL], et al) [A] 1-26 * abstract * * column 4, line 52 - column 5, line 7 * * column 6, line 43 - column 6, line 55 ** column 7, line 36 - column 7, line 50 *;
 [X]  - CHANG H, "BUBBLE STRUCTURE AND OPERATION TO FACILITATE TREE TRAVERSAL", IBM TECHNICAL DISCLOSURE BULLETIN, IBM CORP. NEW YORK, US, (19840201), vol. 26, no. 9, ISSN 0018-8689, pages 4766 - 4777, XP000714569 [X] 1-4 * page 4767, line 14 - page 4767, line 18 * * page 4769, line 14 - page 4770, line 12 * * page 4773, line 18 - page 4774, line 7 * * page 4774, line 16 - page 4775, line 36 *
 [A]  - LAM S W ET AL, "REPRESENTING LEXICONS BY MODIFIED TRIE FOR FAST PARTIAL STRING MATCHING", CHARACTER RECOGNITION TECHNOLOGIES. SAN JOSE, FEB. 1 - 2, 1993, BELLINGHAM, SPIE, US, (1993), ISBN 0-8194-1139-6, pages 229 - 237, XP000628870 [A] 1-26 * abstract * * page 230, line 31 - page 232, line 11 * * page 233, line 18 - page 236, line 8 *
 [A]  - DUNDAS III J A, "IMPLEMENTING DYNAMIC MINIMAL-PREFIX TRIES", SOFTWARE PRACTICE & EXPERIENCE, JOHN WILEY & SONS LTD. CHICHESTER, GB, (19911001), vol. 21, no. 10, ISSN 0038-0644, pages 1027 - 1040, XP000297892 [A] 1-26 * abstract * * page 1027, line 1 - page 1029, line 14 * * page 1030, line 19 - page 1031, line 17 * * page 1033, line 33 - page 1035, line 29 *

DOI:   http://dx.doi.org/10.1002/spe.4380211004
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.