Abstract: A video clip storage and retrieval system whereby video clips, stored locally and/or at a more remote location, can be requested and retrieved by a user at the user's multimedia terminal. When the user requests a desired video clip, the request is processed by a primary index manager ("PIM") via a Local Search and Retrieval Unit ("SRU"). Before the message is communicated to the PIM, the local SRU checks its own storage to see whether the requested video clips are available locally. If some of the video clips are local, the local SRU still forwards the request to the PIM so that the PIM may determine specific video clip usage. The PIM determines the extended SRU where the audio-visual data is stored and passes this information to a Data Sequencing Interface ("DSI"). The DSI collects the video clips and downloads the clips to the user's terminal. The user may then view, copy, or print the video clip as desired.

Abstract: A method and apparatus for inserting sorted data into an indexed table is provided. Two or more nodes are used to insert the data into the indexed table. Before an entry for each inserted row is stored in the index associated with the table, the key values in the index entry are transformed using an operation that affects the order of the key values. For example, the order of the bytes used to represent the key values in the index entry may be reversed. The index entries are stored in the portion of the index that corresponds to the transformed key values. As a result, the entries for consecutive key values will not necessarily be stored in the same portion of the index. Consequently, the nodes will not have to compete for a "hot" portion of an index if the nodes are inserting data with key values that fall into the same approximate range. The inverse of the transformation operation is performed on the transformed key values read from the index before the key values are supplied to the user.

Abstract: A data base searching system comprises a memory (M) having a plurality of locations for data items (L), a plurality of passive logic circuits (LC), and a control unit (C) for receiving a query data item and in response thereto producing a group of query signals which are aplied to all passive logic circuits (LC) in parallel. The passive logic circuits (LC) simultaneously compare the query data item (as represented by the group of query signals) with the data items held at the respective locations (L), each passive logic circuit (LC) providing an output to indicate if its associated data item passes a selected comparative test relative to the query data item (e.g. equality, inequality, greater than, less than, etc.).

Abstract: Disclosed is a relational database system for storing biomolecular sequence information in a manner that allows sequences to be catalogued and searched according to association with one or more projects for obtaining full-length biomolecular sequences from shorter sequences. The relational database has sequence records containing information identifying one or more projects to which each of the sequence records belong. Each project groups together one or more biomolecular sequences generated during work to obtain a full-length gene sequence from a shorter sequence. The computer system has a user interface allowing a user to selectively view information regarding one or more projects. The relational database also provides interfaces and methods for accessing and manipulating and analyzing project-based information.

Abstract: A method and apparatus for automating the process of confidentially determining whether people feel mutual attraction or have mutual interests and for automating the process of notifying the people involved of such a match in feelings or interests, while allowing anonymity if no mutual attraction or interests exist. A computer system receives inputs from various persons indicating the identities of persons for whom they feel attraction or with whom they share mutual interests. The system collects this information and periodically searches for matches, i.e., for mutual attractions or interests that have been entered into the system. No notification occurs unless the system determines that a match in attraction or interests exists. If a first person's feelings or interests are not mirrored by a second person, the system will not notify either person and only the computer system will be aware of the first person's feelings for the second person.

Abstract: A virtual reality system has a database for defining one or more three-dimensional virtual spaces. A communication unit establishes a communication between the database and a user, and a data communication unit communicates data from the database to the user so that the user's computer may display a portion of a selected virtual space on the user's head mounted display. The communications unit also receives data corresponding to the position, orientation, and/or movement of the user relative to a reference point and uses the data to define a virtual being within the virtual space, wherein the position, orientation, and/or movements of the virtual being are correlated to the received data. Preferably, the data communicated to the user typically corresponds to the portion of the virtual space viewed from the perspective of the virtual being.

Abstract: A universal tracking system is extremely versatile to permit tracking records in a database for any type of tracking application. A tracking identifier for a database record includes a plurality of fields of equal length. A tracking value, generated for the tracking identifier, tracks relationships among records, such that tracking values are generated to associate one or more fields of a tracking identifier of a first record with one or more fields of a tracking identifier of another record being tracked to the first record. The fields of the tracking identifier are assigned field identifiers to ascribe meanings to the fields to implement tracking systems that track related objects, including objects related in time. Also, field identifiers from one record may be extended to field identifiers of additional records. Numerous tracking schemes supported by the universal tracking system are disclosed. Also, applications for the universal tracking system, including an ISO implementation, are disclosed.

Abstract: A high-reliability file system which surely keeps multiple file data on one drive even if some drives have failed. If renewal of a plurality of blocks of a disk by data in a buffer is necessary, a buffer manager renews the disk by all the data in the buffer which are to be renewed in the future. Flush management is carried out by the drive and the buffer manager. If another drive is "examining" or "renewing" when a flush (renewal) is to be executed, a sequencing means temporarily restrains the buffer manager from starting the flush.

Abstract: A computer network includes a plurality of computer nodes each including a file system and a central processing unit usable by other computer nodes and which are connected to each other via a communication medium. Each respective computer node has a capability of issuing a transfer request requesting management information, including user log-in information, active process information, and so forth, to another computer node over the communication medium. The computer node receiving the transfer request collects its own management information and transfers it to the computer node which issued the transfer request through the communication medium.

