Patent US3578018A successfully refreshed from Google Patents.
Patent US5870753A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5870753A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for enabling a persistent metastate for objects in an object oriented environment

Assignee: International Business Machines Corp
•
Filing: 1996-03-20
•
Granted: 1999-02-09
•
Expires: 2016-03-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for enabling the maintenance of multiple metastates for a persistent object without increasing the size of the object reference. An object reference data structure is provided in memory and persistent storage to carry a key which contains a universal unique identification (UUID) of an object and other generic common information of the object. A table, maintained by a server process in memory and persistent storage, contains tuples consisting of a key and metastates for persistent objects. A technique is also provided for interacting with the object for the exchange of metastate and the handling of lifecycle issues such as object creation, passivation (removing from memory), reactivation (restoring to memory) and destruction. Additional types of metastates may be added without reimplementation of the server which manages the persistent objects.

Inventors

  • 👤 David Yu Chang
  • 👤 Robert Howard High, Jr.
  • 👤 Russell Ley Newcombe
  • 👤 Ashvin Radiya

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 19:26
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/448; G06F9/4488; G06F9/4493; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932; Y10S707/99941; Y10S707/99943; Y10S707/99944

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 99 words
A method, implemented in a computer system, for accessing a persistent object in an object-oriented persistent storage mechanism in a distributed data processing system, wherein said persistent object has inherited from a plurality of different object classes where each class has a unique persistence mechanism, comprising the steps of: providing a persistent object reference in said distributed data processing system having a key for locating said persistent object; and associating said key with metastate data for a plurality of different persistence mechanisms for said persistent object and storing said key and metastate data in said distributed data processing system.
Claim 2
Independent Claim 99 words
A method, implemented in a computer system, for accessing a persistent object in an object-oriented persistent storage mechanism in a distributed data processing system, wherein said persistent object has inherited from a plurality of different object classes where each class has a unique persistence mechanism, comprising the steps of: providing a persistent object reference in said distributed data processing system having a key for locating said persistent object; and associating said key with metastate data for a plurality of different persistence mechanisms for said persistent object and storing said key and metastate data in said distributed data processing system.
Claim 3
Dependent Claim 46 words
The method of claim 1, wherein the step of associating further includes the step of: creating a tuple for said persistent object by a server in said distributed data processing system, said tuple containing said key and a pointer to a location for said persistent object.
Claim 4
Dependent Claim 49 words
The method of claim 1, wherein the step of providing further comprises the steps of: registering said object as a persistent object with one of a plurality of server processes, and creating said key for the object reference of said persistent object by said one of said server processes.
Claim 5
Dependent Claim 26 words
The method of claim 1, wherein only said key is transmitted in response to a request to locate said persistent object in said data processing system.
Claim 6
Dependent Claim 25 words
The method of claim 1, wherein only said key is transmitted to a single server to locate said persistent object in said data processing system.
Claim 7
Dependent Claim 40 words
The method of claim 1, wherein said key is fixed size and does not change when said persistent object inherits from a plurality of different object classes where each of said plurality of object classes has a unique persistent mechanism.
Claim 8
Dependent Claim 54 words
The method of claim 3, wherein the step of registering said persistent object further comprises the steps of: creating an in-memory object of said persistent object; and manufacturing said key for said persistent object and storing said key as a new entry in a reference data table in said one of said server processes.
Claim 9
Independent Claim 73 words
A method, implemented in a computer, for exchanging metastate data in a distributed data processing system, comprising: providing a base class for a plurality of persistent objects, said base class having a plurality of methods for exchanging said metastate data; and providing a server class in said distributed data processing system for exchanging metastate data with said persistence objects and for manufacturing an object reference for a selected one of said persistent objects.
Claim 10
Independent Claim 73 words
A method, implemented in a computer, for exchanging metastate data in a distributed data processing system, comprising: providing a base class for a plurality of persistent objects, said base class having a plurality of methods for exchanging said metastate data; and providing a server class in said distributed data processing system for exchanging metastate data with said persistence objects and for manufacturing an object reference for a selected one of said persistent objects.
Claim 11
Dependent Claim 17 words
The method of claim 8, wherein said object reference contains a key associated with said metastate data.
Claim 12
Independent Claim 95 words
An apparatus for accessing a persistent object in an object-oriented persistent storage mechanism in a distributed data processing system, wherein said persistent object has inherited from a plurality of different object classes where each class has a unique persistence mechanism, comprising: means for providing a persistent object reference in said distributed data processing system having a key for locating said persistent object; and means for associating said key with metastate data for a plurality of different persistence mechanisms for said persistent object and storing said key and metastate data in said distributed data processing system.
Claim 13
Independent Claim 95 words
An apparatus for accessing a persistent object in an object-oriented persistent storage mechanism in a distributed data processing system, wherein said persistent object has inherited from a plurality of different object classes where each class has a unique persistence mechanism, comprising: means for providing a persistent object reference in said distributed data processing system having a key for locating said persistent object; and means for associating said key with metastate data for a plurality of different persistence mechanisms for said persistent object and storing said key and metastate data in said distributed data processing system.
Claim 14
Dependent Claim 45 words
The apparatus of claim 10, wherein the means for associating further includes: means for creating a tuple for said persistent object by a server in said distributed data processing system, said tuple containing said key and a pointer to a location for said persistent object.
Claim 15
Dependent Claim 50 words
The apparatus of claim 10, wherein the means for providing further comprises: means for registering said object as a persistent object with one of a plurality of server processes, and means for creating said key for the object reference of said persistent object by said one of said server processes.
Claim 16
Dependent Claim 26 words
The apparatus of claim 10, wherein only said key is transmitted in response to a request to locate said persistent object in said data processing system.
Claim 17
Dependent Claim 40 words
The method of claim 10, wherein said key is fixed size and does not change when said persistent object inherits from a plurality of different object classes where each of said plurality of object classes has a unique persistent mechanism.
Claim 18
Dependent Claim 112 words
A computer program product having a computer readable medium having computer program logic recorded thereon for accessing a persistent object in an object-oriented persistent storage mechanism in a distributed data processing system, wherein said persistent object has inherited from a plurality of different object classes where each class has a unique persistence mechanism, comprising: computer readable means for providing a persistent object reference in said distributed data processing system having a key for locating said persistent object; and computer readable means for associating said key with metastate data for a plurality of different persistence mechanisms for said persistent object and storing said key and metastate data in said distributed data processing system.
Claim 19
Dependent Claim 112 words
A computer program product having a computer readable medium having computer program logic recorded thereon for accessing a persistent object in an object-oriented persistent storage mechanism in a distributed data processing system, wherein said persistent object has inherited from a plurality of different object classes where each class has a unique persistence mechanism, comprising: computer readable means for providing a persistent object reference in said distributed data processing system having a key for locating said persistent object; and computer readable means for associating said key with metastate data for a plurality of different persistence mechanisms for said persistent object and storing said key and metastate data in said distributed data processing system.
Claim 20
Dependent Claim 42 words
The computer program of claim 15, comprising: computer readable means for creating a tuple for said persistent object by a server in said distributed data processing system, said tuple containing said key and a pointer to a location for said persistent object.
Claim 21
Dependent Claim 49 words
The computer program of claim 15, comprising: computer readable means for registering said object as a persistent object with one of a plurality of server processes, and computer readable means for creating said key for the object reference of said persistent object by said one of said server processes.
Claim 22
Dependent Claim 27 words
The computer program of claim 15, wherein only said key is transmitted in response to a request to locate said persistent object in said data processing system.

References Cited (Backward Citations)

US4853842A Cited
US5247669A Cited
US5437027A Cited
US5291593A Cited
US5295256A Cited
US5613099A Cited
US5640546A Cited
US5613124A Cited
US5664182A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag