FR2866735B1 - Method for organising a database - Google Patents

Method for organising a database

Info

Publication number
FR2866735B1
FR2866735B1 FR0409973A FR0409973A FR2866735B1 FR 2866735 B1 FR2866735 B1 FR 2866735B1 FR 0409973 A FR0409973 A FR 0409973A FR 0409973 A FR0409973 A FR 0409973A FR 2866735 B1 FR2866735 B1 FR 2866735B1
Authority
FR
France
Prior art keywords
organising
database
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.)
Active
Application number
FR0409973A
Other languages
French (fr)
Other versions
FR2866735A1 (en
Inventor
Michel Koskas
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.)
KoDe
Original Assignee
KoDe
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
Priority claimed from FR0310474A external-priority patent/FR2860084A1/en
Application filed by KoDe filed Critical KoDe
Priority to FR0409973A priority Critical patent/FR2866735B1/en
Publication of FR2866735A1 publication Critical patent/FR2866735A1/en
Application granted granted Critical
Publication of FR2866735B1 publication Critical patent/FR2866735B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2246Trees, e.g. B+trees

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
FR0409973A 2003-09-22 2004-09-21 Method for organising a database Active FR2866735B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
FR0409973A FR2866735B1 (en) 2003-09-22 2004-09-21 Method for organising a database

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR0310474A FR2860084A1 (en) 2003-09-22 2003-09-22 Method for organising a database
FR0409973A FR2866735B1 (en) 2003-09-22 2004-09-21 Method for organising a database

Publications (2)

Publication Number Publication Date
FR2866735A1 FR2866735A1 (en) 2005-08-26
FR2866735B1 true FR2866735B1 (en) 2008-06-27

Family

ID=34839876

Family Applications (1)

Application Number Title Priority Date Filing Date
FR0409973A Active FR2866735B1 (en) 2003-09-22 2004-09-21 Method for organising a database

Country Status (1)

Country Link
FR (1) FR2866735B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110399387A (en) * 2019-07-26 2019-11-01 北京明略软件系统有限公司 Method and device based on table incidence relation dynamic generation query SQL

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5826262A (en) * 1996-03-22 1998-10-20 International Business Machines Corporation Parallel bottom-up construction of radix trees
US7062499B2 (en) * 2002-01-08 2006-06-13 Intel Corporation Enhanced multiway radix tree and related methods

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110399387A (en) * 2019-07-26 2019-11-01 北京明略软件系统有限公司 Method and device based on table incidence relation dynamic generation query SQL

Also Published As

Publication number Publication date
FR2866735A1 (en) 2005-08-26

Similar Documents

Publication Publication Date Title
GB0317493D0 (en) A method
GB0417041D0 (en) Method for desinging a well completion
TWI369738B (en) Method for manufacturing a wiring
HK1134391A1 (en) A method for use in an access point
AU2003294559A8 (en) Database for allowing multiple customized views
EP1602972A4 (en) Method for manufacturing optical device
IL176376A0 (en) Method for analyzing a glycomolecule
AU2003253348A8 (en) Method for producing tamper-proof identification elements
PL1697390T3 (en) Method for producing organoacylphosphites
GB2396937B (en) A method for providing database validation
EP1732394A4 (en) Method for dehydro-roasting
GB0304533D0 (en) Database system
EP1712949A4 (en) Method for manufacturing information display
GB0208060D0 (en) Business method for forming a database
PL380000A1 (en) Method for preparing bisphenol a
PL371244A1 (en) Method for operating a call-centre
IL172332A0 (en) Method for producing a polypeptide
PL1651784T3 (en) Method for producing concentrates
FR2866735B1 (en) Method for organising a database
EP1701920A4 (en) Method for treating-containing solutions
AU2003253813A8 (en) Method for colpoplasty
HK1133870A1 (en) Method for producing 4-pentafluoride-sulfanyl-benzoylguanidines
GB0302531D0 (en) Database search tool
GB2394492B (en) Method for enhancing well productivity
AU2003214103A8 (en) Method for identifying specific rna-inhibitors

Legal Events

Date Code Title Description
PLFP Fee payment

Year of fee payment: 12

PLFP Fee payment

Year of fee payment: 13

PLFP Fee payment

Year of fee payment: 14