EP1606723A2 - Systeme et procede pour stocker et acceder a des donnees dans une memoire de donnees comprenant des arbres interverrouilles - Google Patents

Systeme et procede pour stocker et acceder a des donnees dans une memoire de donnees comprenant des arbres interverrouilles

Info

Publication number
EP1606723A2
EP1606723A2 EP04715724A EP04715724A EP1606723A2 EP 1606723 A2 EP1606723 A2 EP 1606723A2 EP 04715724 A EP04715724 A EP 04715724A EP 04715724 A EP04715724 A EP 04715724A EP 1606723 A2 EP1606723 A2 EP 1606723A2
Authority
EP
European Patent Office
Prior art keywords
node
nodes
root
context
end product
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
EP04715724A
Other languages
German (de)
English (en)
Other versions
EP1606723A4 (fr
Inventor
Jane Campbell Mazzagatti
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.)
Unisys Corp
Original Assignee
Unisys Corp
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 US10/385,421 external-priority patent/US6961733B2/en
Application filed by Unisys Corp filed Critical Unisys Corp
Publication of EP1606723A2 publication Critical patent/EP1606723A2/fr
Publication of EP1606723A4 publication Critical patent/EP1606723A4/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2246—Trees, e.g. B+trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/40—Data acquisition and logging

Abstract

L'invention concerne un système et un procédé pour générer et/ou accéder à une mémoire de données à structure arborescente comprenant une forêt d'arbres interconnectés. Selon l'invention, cette mémoire de données à structure arborescente comprend un premier arbre qui dépend d'un premier noeud racine et qui peut comprendre une pluralité de branches. Chacune des branches du premier arbre se termine en noeud feuille. Chaque noeud feuille peut représenter un produit final ou un noeud de sous-composant. Une deuxième racine de cette même mémoire de données à structure arborescente est reliée à chaque noeud feuille représentant un produit final. Cette mémoire de données à structure arborescente comprend enfin une pluralité d'arbres dans lesquels le noeud racine de chacun de ces arbres peut être qualifié de noeud élémentaire. Le noeud racine de chacun de ces arbres peut être relié à un ou plusieurs noeuds dans une ou plusieurs branches du premier arbre. Les noeuds de la mémoire de données à structure arborescente contiennent uniquement des pointeurs vers d'autres noeuds de ladite mémoire et ils peuvent contenir des champs additionnels, un de ces champs pouvant être un champ de comptage. L'invention concerne également des moyens permettant d'obtenir des probabilités de coïncidence de variables relatives à des noeuds particuliers, identifiées par des contextes voulus dans un ou plusieurs foyers définis. L'application d'opérateurs logiques à des demandes concernant de telles variables est en outre présentée.
EP04715724A 2003-03-10 2004-02-27 Systeme et procede pour stocker et acceder a des donnees dans une memoire de donnees comprenant des arbres interverrouilles Withdrawn EP1606723A4 (fr)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US666382 1991-03-08
US10/385,421 US6961733B2 (en) 2003-03-10 2003-03-10 System and method for storing and accessing data in an interlocking trees datastore
US385421 2003-03-10
US10/666,382 US7158975B2 (en) 2003-03-10 2003-09-19 System and method for storing and accessing data in an interlocking trees datastore
PCT/US2004/005954 WO2004081710A2 (fr) 2003-03-10 2004-02-27 Systeme et procede pour stocker et acceder a des donnees dans une memoire de donnees comprenant des arbres interverrouilles

Publications (2)

Publication Number Publication Date
EP1606723A2 true EP1606723A2 (fr) 2005-12-21
EP1606723A4 EP1606723A4 (fr) 2006-12-20

Family

ID=32993817

Family Applications (1)

Application Number Title Priority Date Filing Date
EP04715724A Withdrawn EP1606723A4 (fr) 2003-03-10 2004-02-27 Systeme et procede pour stocker et acceder a des donnees dans une memoire de donnees comprenant des arbres interverrouilles

Country Status (7)

