Abstract: A method of scheduling the retrieval of both continuous and non-continuous data retrieves continuous data streams at a predetermined rate. At least one server receives one or more requests for the retrieval of a stream of media data by at least one terminal. Each requested media stream is characterized by a playback rate r.sub.i. A common retrieval time period is established for each requested media stream. The common retrieval time period is a function of the playback rate. The retrieval of the requested media stream is scheduled in the order in which each request is received by the server.

Abstract: The invention concerns a file structure for a computer file. A computer file normally contains (a) a system header, (b) a header generated by an application program, and (c) information generated by a user. The invention creates information in addition to these three types, and adds it to the file. This added information is used by other programs, to transform the data, prior to presentation to the user.

Abstract: Disclosed is a system for establishing storage of a data file. The stores the data file in a manner that reduces the time required to process a query against the data file. Storage of the data file is established on multiple disks. The disks are selected such that their combined data transfer rate meets or exceeds the rate at which a query processor is capable of processing a query.

Abstract: A distributed computer database system including a front end computer and a plurality of computer nodes interconnected by a network into a search engine. A query from a user is transmitted to the front end computer which forwards the query to one of the computer nodes, termed the home node, of the search engine. The home node fragments the query and hashes the fragments of query to create an index by which the hashed query fragments are transmitted to one or more nodes on the network. Each node on the network which receives a hashed fragment uses the fragment of the query to perform a search on its respective database. The results of the searches of the local databases are then gathered by the home node.

Abstract: A storage and retrieval system for storage and retrieval of records in a computer system. In a preferred embodiment, the storage system generates various hashing functions, hashes the keys of the records to identify storage locations, and stores the records in the identified storage locations. The retrieval system retrieves a record for a key by using the hashing functions to identify a storage location and retrieving the data from the identified storage location. The storage system logically organizes storage (e.g., memory) into levels. Each level is further organized into bins, and each bin contains a fixed number of slots. Each slot contains storage for storing one record. The storage system preferably stores about half the records at the first level, a quarter of the records at the second level, and so on. The storage system uses hashing functions and hashes the keys to determine at which level, bin, and slot to store the record associated with the key.

Abstract: A system and method facilitating an operating system user's ability to reference objects in a distributed file system having an incompatible namespace. Compatibility is thereby provided between DFS namespaces and operating system pathname syntax not supported in the DFS. A DFS pathname prefix is associated with each drive letter that is attached to a DFS IFS driver. Before an IFS driver is used, an application program issues a command to associate a drive letter with a particular IFS driver. The command issued also carries a DFS pathname prefix within a data buffer. The IFS services the command by validating existence of the DFS pathname prefix, and thereafter stores such prefix into an internal table of the buffer where it is associated with the attached drive letter. File system requests later received by the DFS client IFS driver carrying a pathname containing that drive letter will have their file specifications edited by the DFS code prior to processing.

Abstract: In a system having producer and consumer processes, a producing process look ahead in its outgoing data stream to ensure that there is data available to consumers on all outgoing streams. The producer looks ahead by keeping a data array in its memory space with an entry for each connected consumer. When the outgoing data stream becomes blocked, the producer searches the array for empty connections. Then, the producer scans the outgoing data stream for messages to send over the empty connections and sends such messages. Periodically, the producer checks the original connection to see if the blocking condition has ended.

Abstract: A method and apparatus for storing and retrieving images of documents, e.g. checks.

Abstract: By sampling the initial result of a query to the database, thereby producing a sampled result which is substantially smaller than the initial result, the sampled result is easier to analyse statistically and is easier to transmit across a communications medium such as a network.

Abstract: A database management system determines, in a single pass over an unordered database, the quantile information. The system sequentially compares each tuple in the data set to a test value, and then selectively inserts the tuple in a test set having a cardinality less than the cardinality of the data set based upon the comparison. The system next uses the quantile information to estimate the number of tuples in the database which satisfy a user-defined predicate to generate an efficient query plan.

Abstract: A query translator translates a query between a graphical user interface and a knowledge representation system. The knowledge representation system reformulates the query and generates an access plan to access data requested by the query. The access plan utilizes several different protocols to access the query information located in dissimilar databases distributed throughout a network. The knowledge representation system generates the access plan by first processing the query through a world view which defines the information in conceptual terms that a human being would understand and then processes the query through a system/network view which redefines the query into network and database access information so that the data requested by the query can be located.

