Abstract: The present invention is a method for extracting and generating hierarchical specification information in which the derivative of data included in already-developed software is hierarchically related and the reusability of data which is stored together with a relating procedure is high. In the method of the present invention, an existing program is analyzed and a data item and a procedure are extracted, and a procedure relating to a data item is stored in relation to the data item, and data items sharing a used area, data items for transferring data, or comparison items are stored as similar items in relation to each other, and key items are selected from the similar items, and a hierarchical specification in which the selected key items are set is generated, and dependent data items are selected from a record having the data items related to the key items, and the selected data items are added as attribute data of the hierarchical specification.

Abstract: A computer system for creating and managing a database of communication recipients which processes queries and otherwise operates in accordance with user commands to perform telemarketing, mass mailing, direct mailing and other communication functions. The computer is programmed to create automatic salutations, to automatically generate lists of carbon copy recipients, and to export data from the database to word processing systems for merging with text. In addition, the computer is programmed to analyze new records to ensure they are not duplicates of existing records. A user is provided with options to keep one or both records, or to combine both records into a new record. The computer is programmed to retrieve records on the basis of queries using one or more defined codes which can be ANDed and ORed together in accordance with Boolean logic, among other functions.

Abstract: A backup method for a computer database system comprising maintaining a mirrored copy of the database at a remote location is characterized in that updates to the remote database data are delayed for a delay time greater than or equal to the upper limit on the data communication delay between the local location and the remote location and updates to a remote log for the database are executed after corresponding updates to a local log without said delay. In this way a consistent copy of the database may be recovered from the mirrored copy of the database and the remote log after destruction of the database system.

Abstract: Unique data block identifiers are assigned to the entire data block group of plural external memory devices. The file management information stores, in a table format, the unique data block identifiers in connection with a file held in the data block group. When a file management process is executed in accordance with the operation type (access, addition, registration, deletion) of file management, the file management information is referred to. Furthermore, a data block group management process is called and the operation is performed. When a data block shift process is executed, the data block group management process is called and the contents of the data block are shifted between external memory device based on the file management information. When the file management process or the data block shift process is executed, data stored in the file management information is rewritten on an as-needed basis.

Abstract: The purpose of the present invention is to provide a graphical user interface which enables to show with graphs, as in FIG. 1, the quantity of and the logical relation between the sets of the database retrieved, to calculate and manipulate the sets by pointing the area of the rectangular shapes of the graphs, and to extract the data by pointing the area of the rectangular shapes of the graphs. The program of the present invention communicates with the database query language program through message exchanges between the programs or message exchanges at the terminal systems connected with the communication network, generates the retrieval instructions of the query language program by way of set creating, set drawing, set selection, set projection, and set extraction, and performs the input operation in place of the user. The present invention facilitates simple retrieval processing and supports logical thinking of the user to evaluate and judge the quantity of the set and the relation between the sets.

Abstract: Computerized tools for modeling database designs and specifying queries of the data contained therein. Once it is determined that an information system needs to be created, the Fact Compiler of the present invention is invoked to create it. After creating the information system, the user creates a fact-tree as a prelude to generating queries to the system. After creating the fact-tree, the user verifies that it is correct using the Tree Interpreter of the present invention. Once the fact tree has been verified, the Query Mapper of the present invention is used to generate information system queries.

Abstract: The computer system disclosed herein provides an aggregated directory facility which can encompass the file contents of a large number of high capacity storage devices such as CD ROMS and which enables a user to deal those files as though they were in a single physical volume. An age based caching system facilitates access to the most frequently used portions of the aggregated directory.

Abstract: A replication facility provides for the replication of files or portions of files in a distributed environment. The replication facility is able to replicate any subtree within a distributed namespace of the distributed environment. The replication facility provides multi-mastered, weakly consistent replication. The replication facility supports both public replication and private replication.

Abstract: The method of the present invention is useful in a computer system having a user interface, a memory, a repository and a database. The method is a repository program executed by the computer system for maintaining a history of objects stored in the repository. The method comprises the steps of determining if the object is a new logical object, and if so constructing a new versioned object; and, if not retrieving from the repository an object on which a new state is to be based. If the new state is being derived from only one object, then reserving the object. If the state is being derived from two objects, then retrieving from the repository the other object on which the new state is based, and merging the two objects. If the state changes are to be retained, then replacing the object; and, if the state changes are not to be retained, then unreserving the object.

Abstract: The present invention provides client-selected consistency guarantees to clients of a weakly consistent replicated database on a per "session" basis. The clients have access to utilities which allow the clients to, individually or collectively, define a "session" over which the selected guarantees are enforced. A "session" is broadly defined as a sequence of logically related Reads and Writes to the database. Sessions are initiated and terminated substantially independently of other sessions which may exist concurrently. Clients are allowed, however, to clone sessions and/or merge sessions with other clients. Clients select a minimum relevant subset of guarantees from among a set of pre-defined consistency guarantees, where "relevancy" is a client determined factor. At any given time, the system may be enforcing a number of different combinations of consistency guarantees.

