WO2004081710A3 - 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
WO2004081710A3
WO2004081710A3 PCT/US2004/005954 US2004005954W WO2004081710A3 WO 2004081710 A3 WO2004081710 A3 WO 2004081710A3 US 2004005954 W US2004005954 W US 2004005954W WO 2004081710 A3 WO2004081710 A3 WO 2004081710A3
Authority
WO
WIPO (PCT)
Prior art keywords
tree
data store
based data
node
trees
Prior art date
Application number
PCT/US2004/005954
Other languages
English (en)
Other versions
WO2004081710A2 (fr
Inventor
Jane Campbell Mazzagatti
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
Priority to CA002518797A priority Critical patent/CA2518797A1/fr
Priority to AU2004219257A priority patent/AU2004219257A1/en
Priority to BRPI0408282-6A priority patent/BRPI0408282A/pt
Priority to EP04715724A priority patent/EP1606723A4/fr
Priority to NZ542716A priority patent/NZ542716A/en
Priority to JP2006508890A priority patent/JP2006521639A/ja
Publication of WO2004081710A2 publication Critical patent/WO2004081710A2/fr
Publication of WO2004081710A3 publication Critical patent/WO2004081710A3/fr

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Computer Hardware Design (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

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.
PCT/US2004/005954 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 WO2004081710A2 (fr)

Priority Applications (6)

Application Number Priority Date Filing Date Title
CA002518797A CA2518797A1 (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
AU2004219257A AU2004219257A1 (en) 2003-03-10 2004-02-27 System and method for storing and accessing data in an interlocking trees datastore
BRPI0408282-6A BRPI0408282A (pt) 2003-03-10 2004-02-27 sistema e método para armazenar e acessar dados em armazenamento de dados em árvores de conexão
EP04715724A 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
NZ542716A NZ542716A (en) 2003-03-10 2004-02-27 System and method for storing and accessing data in an interlocking trees datastore
JP2006508890A JP2006521639A (ja) 2003-03-10 2004-02-27 インタロック状態のツリーデータストアにデータを記憶し、このデータにアクセスするためのシステムおよび方法

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US10/385,421 2003-03-10
US10/385,421 US6961733B2 (en) 2003-03-10 2003-03-10 System and method for storing and accessing data in an interlocking trees datastore
US10/666,382 2003-09-19
US10/666,382 US7158975B2 (en) 2003-03-10 2003-09-19 System and method for storing and accessing data in an interlocking trees datastore

Publications (2)

Publication Number Publication Date
WO2004081710A2 WO2004081710A2 (fr) 2004-09-23
WO2004081710A3 true WO2004081710A3 (fr) 2004-12-23

Family

ID=32993817

Family Applications (1)

Application Number Title Priority Date Filing Date
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

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
US7348980B2 (en) * 2004-11-08 2008-03-25 Unisys Corporation Method and apparatus for interface for graphic display of data from a Kstore
US20070162508A1 (en) * 2004-11-08 2007-07-12 Mazzagatti Jane C Updating information in an interlocking trees datastore
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 (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6477683B1 (en) * 1999-02-05 2002-11-05 Tensilica, Inc. Automated processor generation system for designing a configurable processor and method for the same

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2338807A (en) * 1997-12-29 1999-12-29 Infodream Corp Extraction server for unstructured documents
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
US6721723B1 (en) * 1999-12-23 2004-04-13 1St Desk Systems, Inc. Streaming metatree data structure for indexing information in a data base
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
GB0100331D0 (en) * 2001-01-06 2001-02-14 Secr Defence Method of querying a structure of compressed data

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6477683B1 (en) * 1999-02-05 2002-11-05 Tensilica, Inc. Automated processor generation system for designing a configurable processor and method for the same

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP1606723A4 *

Also Published As

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

Similar Documents

Publication Publication Date Title
WO2004081711A3 (fr) Systeme et procede pour la memorisation et l'acces de donnees dans une memoire de donnees a arborescences imbriquees
Bret‐Harte et al. Primary and secondary stem growth in arctic shrubs: implications for community response to environmental change
Harper et al. Edge influence on vegetation at natural and anthropogenic edges of boreal forests in C anada and F ennoscandia
Amir et al. Dynamic dictionary matching
US6411957B1 (en) System and method of organizing nodes within a tree structure
US9760652B2 (en) Hierarchical storage architecture using node ID ranges
Giancarlo A generalization of the suffix tree to square matrices, with applications
SG90081A1 (en) Orthogonal browsing in object hierarchies
NO20014399L (no) En datastruktur og lagrings- og hentemetode som stötter ordinal-tallbasert datasöking og henting
CN102521375B (zh) 一种目录服务数据检索方法及系统
van Kreveld et al. Divided kd trees
CN108197313A (zh) 通过16位Trie树实现空间优化的词典索引方法
Bevan Growth rates of permutation grid classes, tours on graphs, and the spectral radius
CN108829880A (zh) 一种光网络终端设备的配置管理的方法
CN101399738A (zh) 提供下载推荐服务的方法、结构化对等网络和其中的节点
WO2004081710A3 (fr) Systeme et procede pour stocker et acceder a des donnees dans une memoire de donnees comprenant des arbres interverrouilles
EP1164508A3 (fr) Fichiers communs dans une queue pour maintenir des index de raccordement
Ginat et al. A tight amortized bound for path reversal
Huong et al. Woody plant diversity in tropical moist evergreen closed forest in Tan Phu Forest, Dong Nai province
Frieze et al. Large induced trees in sparse random graphs
TW200509613A (en) Sparse and non-sparse data management method and system
Ganguly et al. Parameterized Pattern Matching--Succinctly
CN113225604B (zh) 一种iptv的树状存储结构
CA2278605A1 (fr) Procede et systeme de compression de donnees d'apres un algorithme d'arbre de contextes
Agu et al. A stochastic description of branching structures of trees

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DPEN Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2518797

Country of ref document: CA

Ref document number: 2006508890

Country of ref document: JP

Ref document number: 2004219257

Country of ref document: AU

WWE Wipo information: entry into national phase

Ref document number: 1020057016962

Country of ref document: KR

ENP Entry into the national phase

Ref document number: 2004219257

Country of ref document: AU

Date of ref document: 20040227

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 542716

Country of ref document: NZ

WWP Wipo information: published in national office

Ref document number: 2004219257

Country of ref document: AU

WWE Wipo information: entry into national phase

Ref document number: 2004715724

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 20048113697

Country of ref document: CN

WWP Wipo information: published in national office

Ref document number: 2004715724

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1020057016962

Country of ref document: KR

ENP Entry into the national phase

Ref document number: PI0408282

Country of ref document: BR

DPE2 Request for preliminary examination filed before expiration of 19th month from priority date (pct application filed from 20040101)