Abstract: An improved join operation is performed between data in at least two tables, with one of the tables stored in a remote database (hereafter "remote table") and another table stored in a local database (hereafter "local table"). The entry values in both the local table and the remote table are accessible in an ordered manner, based upon an order of the entry values.

Abstract: An improved method to dramatically reduce the time required to reorganize DB2 tablespaces and index files by not utilizing conventional sort techniques. Viewing access is allowed during the reorganization process by setting the files to read only status. The process is basically non-destructive, allowing a prompt return to the original state, and is checkpointed, allowing restarting at selected intervals. Briefly, the original table and indices are considered as A files and read into memory. New row IDs or RIDs are developed using a non-sorting technique so that the proper order of the data is developed. After the new RIDs have been developed, both the clustering index and the row data are read out of memory and written to a new table and clustering index files in the proper order as B files. All of the table files are then stopped to allow exclusive access. Next, a series of AMS statements are built to do the renaming operations.

Abstract: A file system uses a virtual node architecture to create a three-dimensional directory. A virtual node is created for each file and directory. Selected directory nodes can be linked together to create a stack. Only the top directory in each stack is normally accessible and appears to contain a union of all files and subdirectories contained in the stack. A look-up procedure is used to find a specified file or directory name by sequentially searching the stack beginning with the top directory node and returning the node corresponding to the first occurrence of the name encountered in the search. The virtual node architecture allows the present system to accommodate diverse file systems by permitting each node to designate an individual physical file storage system. The present system can also copy files and directory nodes contained in one stack node to another stack node for the purposes of file back-up or caching.

Abstract: To permit a user to produce application programs easily, a plurality of object names and objects linkage information is specified as external specification data, the plurality of objects are related to each other based on linkage information stored in an objects linkage information storage, transmission and reception of data between the plurality of objects are controlled, and processes in which the plurality of objects constituting the application program are linked are executed.

Abstract: Software utilizing a system and methodologies that allow cross-platform data transfer, either single user and/or networked access, for creating and maintaining an integrated classroom organizer using a computer. The user can create a year of detailed lesson plans. The user enters the number of pages of text(s), or quantified teaching block broken into percentage of completion, in a specified teaching period be it the entire year, semester, month, etc. The text(s) pages or percentage of a teaching task are allocated to designated teaching days previously identified in the calendar. The user can edit and determine whether the pre-scheduled number of text(s) pages, or percentage of a teaching task has been completed, by merely inputting the text(s) page or percentage completed. The difference between text(s) pages or percentage of task completed and the text(s) pages or percentage of task completion previously planned by user will match or not.

Abstract: The present invention discloses a method and apparatus for the enumeration of projections (i.e., "SELECT DISTINCT" operations) in SQL queries containing outer and full outer joins in the presence of inner joins without encountering any regression in performance. The present invention removes projections from a given user query by moving the projections to the top of an expression tree representation of the query, wherein the projection removal is performed using algebraic identities rather than rule-based transformations. The present invention also discloses several methods of enumerating different plans or schedules for projection operations and binary operations in the given user query. The present invention can significantly reduce the execution time of a query by selecting the optimal schedule for binary operations and projections between the binary operations.

Abstract: A system and method for adaptively traversing a network of linked textual or multi-media information utilizes one or more heuristics to explore the network and present information to a user. An exploration or search heuristic governs activity while examining and exploring the linked information resources, while a presentation heuristic controls presentation of a manageable amount of information resources to the user. The system and method accept relevance feedback from the user which is used to refine future search, retrieval, and presentation of information resources. The user may present an information query of various degrees of specificity or the system and method may search and present information resources based entirely on relevance feedback from the user.

Abstract: A method and apparatus for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations.

Abstract: A method for presenting information on display devices of varying sizes. The method processes a query of a database and determines which tables are most likely to contain information which the user wishes to primarily view. The join relationships between tables of the database are used to determine the priority for displaying tables. Those join relationships which were used more frequently in previous queries are accorded higher weight scores and correspondingly have a greater chance of being prioritized to be displayed on the computer screen. Also, a user may select a particular table to be focused upon. In that situation, the method displays not only the focused table but also the tables with a direct relationship to it.

Abstract: A method and system are provided for direct marketer personnel to enhance query performance. The query is performed on modified relational database data stored as contiguous data fields across all records in the database. The queries are performed using a process called bitmapping. A bitmap is a series of computer words strung together in a one dimensional array. It looks at data as a series of bits rather than a higher level data type such as an integer or floating point value. The system also provides the ability to provide a system that permits data segmentation, ad hoc requests, and systematic research. The system is also capable of producing a suite of reports that are specific to the needs of direct marketers. These include reports on RFM information (recency of last purchase, frequency of purchases, and monetary totals of life to date information. These reports are generated on a regular (usually monthly basis) and are used to drive the direct marketing process.

Abstract: A system and method is provided for distributed relational databases for parallel sorting of a relation wherein the relation is a set of tuples to be sorted on multiple sort sites which completely decouples the return phase from the sort phase in order to eliminate the merge phase. The method involves selecting one coordinator site from any of the available logical sites, then generating and sorting a local sample on each of the available storage sites before sending the local random sample from each storage site to the designated coordinator site wherein the local random samples are merged to provide a single global sample. The coordinator site determines the global interval key values based on the global sample. The interval key values being determined such that each interval fits in a single sort site's main memory, wherein the tuples between two interval key values define the interval.