Country Link
EP (1) EP1606723A4 (fr)
JP (1) JP2006521639A (fr)
KR (1) KR20060016744A (fr)
AU (1) AU2004219257A1 (fr)
BR (1) BRPI0408282A (fr)
CA (1) CA2518797A1 (fr)
WO (1) WO2004081710A2 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070162508A1 (en) * 2004-11-08 2007-07-12 Mazzagatti Jane C Updating information in an interlocking trees datastore
US7348980B2 (en) * 2004-11-08 2008-03-25 Unisys Corporation Method and apparatus for interface for graphic display of data from a Kstore
US20070214153A1 (en) * 2006-03-10 2007-09-13 Mazzagatti Jane C Method for processing an input particle stream for creating upper levels of KStore
US7734571B2 (en) * 2006-03-20 2010-06-08 Unisys Corporation Method for processing sensor data within a particle stream by a KStore
US8238351B2 (en) * 2006-04-04 2012-08-07 Unisys Corporation Method for determining a most probable K location

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999034307A1 (fr) * 1997-12-29 1999-07-08 Infodream Corporation Serveur d'extraction
WO2001046834A1 (fr) * 1999-12-23 2001-06-28 1St Desk Systems, Inc. Structure de donnees en arbre meta continu pour l'indexation des informations dans une base de donnees
WO2002063498A1 (fr) * 2001-01-06 2002-08-15 Qinetiq Limited Procede d'interrogation d'une structure de donnees comprimees

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6108698A (en) * 1998-07-29 2000-08-22 Xerox Corporation Node-link data defining a graph and a tree within the graph
US6654761B2 (en) * 1998-07-29 2003-11-25 Inxight Software, Inc. Controlling which part of data defining a node-link structure is in memory
US6477683B1 (en) * 1999-02-05 2002-11-05 Tensilica, Inc. Automated processor generation system for designing a configurable processor and method for the same
JP3601416B2 (ja) * 2000-06-13 2004-12-15 日本電気株式会社 情報検索方法及び装置
US6735595B2 (en) * 2000-11-29 2004-05-11 Hewlett-Packard Development Company, L.P. Data structure and storage and retrieval method supporting ordinality based searching and data retrieval

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999034307A1 (fr) * 1997-12-29 1999-07-08 Infodream Corporation Serveur d'extraction
WO2001046834A1 (fr) * 1999-12-23 2001-06-28 1St Desk Systems, Inc. Structure de donnees en arbre meta continu pour l'indexation des informations dans une base de donnees
WO2002063498A1 (fr) * 2001-01-06 2002-08-15 Qinetiq Limited Procede d'interrogation d'une structure de donnees comprimees

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
BURTON F W ET AL: "MULTIPLE GENERATION TEXT FILES USING OVERLAPPING TREE STRUCTURES" COMPUTER JOURNAL, OXFORD UNIVERSITY PRESS, SURREY, GB, vol. 28, no. 4, August 1985 (1985-08), pages 414-416, XP000743642 ISSN: 0010-4620 *
See also references of WO2004081710A2 *

Also Published As

Publication number Publication date
EP1606723A4 (fr) 2006-12-20
CA2518797A1 (fr) 2004-09-23
WO2004081710A3 (fr) 2004-12-23
AU2004219257A1 (en) 2004-09-23
KR20060016744A (ko) 2006-02-22
BRPI0408282A (pt) 2006-03-07
WO2004081710A2 (fr) 2004-09-23
JP2006521639A (ja) 2006-09-21

Similar Documents

Publication Publication Date Title
US7158975B2 (en) System and method for storing and accessing data in an interlocking trees datastore
US20070143527A1 (en) Saving and restoring an interlocking trees datastore
US20080065661A1 (en) Saving and restoring an interlocking trees datastore
JPH06103497B2 (ja) レコード検索方法及びデータベース・システム
US7363284B1 (en) System and method for building a balanced B-tree
JP2001331509A (ja) リレーショナルデータベース処理装置、リレーショナルデータベースの処理方法及びリレーショナルデータベースの処理プログラムを記録したコンピュータ読み取り可能な記録媒体
EP1606723A2 (fr) Systeme et procede pour stocker et acceder a des donnees dans une memoire de donnees comprenant des arbres interverrouilles
US8516004B2 (en) Method for processing K node count fields using an intensity variable
US8238351B2 (en) Method for determining a most probable K location
Pai A Textbook of Data Structures and Algorithms, Volume 3: Mastering Advanced Data Structures and Algorithm Design Strategies
Usmani et al. DNA-Based Storage of RDF Graph Data: A Futuristic Approach to Data Analytics
Adhikary et al. Unveiling the Power of Data Structures: Exploring Applications in Diverse Computing Domains
Dandamudi et al. Improved partial-match search algorithms for BD trees
Strate et al. Index Storage Fundamentals
Leyton The design and implementation of a relational database management system

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

AK Designated contracting states

Kind code of ref document: A2

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

AX Request for extension of the european patent

Extension state: AL LT LV MK

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20061120

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 17/30 20060101AFI20061114BHEP

17Q First examination report despatched

Effective date: 20070320

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

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20090901