AU2004219257A1 - System and method for storing and accessing data in an interlocking trees datastore - Google Patents

System and method for storing and accessing data in an interlocking trees datastore Download PDF

Info

Publication number
AU2004219257A1
AU2004219257A1 AU2004219257A AU2004219257A AU2004219257A1 AU 2004219257 A1 AU2004219257 A1 AU 2004219257A1 AU 2004219257 A AU2004219257 A AU 2004219257A AU 2004219257 A AU2004219257 A AU 2004219257A AU 2004219257 A1 AU2004219257 A1 AU 2004219257A1
Authority
AU
Australia
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.)
Abandoned
Application number
AU2004219257A
Other languages
English (en)
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 AU2004219257A1 publication Critical patent/AU2004219257A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • 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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/40Data 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)
AU2004219257A 2003-03-10 2004-02-27 System and method for storing and accessing data in an interlocking trees datastore Abandoned AU2004219257A1 (en)

Applications Claiming Priority (5)

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 US7158975B2 (en) 2003-03-10 2003-09-19 System and method for storing and accessing data in an interlocking trees datastore
US10/666,382 2003-09-19
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 (1)

Publication Number Publication Date
AU2004219257A1 true AU2004219257A1 (en) 2004-09-23

Family

ID=32993817

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2004219257A Abandoned AU2004219257A1 (en) 2003-03-10 2004-02-27 System and method for storing and accessing data in an interlocking trees datastore

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

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU1948299A (en) * 1997-12-29 1999-07-19 Infodream Corporation 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
US6477683B1 (en) * 1999-02-05 2002-11-05 Tensilica, Inc. Automated processor generation system for designing a configurable processor and method for the same
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

Also Published As

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

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
CA2486657A1 (fr) Procede d'organisation et d'interrogation de bases de donnees genomiques et proteomiques
AU2004219257A1 (en) System and method for storing and accessing data in an interlocking trees datastore
Yu et al. Simple QSF-trees: An efficient and scalable spatial access method
US7996425B1 (en) Storing element-based descriptions of documents in a database
Usmani et al. DNA-Based Storage of RDF Graph Data: A Futuristic Approach to Data Analytics
Yang et al. The rd-tree: a structure for processing partial-max/min queries in olap
Kurtz et al. Computational biology
Strate et al. Index Storage Fundamentals
Carlson et al. The RDB: A parallel, spatial database for the IES/BTI system

Legal Events

Date Code Title Description
MK4 Application lapsed section 142(2)(d) - no continuation fee paid for the application