Abstract: A computer storage system and processing method for indexing and accessing data stored in the computer storage system, comprising a compact multi-way search tree structure. The method employs a B-tree like search algorithm that is independent of key type or key length because all keys in index blocks are encoded by a log2 M bit surrogate, where M is the maximal key length. A buffer consisting of a sorted list of key values can be directly transformed into a representation of a C0-tree.

Abstract: A method and apparatus disclosed may be implemented in a digital computer to query a set of arbitrarily structured records. Arbitrarily structured records are structured differently from each other. A query engine, query structure, operators of conventional and non-conventional types may be used in formulating a query. The apparatus may evaluate records having missing fields, repeating fields, or an UNKNOWN value arising from a missing field, division by zero, modulo by zero, or the like. New aggregator (e.g. universal quantifier and existential quantifier) and selector operators (e.g., first, last, nth) may distill multiple values to return a single value. To evaluate a query, the search engine may implement filtered indices, alternate-key indices, compound alternate-key indices, hybrid queries having both full-text and non-full text operands, and joinder of records.

Abstract: A computer method and apparatus determines keywords of documents. An initial document by term matrix is formed, each document being represented by a respective M dimensional vector, where M represents the number of terms or words in a predetermined domain of documents. The dimensionality of the initial matrix is reduced to form resultant vectors of the documents. The resultant vectors are then clustered such that correlated documents are grouped into respective clusters. For each cluster, the terms having greatest impact on the documents in that cluster are identified. The identified terms represent key words of each document in that cluster. Further, the identified terms form a cluster summary indicative of the documents in that cluster.

Abstract: A method and apparatus for compiling(acquiring and storing), processing (analyzing, integrating, and organizing), transmitting, and reporting data and information, which is comprised of a flexible, modular system that overcomes major limitations of conventional and multidimensional databases. The method and apparatus utilizes computer programming code modules and modules of logically arranged digital signal function and formula formations to :(a) acquire data/information units using modules of query instruction items and response instruction items, which can be presented via a branching-logic process, (b))store the responses to the items in independent record files and internal database files, (c)integrate them with digital signals stored in other sources via an integration file, (d)process the digital signals in the digital signal processing files, (e) produce portable report files, and (f)generate reports utilizing report format tiles.

Abstract: A technique for generating a unique record index for a collection of data records. A parent index is generated and attached to a parent data record, and serves as the record index. When a child data record is generated, a child index is generated and is appended to its parent index, and the combination is the record index for that child data record. The record index allows a collection of data records to be sorted and displayed efficiently according to their logical position in a collection. The technique finds application in an electronic mail messaging system, wherein a conversation index is generated for each electronic message.

Abstract: Machine automated techniques are described for a method of data processing called Relationships Processing. A computing system is disclosed which provides for the high speed recording and extraction of data objects (entities) and for the development data representing a queried relationship between the entities. The system is expandable to handle the relatively voluminous data bases of large, commercial data repositories. A user defines set of entities and allowed relationships between the entities. The user can expand this set of allowed entities and relationships at any time during the life of the system without reprogramming or compiling of computer program code or disrupting concurrent operational use of the system. Large systems can now be built that are no longer limited to a scope of design requirements known during initial systems development.

Abstract: In a computer network system, a user-defined file modification request is communicated to a primary server, which communicates the request to a secondary server. The file modification request is saved in a non-volatile storage media associated with the primary server, and the file modification request is executed and saved in a non-volatile storage media associated with the secondary server.

Abstract: Screen objects used by the application programs to draw or paint on the display screen are created in accordance with a predefined class structure which represents a generic display system. Developers of specialized hardware develop specialized classes based on the predefined structure to handle specific command sets and protocols. When the system is initially powered up or reconfigured, the screen objects are created from the generic and specialized classes as necessary by examining the actual display hardware present in the system. When the specialized classes are used to create the screen objects, the screen objects receive the specialized command sets and protocols necessary to interact with display hardware which have been provided by the hardware developers.

Abstract: A method of compressing data by relating incoming data to information stored in a set of inter-related encoding tables. In operation, selective data stream elements are encoded by a simple substitution table which replaces a given block of incoming data with variables from a pre-selected character set. The resulting encoded characters are grouped to form strings, the length and variable type correspond to strings stored in one of the plurality of encoding tables the value of the variables in one table relating to variables in another such that each element in one set is in some way related to at least one element in another. When a matching string is found within the secondary encoding tables, the string name of the matching string is read and stored. Groups of string names are stored and new strings are then formed and compared with pre-existing strings found in the related encoding as proper tables in a sequential repeating fashion as new input data is received.

Abstract: A computer program product comprising a computer useable medium having computer program logic recorded on it for enabling a processor in a computer system to interact with a shared storage medium comprising a ready queue is described and a staging queue. The computer program logic enables the processor to determine whether a data object is larger than available storage capacity of a working storage associated with an application. A public key is associated with the data object and is available to all applications.

Abstract: A system and method for interacting with a shared storage medium comprising a ready queue and a staging queue is described. To store a data object, whether the data object is larger than available storage capacity of a working storage associated with an application is first determined. If the data object is larger than available storage capacity of the working storage, then a private key for the data object is generated. The application then divides the data object into N segments, and causes segments 2 through N to be stored in the staging queue via the working storage. The private key is stored with each of segments 2 through N in the staging queue. Then, the application causes segment 1 of the data object, the public key, and the private key to be stored in the ready queue. To retrieve a data object, an application causes a record having a public key stored therein to be retrieved from the ready queue. Stored in the record are at least a portion of a data object and a private key.

Abstract: A window server communicates with clients and creates, destroys and modifies window objects. Objects are created in response to parameters provided by clients. Clients can obtain a variety of information regarding windows managed by the window server. Hardware windows are supported by subclassing objects, which provides polymorphic screen objects. Therefore, it does not matter whether the window is created by a hardware or software entity. Clients may be notified by the window server in response to certain events occurring with respect to particular windows, such as a configuration change. The window server also dynamically manages a default window layering scheme which takes into account the parameters specified, or not specified, by clients as well as the characteristics of the windows currently being managed by the window server. The window server also supports window clustering, which allows a window to span monitors.

Abstract: A method of customizing and storing an interface control for an imaging machine by entering an interface control customizing mode providing access to a library of control features, selecting a set of control features for use on a given machine, and arranging the set of control features in a given configuration on a scaled representation of an interface control. The set of control features and given configuration is then stored in memory, and referenced with a given identifier in order that upon accessing the identifier the set of control features and given configuration are provided on the interface control display.