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

Data processing system for data base management of matrix type data

Assignee: Fujitsu Ltd
•
Filing: 1982-03-26
•
Granted: 1985-11-26
•
Expires: 2002-03-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A data base management system of a data processing system handles a hierarchical structure model. Matrix type data, considered as having different hierarchical structure in accordance with the application, is effectively handled by storing in the form of one-dimensional data in a file device and making up the desired hierarchical structure when used. This is accomplished by providing first order address information and designating a scheme code which defines the desired hierarchical structure when the data is utilized by a user.

Inventors

  • 👤 Katsumi Hayashi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 01:44
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0207; G06F16/00; G06F16/90; G06F16/901; G06F16/9024; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99941; Y10S707/99942

Claims Analysis

Total Claims: 2
Claim 1
Independent Claim 390 words
A data processing system for data base management comprising file means for storing n-dimensional matrix type data on tha basis of one-dimensional address information, said one-dimensional address information having a value equal to (a1-1)A2A3 . . . An+(a2-1)A3A4 . . . An+. . . +(a (n-1)-1)An+an, wherein a1, a2 . . . an is the n-dimensional coordinate and A1, A2 . . . An is the coordinate axis; n-coordinate axes for respectively storing the maximum value of each coordinate axis of an n-dimensional coordinate; scheme code storage means for storing a code designating any n-hierarchical scheme wherein each of n hierarchies is selected as desired from n coordinates, said n-hierarchical scheme being a single scheme having n hierarchies; n address storage means, each corresponding to a hierarchy of a specific n-hierarchical scheme and each for storing an address indicating an ordinal number in a specific set in the corresponding hierarchy, n being an integer at least equal to 2; selecting means connected to said address storage means for selecting a desired one of said address storage means and updating the contents thereof; updating means connected to said selecting means for updating the contents of the selected address storage means; and calculating means including a converter means including a converter means, said converter means connected to said n-coordinate axes, said scheme code storage means, said address storage means and said selecting means for calculating the one-dimensional address from the contents of said address storage means, the contents of said scheme code storage means and the contents of said n-coordinate axes, said file means being connected to said calculating means and being accessed by the one-dimensional address output from said calculating means, said converter means providing correspondence between the contents of said selected one of said address storage means and said n-dimensional coordinate in accordance with the contents of said scheme code storage means said converter means including a decoder, responsive to input scheme code signals, for providing different outputs of said converter means for the same inputs from said n-coordinate-axes, said converter means providing an output, and linear expander means for executing operation of said one-dimensional address information value in accordance with the output of said converter means and the contents of said n-coordinate axes, said linear expander means connected to said n-coordinate axes, said selecting means, and said converter means.
Claim 2
Dependent Claim 390 words
A data processing system for data base management comprising file means for storing n-dimensional matrix type data on tha basis of one-dimensional address information, said one-dimensional address information having a value equal to (a1-1)A2A3 . . . An+(a2-1)A3A4 . . . An+. . . +(a (n-1)-1)An+an, wherein a1, a2 . . . an is the n-dimensional coordinate and A1, A2 . . . An is the coordinate axis; n-coordinate axes for respectively storing the maximum value of each coordinate axis of an n-dimensional coordinate; scheme code storage means for storing a code designating any n-hierarchical scheme wherein each of n hierarchies is selected as desired from n coordinates, said n-hierarchical scheme being a single scheme having n hierarchies; n address storage means, each corresponding to a hierarchy of a specific n-hierarchical scheme and each for storing an address indicating an ordinal number in a specific set in the corresponding hierarchy, n being an integer at least equal to 2; selecting means connected to said address storage means for selecting a desired one of said address storage means and updating the contents thereof; updating means connected to said selecting means for updating the contents of the selected address storage means; and calculating means including a converter means including a converter means, said converter means connected to said n-coordinate axes, said scheme code storage means, said address storage means and said selecting means for calculating the one-dimensional address from the contents of said address storage means, the contents of said scheme code storage means and the contents of said n-coordinate axes, said file means being connected to said calculating means and being accessed by the one-dimensional address output from said calculating means, said converter means providing correspondence between the contents of said selected one of said address storage means and said n-dimensional coordinate in accordance with the contents of said scheme code storage means said converter means including a decoder, responsive to input scheme code signals, for providing different outputs of said converter means for the same inputs from said n-coordinate-axes, said converter means providing an output, and linear expander means for executing operation of said one-dimensional address information value in accordance with the output of said converter means and the contents of said n-coordinate axes, said linear expander means connected to said n-coordinate axes, said selecting means, and said converter means.

References Cited (Backward Citations)

US3461433A Cited
US4025901A Cited
US4042914A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1988-11-25 1989-05-27 1989-11-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1992-11-25 1993-05-27 1993-11-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1996-11-25 1997-05-27 1997-11-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag