Abstract: A method and system for providing computer-network related information about a calling party. First, the called party receives a telephone number of a calling party. The called party's customer premises equipment (CPE) or elements in a telephone network then use the telephone number to index a database, which contains combinations of telephone numbers and computer-network addresses. Once the calling party's computer-network address is retrieved, calling-party-customized information present at the computer-network location specified by the computer-network address can be sent to and displayed on the called party's CPE. Also, the calling party's telephone number can be sent to an application in the computer network, causing the calling-party-customized information to be automatically displayed on the called party's CPE.

Abstract: This invention concerns a database computer system and method for making applications recoverable from system crashes. The application state (i.e., address space) is treated as a single object which can be atomically flushed in a manner akin to flushing individual pages in database recovery techniques. To enable this monolithic treatment of the application, executions performed by the application are mapped to logical loggable operations which can be posted to the stable log. Any modifications to the application state are accumulated and the application state is flushed from time to time to stable storage using an atomic procedure. Applications are recovered by replaying the logged state transition operations, in the same manner that most database systems replay state transformation operations to recover database pages. This application recovery integrates with database recovery, and effectively eliminates or at least substantially reduces the need for check pointing applications.

Abstract: A system and a method for locating and deleting computer files stored in a directory structure in a mass storage device. The method includes the steps of receiving an input and establishing a starting directory and a file search specification. The method further includes storing directory names corresponding to all directories of the directory structure in a directory array and storing file names corresponding to all files of the directory structure that meet the file search specification in a file delete array. Finally, the method includes deleting the files associated with the file names stored in the file delete array. The system may be configured by a computer readable memory to perform the method.

Abstract: A copy utility for non-stop database applications allows users to continuously access a database which is undergoing back-up operations. The system includes a lock manager which controls the access of requesters to the files of the database. The back-up storage device is treated in the same manner as other requesters.

Abstract: A method, apparatus, and article of manufacture for using a relational database management system to support on-line analytical processing (OLAP) systems. A multi-dimensional database is represented as a relational schema in the relational database. The multi-dimensional database has one or more dimensions having one or more members. Each value in the multi-dimensional database is identified by the intersection of one member from each dimension. The relational schema includes a fact table and related dimension tables. The fact table has a dimension column for all but one of the dimensions of the multi-dimensional database and a value column for each member of the remaining dimension. The fact table has at least one row that contains the values corresponding to the intersection of the members identified by the dimension columns and the members associated with the value columns. Each dimension table has a row for each member of a dimension.

Abstract: A plurality of compressed data obtained by information-compressing a plurality of data by a discrete cosine transform (DCT) are stored in a main image file. When a retrieval instruction is applied, data serving as a data retrieval key is extracted from an image database, and the extracted data is DCT-compressed by a compression processing unit. Using DC components of the resultant compressed data, reference data are generated. A search unit collates the reference data with the DC component data of the compressed data stored in the main image file and extracts data on the basis of this collation result. With this arrangement, in retrieving desired data from a plurality of data groups stored in the information-compressed state, data collation processing can be performed in the information-compressed state.

Abstract: In a distributed data base system, different parts of the data base are handled by each of a number of interconnected processors. The different data base parts contain a number of data entities. There are provided for each of such data entities global information relating to the processor in which the data entity is located, and local information relating to the location of the data entity in the own processor. The global information is located in each processor in the system in the form of global information common to and specific for each set of data entities. More particularly, the sets of data entities comprise distribution entities each of which includes information relating to a number of instances of a certain type of data entity located in a certain processor, and information by which the address to this processor can be found.

Abstract: A method and apparatus for creating an object-oriented storage structure for storing parsed data so that it can be accessed and manipulated. A Java Archive (JAR) file containing a Manifest file is parsed and the contents placed in the object-oriented storage structure. The Manifest file contains a plurality of paragraphs where each paragraph is separated by a blank line. Each paragraph in the Manifest file is associated with an element in a Paragraph Vector in the object-oriented storage structure. Each element of the Paragraph Vector contains a reference to a Hashtable where each element in the Hashtable corresponds to a Manifest <key>:<value> pair. The storage structure is capable of dynamically growing to the necessary size of the JAR file. Paragraphs are easily added to the end of each Paragraph Vector while maintaining the ordering of the Paragraph Vectors and the performance of look-up searches.

Abstract: The method is for non-erasable or non-alterable storage of data records in a device, initialization establishing the format of the data records and determining those data fields by way of which summation is permissible. An initialization character sequence is transmitted that has at least a number and length of the data fields to be stored. The valid initialization character sequence is accepted and executed only once. After acceptance only data records whose coding satisfies the information is accepted.

Abstract: A method for providing persistent, dynamic external control of rule-based decision making through inherited user defined rules (UDRs) within a computer controlled relational database management system (RDBMs). Within the novel system, objects are grouped together in a parent-child hierarchy where a child has one parent and each parent can have multiple children. Each object can have one or more pre-defined ("hardcoded") rules associated with it; these hardcoded rules are executed in a sequence to arrive at parameter values which, when applied, tune the database environment. The novel system provides a mechanism for creating UDRs which are associated with a particular object and used by particular hardcoded rules which process the particular object. For a given hardcoded rule, if a processed object does not have a UDR defined within, then a search is made up the object's ancestry (e.g.

Abstract: When a database server has retrieved an object of an object storage area to be subjected to retrieval in response to a database query requirement, it stores identification information of an object of a query result in an identification information area. The database server functions to generate an object containing its query condition and identification information referring to identification information of an object of the query result in the identification information area and register the object in the object storage area. On the basis of information of a new query condition, a database client requires the database server to retrieve an object containing a condition of a retrieve already conducted and its retrieval result. As a retrieval result, the database client receives a query result for the condition of a query already conducted squaring with the new query condition.

Abstract: A method for more efficient handling of data used in testing electronic integrated circuits and boards consisting of specifying data in a flat tabular format. Signal data are contained in columns and cycle data are contained in rows. Any given signal in a cycle will typically be a "0" or "1". If a signal does not change from one cycle to the next, the character "0" or "1" is replaced in the latter cycle by the dot "." character. As a result of the "." character replacements, the data is much more highly compressible by standard compression software than before, thus requiring less storage space for the data.

Abstract: A knowledge manager relying on a hierarchical default expert system is provided including a class hierarchical data base which may be appended to without affecting the class hierarchy and which will address the appended matter first to supersede any previous knowledge in the class hierarchy data base of the system. In addition, the system parameters of assets are appended to the system and are instantiated into objects which are then treated with an object-oriented paradigm. Thus, specific assets which are found throughout a plant may be defined as objects. These objects may be appended to the system without the proprietary information which they contain being disclosed to unauthorized personnel and override, add or delete information to the class hierarchical database.

Abstract: An electronic document management system that takes advantage of advanced document analysis techniques. The electronic document management system may provide automatic archiving of documents and retrieval without the need to navigate through a directory structure or specify a filename. Document comparison is facilitated by automatic retrieval of a previous version of a document. A digital copier alerts a user when a document to be copies already exists electronically within a database.

Abstract: Method and apparatus for automatically storing a referred electronic document in a database and notifying new information to a user. In response to a request issued from a document display control unit 106, a request relay unit 108 acquires a document from a document information management unit 113 and stores it in a document database 117. When a document which matches an interested item 112 is stored, an information monitor unit 111 notifies it to the user.

Abstract: A method for securely accessing information from disparate data sources through a network is provided. The method includes requesting a logon menu from a network server using a client and receiving a logon menu. The method further includes communicating a logon input to the network server which then communicates the logon input to a database server. Next, the method includes verifying the logon input at the database server and generating and storing a unique session identification number at the database server in response. The method continues by communicating the session identification number and a portion of the logon input to the client and storing, and communicating a menu to the client prompting the user to perform at least a first function requiring access to a first type of disparate data source.

Abstract: A method and system for performing spatial proximity joins on high-dimensional points representing data objects of a database in parallel in a multiprocessor system. The method comprises the steps of: partitioning the data points among the processors; creating index structures for the data points of the processors in parallel; assigning the join operations to the processors using the index structures; and simultaneously redistributing and joining the data points in the processors in parallel based on a predetermined joining condition. An efficient data structure, .epsilon.-K-D-B tree, is used to provide fast access to the high-dimensional points and to minimize system storage requirements. The invention achieves fast response time and requires minimum storage space by having structurally identical indices among the processors, assigning workload based on the join costs, and redistributing the data points among the processors while joining the data whenever possible.

Abstract: A database-processing method and system for answering a natural-language question by a computer system with a database. In one embodiment, the system analyzes the grammatical structure of the question. In the analysis, the system scans the question to extract each word in the question; then based on a pre-defined context-free grammatical structure, the question is parsed into its grammatical components using one or more grammatically rules and the database. After parsing the question, the system transforms the components into one or more instructions, using one or more semantic rules and the database. The instructions, when executed, at least access data from the database for generating the answer to the natural-language question. In another embodiment, the system compares the natural-language question with questions stored in the database; each question in the database has its corresponding answer.

Abstract: The invention relates to a method to store a graph G in a memory of a computer system by a number of depth-first and breadth-first searches in different directions. The entire topological information contained in the graph is mapped into the memory. At the same time redundant information is eliminated.

Abstract: A design control system suitable for use in connection with the design of integrated circuits and other elements of manufacture having many parts which need to be developed in a concurrent engineering environment with inputs provided by users and or systems which may be located anywhere in the world provides a set of control information for coordinating movement of the design information through development and to release while providing dynamic tracking of the status of elements of the bills of materials in an integrated and coordinated activity control system utilizing a repository which can be implemented in the form of a database (relational, object oriented, etc.) or using a flat file system. Once a model is created and/or identified by control information design libraries hold the actual pieces of the design under control of the system without limit to the number of libraries, and providing for tracking and hierarchical designs which are allowed to traverse through multiple libraries.