A system for implementing a messenger and object manager in an object oriented programming environment on a data processor containing a memory, in which objects are categorized into one or more classes which define methods of the objects categorized therein, and in which messages are sent by the data processor to objects to perform actions thereon. The system includes a message call processing procedure operating on the data processor for processing message calls to instances, including a method resolution segment for calling a loaded classes table to determine whether the class corresponding to a method of the instance is loaded, where the method corresponds to the action requested by the message. If the corresponding class is not loaded in main memory, then the system dynamically loads the class. A data resolution segment calls an object management table to resolve an indirection pointer which points to the address of a data frame corresponding to the instance.

The invention is directed to a computer implemented system and apparatus for transforming objects in a first data model (source design objects) to objects in a second data model (target design objects) and synchronizing the two data models. The result of the transformation is that at least one of the target design objects is associated with a corresponding source design object. The system associates a unique identifier with each of the target design objects and source design objects, the unique identifier being associated with each map associated with each design object.

Object-oriented software-based systems may be optimized by providing a data representation which is initially permitted to be completely dynamic such that at compile time representation need not be specified and thereafter the data structure and representation is progressively optimized. The invention is based on the recognition that the important data structures in object-oriented systems are not the objects but rather the slots, i.e., the attributes of objects.

A logical type language data processing method which includes making a plurality of different application programs each using a predicate type fact database and/or a predicate type rule database; inputting a predicate type question with respect to the application programs to process data by unification and back tracking processes; making and storing a common predicate type fact database which is used commonly by the different application programs; putting a symbol to predicates of the different application programs to indicate that the predicates with the symbol are common type predicates which should use the common predicate type fact database; and accessing the common predicate type fact database if any of the predicates with the symbols is read out during execution of the application programs.

In a database system for map information, matching and retrieving operations are carried out between an attribute database associated with a business and a map database. A matching key word is separated into a common noun part and a proper noun part, a synonym and an abbreviated word are inferred by employing rules respectively. Furthermore, a candidate key word is inferred by employment of a rule for combining these results at an optimum state, whereby a matching process is performed. Another address database is employed so as to realize a mutual retrieving operation even when the attribute database is not matched with the map database.