Abstract: An operating system provides a common name space for both long filenames and short filenames. In this common namespace, a long filename and a short filename are provided for each file. Each file has a short filename directory entry and may have at least one long filename directory entry associated with it. The number of long filename directory entries that are associated with a file depends on the number of characters in the long filename of the file. The long filename directory entries are configured to minimize compatibility problems with existing installed program bases.

Abstract: A macro-system which includes at least one portable computer and at least one stationary computer. The stationary computer includes a docking bay into which the portable computer is physically inserted whenever the user has returned with it to his primary work area. This docking station includes contact probes which automatically make contact to a small number of contacts on the back of the portable computer whenever it is stuffed into the docking station. The portable computer preferably includes soft power switch logic, so that an activation signal, received when the portable computer is docked, can be used to wake up the portable computer and bring it up active in a slave operating mode. Appropriate software routines can then be triggered to maintain file coherency.

Abstract: A method for storing a set of files on a multiple volume media set supports the ISO/IEC 13346 standard for optical media while minimizing swapping and temporary storage requirements when the multiple volume media set is used in an optical disk autochanger. The method allows the media set (e.g., optical disks) to be self-describing in accordance with the ISO/IEC 13346 standard. However, when the media set is on-line, the meta-data is separated from the data to optimize on-line performance. The method sequentializes the meta-data of the file set before writing it to the media set to achieve these advantages.

Abstract: An information retrieval system incorporates an extensible query architecture allowing an applications programmer to integrate new query models into the system as desired. The query architecture is based on an abstract base class of query nodes, or code objects that retrieve records from the database. Specific subclasses for particular query models are derived from the base class. Each query node class includes a search function that iteratively searches the database for matching records. Query node objects are instantiated by associated node creator class objects. A parser is used to parse a search query into its components, including nested search queries used to combine various query models. The parser determines the particular search operator keywords, and the node creator object for instantiating the appropriate query node object for each search operator.

Abstract: The mass storage system functions to archive, store, retrieve and manage the plurality of data files that comprise a typical file-system as a single uninterpreted bitfile. Client data processors access this file-system on a shared, channel-attached direct access storage device the same as if the file-system was located on a directly attached direct access storage device belonging exclusively to the client data processor. The direct access storage devices, archival storage devices and the client data processors which move the file-system bitfile between archival storage devices, direct access storage devices for access by the client data processors.

Abstract: A mechanism and a method for integrating first data created by a first application program and residing in a first data object belonging to the first application into a second data object where the first data is result data generated by operation of the first application program upon source data of the first application program. A computer system includes an integrated operating environment. A user creates and stores a script identifying the source data and directing the operation of the application program to generate the result data from the source data and inserts a reference to the script in the second data object, wherein the reference identifies the script, the application program and an operation of the application program to execute the script.

Abstract: In a computer system having a user interface, a memory and a database, a repository program operating in the computer system for accessing the database, the repository program executing a method for treating a group of objects as a single object. This method comprises the steps of retrieving a collection of references for a type from the repository; sorting out each reference in the collection of references that are composite references and have a versioned object type; for each sorted reference, retrieving objects from the reference; and calling up current operations for each retrieved object.

Abstract: Schema deriving module 1 generates a relational schema 6 from a subschema 5, in accordance with a unique declarative statement 4 to the effect that the combination of items of parent-descendant records in a network type data base 10 becomes unique in the network type data base 10. Unique declaration module 11 adds columns corresponding to the items designated in the unique declarative statement 4 to the applicable table definitions in the relational schema 6, and adds the contents of the unique declarative statement 4 as unique definition information. SQL statement translating module 2, when translating an SQL statement 7, according to the unique definition information in the relational schema 6, interprets it as an access to set a table combination, and generates a DML object designating an access route.

Abstract: A distributed program configuration database system is designed for use on a client-server network. The system consists of a plurality of program servers which maintain version information for various program components. A program developer, upon logging into a client terminal on the network, establishes a workspace or project and connects with one of the servers. After connection to the server has been made, a draft of the program configuration is retrieved from the server. The configuration draft may include information for constructing some of the program components and "bridge" information identifying other program servers where additional program components are located. The workspace uses the component information to assemble components and the bridge information to connect to other servers and retrieve the remaining components in order to assemble the complete source code for a program in the workspace.

Abstract: A method for indexing electronic handwritten documents is provided. Each document includes a plurality of output symbols in an output sequence, and is modeled by a respective Hidden Markov Model (HMM). The HMMs share a common alphabet and a common sequence length. A tree is established, having linked nodes stored in a memory. Each node has n pointers, each identifying a different node in the next level of the tree. Each path from the root to a different one of the leaf nodes defines a respective sequence of pointers. An indexing procedure is performed, for each of a subset of the nodes in one of the levels of the tree.