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

Method and distributed database file system for implementing self-describing distributed file objects

Assignee: International Business Machines Corp
•
Filing: 1996-06-17
•
Granted: 1998-06-16
•
Expires: 2016-06-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus are provided for implementing self-describing file objects. A node group is created for defining multiple computer systems for storing data. A hash algorithm for applying to data records is identified. A partition distribution map for distributing data to each of the multiple computer systems utilizing a set of predetermined hash algorithm results and remote system information for each of the multiple computer systems are identified. A file object is created in each of the multiple computer systems. Each the file objects includes the hash algorithm, the partition distribution map, and the remote system information. A data record is inserted into one of the distributed file objects by receiving the data record, applying the hash algorithm to the received data record, comparing the hash algorithm result with the partition distribution map to identify the particular computer system for the data record, utilizing the system information to establish connection to that system. The file objects are fully self-describing, eliminating the need for additional objects to be addressed, opened, paged into memory or the like.

Inventors

  • 👤 Mark Gregory Megerian

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 23:43
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9014; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99944; Y10S707/99945; Y10S707/99948

Claims Analysis

Total Claims: 19
Claim 1
Independent Claim 97 words
A method for implementing self-describing file objects comprising the steps of: creating a node group to define multiple computer systems for storing the file object; identifying a hash algorithm for applying to data records; identifying a partition distribution map for distributing data to each of said multiple computer systems utilizing a set of predetermined hash algorithm results; identifying remote system information for each of said multiple computer systems; and creating a file object in each of said multiple computer systems; each said file object including said hash algorithm, said partition distribution map, and said remote system information.
Claim 2
Independent Claim 97 words
A method for implementing self-describing file objects comprising the steps of: creating a node group to define multiple computer systems for storing the file object; identifying a hash algorithm for applying to data records; identifying a partition distribution map for distributing data to each of said multiple computer systems utilizing a set of predetermined hash algorithm results; identifying remote system information for each of said multiple computer systems; and creating a file object in each of said multiple computer systems; each said file object including said hash algorithm, said partition distribution map, and said remote system information.
Claim 3
Dependent Claim 67 words
A method for implementing self-describing file objects as recited in claim 1 wherein said step of creating a file object in each of said multiple computer systems; each said file object including said hash algorithm, said partition distribution map, and said remote system information includes the steps of establishing a connection to each remote computer system and storing said file object in each said remote computer system.
Claim 4
Dependent Claim 52 words
A method for implementing self-describing file objects as recited in claim 1 wherein said step of identifying said partition distribution map includes the steps of utilizing a set of possible hash values for said identified hash algorithm and providing an equal distribution of said possible hash values to said multiple computer systems.
Claim 5
Dependent Claim 53 words
A method for implementing self-describing file objects as recited in claim 1 wherein said step of identifying said partition distribution map includes the steps of utilizing a set of possible hash values for said identified hash algorithm and providing a user selected distribution of said possible hash values to said multiple computer systems.
Claim 6
Dependent Claim 69 words
A method for implementing self-describing file objects as recited in claim 1 further includes the steps of receiving a data record; applying said hash algorithm to said received data record to generate a hash algorithm result; comparing said hash algorithm result with said partition distribution map to identify one of said multiple computer systems; and inserting said received data record into said file object of said identified computer system.
Claim 7
Dependent Claim 29 words
A method for implementing self-describing file objects as recited in claim 5 includes the step of establishing a connection to said identified computer system utilizing said remote system information.
Claim 8
Dependent Claim 101 words
Apparatus for implementing self-describing file objects comprising: means for creating a node group to define multiple computer systems for storing the file object; identifying a hash algorithm for applying to data records; means for identifying a partition distribution map for distributing data to each of said multiple computer systems utilizing a set of predetermined hash algorithm results; means for identifying remote system information for each of said multiple computer systems; and means for creating a file object in each of said multiple computer systems; each said file object including said hash algorithm, said partition distribution map, and said remote system information.
Claim 9
Dependent Claim 101 words
Apparatus for implementing self-describing file objects comprising: means for creating a node group to define multiple computer systems for storing the file object; identifying a hash algorithm for applying to data records; means for identifying a partition distribution map for distributing data to each of said multiple computer systems utilizing a set of predetermined hash algorithm results; means for identifying remote system information for each of said multiple computer systems; and means for creating a file object in each of said multiple computer systems; each said file object including said hash algorithm, said partition distribution map, and said remote system information.
Claim 10
Dependent Claim 51 words
Apparatus for implementing self-describing file objects as recited in claim 7 wherein said means for means for creating said file object in each of said multiple computer systems includes means for establishing a connection to each remote computer system and for storing said file object in each said remote computer system.
Claim 11
Dependent Claim 58 words
Apparatus for implementing self-describing file objects as recited in claim 7 further includes means for receiving user selections and wherein said means for identifying said partition distribution map for distributing data to each of said multiple computer systems utilizing said set of predetermined hash algorithm results is responsive to said user selections to define said partition distribution map.
Claim 12
Dependent Claim 55 words
Apparatus for implementing self-describing file objects as recited in claim 7 wherein said means for identifying said partition distribution map for distributing data to each of said multiple computer systems utilizing said set of predetermined hash algorithm results includes means for providing an equal distribution of said predetermined hash values to said multiple computer systems.
Claim 13
Dependent Claim 56 words
Apparatus for implementing self-describing file objects as recited in claim 7 further includes means for receiving a data record; means for applying said hash algorithm to said received data record to generate a hash algorithm result; means for comparing said hash algorithm result with said partition distribution map to identify one of said multiple computer systems.
Claim 14
Dependent Claim 29 words
Apparatus for implementing self-describing file objects as recited in claim 11 further includes means for inserting said received data record into said file object of said identified computer system.
Claim 15
Dependent Claim 48 words
Apparatus for implementing self-describing file objects as recited in claim 11 further includes means for identifying a remote computer system, means for establishing a connection to said remote computer system and means for inserting said received data record into said file object of said identified remote computer system.
Claim 16
Dependent Claim 152 words
A computer program product for use in a multiple computer system, each computer system having a processor, a memory, and a network adapter, the computer program product comprising: a record medium; means, recorded on said recording medium, for creating a node group to define multiple computer systems for storing the file object; means, recorded on said recording medium, for identifying a hash algorithm for applying to data records; means, recorded on said recording medium, for identifying a partition distribution map for distributing data to each of said multiple computer systems utilizing a set of predetermined hash algorithm results; means, recorded on said recording medium, for identifying remote system information for each of said multiple computer systems; and means, recorded on said recording medium, for creating a file object in each of said multiple computer systems; each said file object including said hash algorithm, said partition distribution map, and said remote system information.
Claim 17
Dependent Claim 152 words
A computer program product for use in a multiple computer system, each computer system having a processor, a memory, and a network adapter, the computer program product comprising: a record medium; means, recorded on said recording medium, for creating a node group to define multiple computer systems for storing the file object; means, recorded on said recording medium, for identifying a hash algorithm for applying to data records; means, recorded on said recording medium, for identifying a partition distribution map for distributing data to each of said multiple computer systems utilizing a set of predetermined hash algorithm results; means, recorded on said recording medium, for identifying remote system information for each of said multiple computer systems; and means, recorded on said recording medium, for creating a file object in each of said multiple computer systems; each said file object including said hash algorithm, said partition distribution map, and said remote system information.
Claim 18
Dependent Claim 58 words
A computer program product as recited in claim 14 wherein said means, recorded on said recording medium, for creating said file object in each of said multiple computer systems includes means, recorded on said recording medium, for establishing a connection to each remote computer system and, for storing said file object in each of said multiple computer systems.
Claim 19
Dependent Claim 90 words
A computer program product as recited in claim 14 further includes means, recorded on said recording medium, for receiving a data record; means, recorded on said recording medium, for applying said hash algorithm to said received data record to generate a hash algorithm result; means, recorded on said recording medium, for comparing said hash algorithm result with said partition distribution map to identify one of said multiple computer systems; and means, recorded on said recording medium, for inserting said data record into said file object of said identified computer system.

References Cited (Backward Citations)

US5301337A Cited
US5381534A Cited
EP0522488A2 Cited
US5371675A Cited
US5581760A Cited
US5551027A Cited
US5701462A Cited
US5687363A Cited
WO1996007149A1 Cited
US5542078A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-06-15 2001-12-15 2002-06-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-06-15 2005-12-15 2006-06-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-06-15 2009-12-15 2010-06-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag