Fast determination of subtype relationship in a single inheritan

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1518

Patent

active

052673499

ABSTRACT:
A system and method for quickly determining whether a requested object is an ancestor of a particular object where both objects are contained in a single inheritance type hierarchy. The system encodes each object in memory with a binary pattern that indicates the ancestry of the object and a mask which indicates which bits of the binary pattern are significant for determining ancestry. This allows a system, upon receiving a request for an object, to determine in only two steps whether any particular object in memory can satisfy the request as a sub-type of the requested object.

REFERENCES:
patent: 4506325 (1985-03-01), Bennett et al.
Aho, A. V., et al, Compilers Principles, Techniques, and Tools, Addison-Wesley, 1986, pp. 352-355.
Tanenbaum, A. S., Structured Computer Organization, Prentice-Hall, 1984, pp. 235-240.
Date, C. J., An Introduction to Database Systems, vol. I. 4th Ed., Addison-Wesley, 1986, pp. 75-80.
Walker, A., et al, Knowledge Systems and Prolog, Addison-Wesley, 1987, pp. 339-341.
Forgy, C. L., "Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem", Artificial Intelligence, 19, 1982 pp. 17-37.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Fast determination of subtype relationship in a single inheritan does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast determination of subtype relationship in a single inheritan, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast determination of subtype relationship in a single inheritan will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2104506

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.