Abstract: Data in disparate formats from different data sources are reformatted into a common data format and stored in database servers serving one or more data sources such that each database server contains only a portion of the composite database. A client server and graphical user interface are provided for allowing a client to perform simple search requests on one database server, browse requests on all database servers, or serve complex search requests on one or more database servers. The client server may reformat the resultant search data into one or more specific database formats for retrieval and manipulation by a specific database program or display the information for the client. The present invention has particular application to the semiconductor manufacturing field, for tracking data produced during the processes of semiconductor manufacturing.

Abstract: A method of moving leaf objects and subtrees in computer networks that employ a distributed network directory is disclosed. The method employs the existing directories and an authentication procedure for each server. A first object that is under the physical control of the administrator of one partition of the distributed network directory requests access to a second object that is under the physical control of the administrator of another partition of the distributed network directory. The directory verifies that the access control list of the first object includes the second object. The access control list of the second object is then checked to verify that it includes a reference to the first object as an object that is permitted access to the second object. As a result, access is only granted in response to requests from objects that appear in the access control list of the second object. a method of synchronizing the access control lists based upon an authoritative access control list is also disclosed.

Abstract: Method and system for selectively retrieving information contained in a stored document set using a metric-based or "fuzzy" finite-state non-deterministic automaton. An automaton is constructed (501) corresponding to a text string query, text strings are read (502) from storage and corresponding dissimilarity values are generated (505). Those strings resulting in values less than a given threshold are recorded (508) and listed for the user. Dissimilarity values are determined based on penalties associated with missing characters, extra characters, incorrect characters, and other differences between the text string query and a text string read from storage.

Abstract: There is provided a system comprising a network model data memory for storing network model data which stores the condition in which the record of the network type database is stored and an object generating/executing circuit for, upon request for referencing to the record stored within the network type database, referencing to this network model data to make enquiry, to automatically operate an optimum method of retrieving a reference request record of the network type database for determination. Based on this determination, the enquiry object generating/executing circuit combines the objects for inquiring of a plurality of databases for generation. Thus, the control enquiry for the network type database can be executed as if it were executed on the relational type database.

Abstract: A method is disclosed for retroactively inserting a transactional change into a file where the file involves a plurality of images that are recorded (i.e., saved) at preset sequential time intervals. Each image contains all pertinent information relating to the file subject matter, such as an insurance policy or the like, existing at the time of its saving. The image which immediately precedes the effective date of the desired retroactive transactional change is retrieved, updated to the effective date, and then subjected to the program sequences of backing out, applying and reapplying. The resulting corrected image overcomes the prior art processing problems of prorating, policy cancellation and foreign record origin for a file.

Abstract: An enciphered file sharing method is adapted to an area distributed type data processing system in which a plurality of data processing units are coupled via a network and a plurality of users share files while maintaining privacy among the users. The enciphered file sharing method includes the steps of (a) enciphering files using a cipher key and storing enciphered files in directories having a hierarchical tree structure in at least a first data processing unit which functions as a file server, (b) enciphering files having the same access attribute by the same cipher key by assigning one cipher key to each of the directories, and (c) transferring the enciphered files in the network and locally deciphering the enciphered files in at least a second data processing unit which is used by one of the users, where the second data processing unit is different from the first data processing unit.

Abstract: The invention provides a method for providing an indication of the occurrence of events within a database system. The database system stores data accessible by a plurality of users and in a plurality of data formats. The method comprises the steps of periodically reading a storage location within the database, detecting a data structure stored in the storage location and reading the data structure. The method further includes the steps of converting the data structure from the first data format to a second data format and providing the indication to at least one user, the indication including at least a portion of the data structure.

Abstract: An information retrieval system allowing the user to build a database or to retrieve data therefrom based on vague retrieval-designating data without becoming aware of the database structure. The system comprises a neural network, a memory, an interface part and a CRT. The neural network stores data designating electronic still pictures contained in the memory. When data for designating retrieval are input, the interface part groups the data into such categories as the place where the desired picture was taken and the date on which it was taken, and supplies the neural network with the categorized input data. In turn, the neural network outputs by association the data corresponding to the input data. Given the data from the network, the memory outputs the relevant electronic still picture to the CRT for display.

Abstract: A computer implemented method for speeding up the recursive most significant digit radix sorting of a set of record keys in which the keys are scanned for a shared or common prefix, coded according to the point in the key where they differ and the value of the differing digit, and processed such that during each dispersion phase the code words are used to speed processing by avoiding comparison matching of the prefixes, the recursive dispersion and collection phases continuing until singletons are reached. In the absence of shared prefixes the keys are normally recursively radix sorted.