← Back to Patent Explorer
US5873087A Expired / Lapsed US ⏱️ 0.0 years remaining

Computer system for storing data in hierarchical manner

Assignee: International Business Machines Corp
•
Filing: 1992-07-17
•
Granted: 1999-02-16
•
Expires: 2012-07-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention concerns a computer system for data administration, wherein a number of data fields are stored in a memory. The data fields are subdivided into data segments. For each data segment, the associated structural and ordering information is stored in the memory. The structural information serves to describe the type of data segment. The structural information is also used to define the path from the location of the data segment within an associated structure tree to its root. The ordering information serves to determine the order of the data segment within a data field. By storing in particular the structural information, it is possible to use that information for queries. The structural information may also be used for indexing. As a result, the speed of the query process is substantially increased.

Inventors

  • 👤 Volkert Brosda
  • 👤 Volker Obermeit

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 21:59
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/30; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99942; Y10S707/99943; Y10S707/99944; Y10S707/99945

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 120 words
A computer system for storing a multiplicity of dictionary entries, said system comprising: a memory; a group of data structures stored in said memory for each of said dictionary entries, each of said data structures in each group comprising a root entry common for said group, a data segment entry for data, a label entry which indicates a type of said data and is a node in a label entry hierarchy, and a label sequence entry indicating a path of label entries in said label entry hierarchy between the label entry of said each data structure and said root entry, some of said data segments in each group collectively forming a word definition; and means for searching said data structures.
Claim 2
Dependent Claim 120 words
A computer system for storing a multiplicity of dictionary entries, said system comprising: a memory; a group of data structures stored in said memory for each of said dictionary entries, each of said data structures in each group comprising a root entry common for said group, a data segment entry for data, a label entry which indicates a type of said data and is a node in a label entry hierarchy, and a label sequence entry indicating a path of label entries in said label entry hierarchy between the label entry of said each data structure and said root entry, some of said data segments in each group collectively forming a word definition; and means for searching said data structures.
Claim 3
Dependent Claim 51 words
A computer system as set forth in claim 1 wherein the label sequence entries for two of the data structures in the same group are the same as each other, and each of said two data structures further comprises a path entry which distinguishes said same sequence entries from each other.
Claim 4
Dependent Claim 53 words
A system as set forth in claim 1 wherein said hierarchy comprises a main form label entry in a level, a lemmatized form label entry in a lower level descending from said main form label entry, and a grammatical detail label entry in said lower level descending from said main form label entry.
Claim 5
Dependent Claim 31 words
A system as set forth in claim 3 wherein said hierarchy further comprises a type of word label entry in a still lower level descending from said grammatical detail label entry.
Claim 6
Dependent Claim 22 words
A system as set forth in claim 4 wherein one of the data segments descends from said type of word label entry.
Claim 7
Dependent Claim 74 words
A computer system as set forth in claim 1 wherein said hierarchy comprises a semantic subdivision of a first category label entry in a level, a numerical information for said semantic subdivision of said first category label entry in a lower level descending from said semantic subdivision of said first category label entry, and a grammatical detail label entry in said lower level descending from said semantic subdivision of said first category label entry.
Claim 8
Dependent Claim 31 words
A computer system as set forth in claim 6 wherein said hierarchy further comprises an auxiliary verb label entry in a still lower level descending from said grammatical detail label entry.
Claim 9
Dependent Claim 38 words
A computer system as set forth in claim 6 wherein said hierarchy further comprises a semantic subdivision of a second category label entry in said lower level descending from said semantic subdivision of said first category label entry.
Claim 10
Dependent Claim 43 words
A computer system as set forth in claim 8 wherein said hierarchy further comprises a numerical information for said semantic subdivision of said second category label entry in a still lower level descending from said semantic subdivision of a second category label entry.
Claim 11
Dependent Claim 35 words
A computer system as set forth in claim 9 wherein said hierarchy further comprises a semantic information label entry in said still lower level descending from said semantic subdivision of said second category label entry.
Claim 12
Dependent Claim 50 words
A computer system as set forth in claim 1 wherein said hierarchy comprises a semantic subdivision of a category label entry in a level, a numerical information for said semantic subdivision of said category label entry in a lower level descending from said semantic subdivision of a category label entry.
Claim 13
Dependent Claim 33 words
A computer system as set forth in claim 11 wherein said hierarchy further comprises a semantic information label entry in said lower level descending from said semantic subdivision of a category label entry.
Claim 14
Dependent Claim 32 words
A computer system as set forth in claim 12 wherein said hierarchy further comprises an example label entry in said lower level descending from said semantic subdivision of a category label entry.
Claim 15
Dependent Claim 20 words
A computer system as set forth in claim 13 wherein data segments descend from label entries of said lower level.
Claim 16
Dependent Claim 37 words
A system as set forth in claim 1 wherein said hierarchy comprises a main form label entry in a level and a grammatical detail label entry in a lower level descending from said main form label entry.
Claim 17
Dependent Claim 31 words
A system as set forth in claim 15 wherein said hierarchy further comprises a type of word label entry in a still lower level descending from said grammatical detail label entry.
Claim 18
Dependent Claim 38 words
A system as set forth in claim 1 wherein said hierarchy comprises a grammatical detail label entry in a level and a type of word label entry in a lower level descending from said grammatical detail label entry.
Claim 19
Dependent Claim 132 words
A computer implemented method for storing and searching a multiplicity of dictionary entries, said method comprising the steps of: storing in a memory a group of data structures for each of said dictionary entries, each of said data structures in each group comprising a root entry common for said group, a data segment entry for data, a label entry which indicates a type of said data and is a node in a label entry hierarchy, and a sequence entry indicating a path of label entries in said label entry hierarchy between the label entry of said each data structure and said root entry, some of said data segments in each group collectively forming a word definition; and searching through said memory for a specified combination of data segment and respective label entry.
Claim 20
Dependent Claim 132 words
A computer implemented method for storing and searching a multiplicity of dictionary entries, said method comprising the steps of: storing in a memory a group of data structures for each of said dictionary entries, each of said data structures in each group comprising a root entry common for said group, a data segment entry for data, a label entry which indicates a type of said data and is a node in a label entry hierarchy, and a sequence entry indicating a path of label entries in said label entry hierarchy between the label entry of said each data structure and said root entry, some of said data segments in each group collectively forming a word definition; and searching through said memory for a specified combination of data segment and respective label entry.

References Cited (Backward Citations)

US4481577A Cited
US4606002A Cited
US4677550A Cited
US4893232A Cited
EP0309798A2 Cited
US5060155A Cited
US5274806A Cited
US5295261A Cited
US5303367A Cited
US5247666A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-02-15 2002-08-17 2003-02-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-02-15 2006-08-17 2007-02-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-02-15 2010-08-17 2011-02-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag