Abstract: A mechanism is described for transferring data between a pair of relational databases on client and server machines. A client component creates a first pipe in the client, and sends information to a server component, enabling it to create a second pipe in the server. The client component then calls the data unloading utility of the client database, causing it to start to unload the data into the first pipe. The client component then starts up a Send process in the client, which reads data from the first pipe and sends it to the server. At the server, the server component calls the loading utility of the server database, specifying the second pipe as input. As the data arrives at the server, the server component writes it into the second pipe, from where it will be read by the loading utility and written into the server database.

Abstract: A system and method for expediting database queries by using random sampling. Data associated with a database attribute is partitioned into multiple data classes using a query language grouping command. Each of the data classes is randomly sampled on an individual basis to obtain a corresponding number of class data samples, each of which are stored in a separate sample database table. Database queries are then applied to each of the class data samples in the sample database table.

Abstract: Any existing transitive closure in a database can be found using a method based on standard 4th Generation Structured Query Language (SQL) without non-standard extensions to perform recursion analysis. There are no requirements to stay within a preset number of levels in the database to prevent breakdown as in previous known methods. The method represents each database as a graph and builds path and edge tables which are updated as data, that is verticies and edges, are added or deleted. Since this method uses instructions that are entirely within standard 4GL SQL, it can be used over multiple platforms as long as the platforms are 4GL SQL compliant.

Abstract: A file management system facilitates both physical and logical file groupings with convenient access to surplus media for sub-volume expansion. Each item of media includes a local file directory, which provides a list of files stored on the medium, cross-referenced to the files' addresses on the medium. The media items are organized as one or more primary sub-volumes, an auxiliary sub-volume, and a media reservoir. Each primary sub-volume preferably comprises a single sub-directory, and includes one or more media items used to store files of a specific class. Initially each primary sub-volume includes a single piece of media. The library also includes at least one auxiliary sub-volume, which may include multiple sub-directories, to store leftover files that do not fall under classes corresponding to the primary sub-volumes. Files may be stored on the auxiliary sub-volume on a random, "space available" basis.

Abstract: An object oriented framework for data mining operates upon a selected data source and produces a result file. Certain core functions are performed by the framework, which interact with the extensible function. This separation of core and extensible functions allows the separation of the specific processing sequence and requirement of a specific data mining operation from the common attribute of all data mining operations. The user may thus define extensible functions that allow the framework to perform new data mining operations without the framework having the knowledge of the specific processing required by those operations.

Abstract: When migrating legacy database systems to a new database system the relationships between tables need to be preserved. Also, base tables and their children have to maintain their relationship. A database system which creates a system generated unique key is stored with the data which is loaded. To enable load, search, and retrieval to be efficient a data remapping function is defined which uses the system generated key to maintain the relationships which were maintained by a unique key in the legacy systems.

Abstract: A computer-implemented method and system for of retrieving information. A first file of information is received which includes a first markup language to identify contents of the information. Responsive to the receiving the first file of information, the first file of information is parsed to generate a list of profiles, and at least one corresponding topic for each of the list of profiles. A second file in a second markup language is created containing the list of the profiles and at least one corresponding third file is created in a third markup language for the at least one corresponding topic for each of the list of profiles. The second file contains anchors referencing each at least one corresponding third file, and first markup instances in the first file of information are converted to second markup instances in either the second file or the third file.

Abstract: A system which creates, stores, retrieves and displays thumbnail images. The dominant colors of the image are displayed in the thumbnail images. The dominant colors in an image are determined using groups of pixels where the average color is used to select an appropriate dominant color for display. The size of the thumbnails displayed and the area set for displaying the thumbnails can be changed to allow visual review of either a large number of thumbnails or a smaller but larger size set of thumbnails. Thumbnails, and other image files and other related text files and non-related files can be indexed and searched using keywords by using keyword views into the stored files to indicate a match when the views designate the same file. The system allows a search to be based on a partial match of keywords. Searching can be performed using super-keywords, which are combinations of keywords and other file and data characteristics.

Abstract: A mechanism for performing retroactive backups in a computer system is presented. The retroactive backup mechanism employs a backup policy dictating that certain backups are to be performed at set times and for set backup levels, but subject to user-defined selection criteria so that the backups are of a retroactive nature. The selection criteria comprises a retroactive backup date upon which the scheduled backup is made effective. It is selected to correspond to the backup date of a previous backup or save set. Alternatively, the retroactive backup date upon which the scheduled backup is made effective is determined by controlling the amount of data to be backed up. Thus, the selection criteria comprises a maximum size threshold, selected by a user or system administrator as the amount of data that can be backed up in an allotted backup time. The retroactive backup copies to a new save set only data that has not been modified or deleted since the date indicated as the retroactive backup date.

Abstract: The invention concerns a method for estimating characteristic information of data items in a data set, such as a database, based on parameters of a multifractal distribution. The invention facilitates efficient estimation of such characteristic information of data contained in a data set more accurately than known estimation methods and without requiring an exhaustive analysis of the data. The invention also concerns an efficient technique for generating the parameters for the multifractal distribution.

Abstract: A method for improving the efficiency of queries in relational database management systems that use the exhaustive method of query optimization. The join structure of the query is examined prior to query optimization and tables are ordered according to graph theory. The tables in the FROM clause of the query are then reordered before query optimization. The access plan is thus developed from an already near-optimal table ordering. As a result, the number of table permutations examined during query optimization is pruned, the time to examining large numbers of table order permutations is avoided, and the optimization cost is reduced.

Abstract: The data search apparatus includes: a data storage section for holding and storing data about all of the plurality of data items in a state where each of the plurality of data items is represented as a row, on which a plurality of attribute values about the data item are arranged in line, and the rows corresponding to the plurality of data items are sorted in a predetermined order decided by a designated attribute; a display control section for selectively displaying a predetermined number of data items from the plurality of data items in the predetermined order decided by the designated attribute on the display screen of the display device such that the attribute values of each of the displayed data items are arranged in line and that a designated data item row and a designated attribute value column are displayed in a different state from the other data item rows and the other attribute value columns; a designation change section for changing the designated row and the designated attribute value column; and

Abstract: An object model comprises one or more semantic objects that represent items about which data is stored in a relational database in a computer system. Each semantic object has one or more components that define the data stored for each item. The object model is mapped into a current relational database schema. As a user makes changes to the model the computer system generates a proposed relational database schema, and the differences between the current relational database schema and the proposed relational database schema are determined. The relation database is modified to reflect changes made in the corresponding object model based upon the differences between the current and proposed relational database schemas.

Abstract: An improved method and system for storing and retrieving information written as text. The method and system store most words of the text solely in an inverted structure, and the remainder of the text's information in an auxiliary structure. The structures can be quickly searched for keyword information, provide highly efficient storage, and can be reconstituted into the original text.

Abstract: A World Wide Web browser makes requests to web servers on a network which receive and fulfill requests as an agent of the browser client, organizing distributed sub-agents as distributed integration solution (DIS) servers on an intranet network supporting the web server which also has an access agent servers accessible over the Internet. DIS servers execute selected capsule objects which perform programmable functions upon a received command from a web server control program agent for retrieving, from a database gateway coupled to a plurality of database resources upon a single request made from a Hypertext document, requested information from multiple data bases located at different types of databases geograhically dispersed, performing calculations, formatting, and other services prior to reporting to the web browser or to other locations, in a selected format, as in a display, fax, printer, and to customer installations or to TV video subscribers, with account tracking.

Abstract: There are disclosed a method and system for managing a file that allows an operator to easily select, specify, and manage a multimedia file (including audio data, text, still image, moving image, etc.) via a display screen. The type of a file is identified. If the file is an audio data file, then an icon is generated with an image representing an amplitude waveform or a frequency distribution waveform of the audio data, or, the icon is generated with an image including a color or a pattern preassigned to the frequency distribution or both. If the file is a text file, then an icon is generated with an image representing an arbitrary area of an arbitrary page of the text file. If the file is a still image file, then an icon is generated with an image obtained by reducing an arbitrary area of the still image. If the file is a moving image file, then an icon is generated with an image obtained by reducing an arbitrary area of an arbitrary scene of the moving image.

Abstract: Efficient update and presentation of a plurality of replicated data objects is accomplished with a write lock which moves among the replicas of a data object. After any necessary preparation for updating a data object, a shadow replica requests a write lock from the replica which currently holds the write lock or from the replica designated as the master replica. The write lock is moved to requesting shadow replica which performs an update to itself. The update is then reflected at the local system display to provide visual feedback to the user. The update is propagated to the other replicas which present the change at their associated displays. In the preferred embodiment, the write lock is retained at the replica which last requested the write lock as it is the most likely to receive the next update. While the invention finds particular application in a distributed data processing environment, it can also be used in a single processor having multiple replicas in separate memory partitions.

Abstract: A database management system and method for operation allow both key compression and quick indexed retrieval of nodes. The system includes a processor, memory and a modified skip list data structure with compressed search keys. The prior art skip list structure is modified so that each node has only one other node pointing to it. This allows search keys to be compressed based on the key of the previous node. Key compression allows the data structure to use less memory than is otherwise possible.

Abstract: A document processing apparatus has a floppy disc for storing document information in one format, a key stroke train converter for reading the information from the floppy disc and converting it into information in another format, a processor for processing the information, and another floppy disc for storing the processed information.

Abstract: An application programming interface accesses page analysis functionality of a block selection program and accesses data structures resulting therefrom. The application programming interface includes plural page analysis functionality which manipulate block selection functions including functions to analyze a document page, to create a hierarchical tree structure corresponding to the analyzed document page, and to return a pointer which is a block ID or a root node of the analyzed page. Plural hierarchical tree structure accessing functions traverse the hierarchical tree structure, and locate desired nodes in the hierarchical tree structure.