Abstract: A method for extracting metadata for plural related objects of different types from a database includes defining a heterogeneous object type as a collection of database objects of different types. Upon a request to fetch a particular heterogeneous object, member objects of the heterogeneous object are fetched from the particular heterogeneous object in a specific order based on the definition of the heterogeneous object's type, such as a valid order for re-creating the particular heterogeneous object. The set of member objects to be fetched can be restricted according to at least one specified filter, which itself may be translated into a second filter according to a type of a member object being fetched. Such translated filters can inherit values from the filter specified in the request for the particular heterogeneous object type, or can have a fixed value of some data type. The extracted metadata can be formatted to recreate the particular heterogeneous object.

Abstract: The present invention enables the determination of what claim types can be written based on a client data set(s). The reverse is also true where the present invention provides the capability to determine what data sets are required to write different claim categories and types. In an illustrative embodiment, the determination of the scope of an audit in accordance with the present invention includes the determination of the claim types that can be written given a certain client data elements and/or the determination of the data elements needed to write certain claim types, both of which are based on the predefined relationships between claim types and data elements. Possible claim types can also be determined based on the client data set(s) and a permissible number of missing client data fields.

Abstract: In order to realize a practical data warehouse system with the use of a network in a distributed environment, for example, data collectors (101 and 102) for creating/managing each replica of server data for clients (103 and 104) as shown in FIG. 1 are connected to a network (113). A data collector holds a data request condition given from a user via a client and negotiates with a server (114, 122) which supplies data according to such resources as a storage unit, a CPU, etc. usable by the data collector, thereby the range and quality of the data for which a replica is to be created can be adjusted. For query processing, a part or the whole of a query from a client is processed with the use of a replica (123) created in the data collector. Queries which cannot be processed with any replica in the data collector are transferred to the server. Because a replica created in the data collector can be used to process a query from a client device such a way, the server load can be reduced.

Abstract: A storage caching method and system manages shared access to real time data files while maintaining data file coherency and consistency in a computer network including a plurality of remote computer workstations and at least one file server. The storage caching system is implemented by storage caches, which are associated with workstations, and a cache server, which is associated with a file server, where the storage caches and the cache server interface with a distributed file system to provide shared access to real time data files by remote workstations.

Abstract: A method and structure for a virtual finishing job ticket database used in a finishing system wherein the database stores capability and constraint information relating to finishing devices available for a finishing job, receives information describing the finishing operations to be performed, and stores the information in a manner accessible for management of the finishing job.

Abstract: A computerized document management system manages and allows viewing of attachment documents in groups of electronic mail messages. A determination is first made as to whether an electronic mail message is a task message. If so, task history information, including the main text of the electronic mail message, attribute information, and information about relations with other messages, is stored. The attachment documents are then extracted and stored together with attachment document management information. Upon receipt of a search request, a list of attachment documents and task histories can then be displayed.

Abstract: A medical image storage and retrieval system includes a database with relationally linked tables including a disease factoid table, an image and image caption table, and a patient data table. A flexible system allows for peer review, remote access and maintenance of the stored data, and query searching and retrieval of groups of related multimedia (image and text) case file information. The system facilitates distance learning and remote consultation.

Abstract: The present invention includes a method and system for providing an estimate of a summary of a data set generated by an unknown distribution. The method includes selecting a subset of data points from the data set, applying a scoring rule to each data point of the subset of data points based on an estimated relative location and an assigned weight for each data point to provide a score for each data point, selectively retaining data points to track based on the score for each data point; and determining an estimate of the summary of the data set based on the retained data points.

Abstract: A technique for data mining where the available data contains both structured as well as unstructured (free-text) data. The present invention combines together the information available from different types of data to provide a single similarity score indicating the degree of similarity between records. Thus, a data evaluation application selects two records from a database and compares corresponding fields from the two records. The application determines whether to apply a nominal matching process, an ordinal matching process, or a vector-space matching process depending on the type of data in each pair of corresponding fields. The application sums the matching scores for all the fields in the records to compute the similarity score.

Abstract: A method of data retrieval and presentation over a network can include, responsive to an inquiry, querying at least one search engine in the network as specified by configuration attributes and the inquiry. References from the query can be received from the at least one search engine. The references can be processed according to research rules and a research model can be generated from the processed references.

Abstract: A system and method is presented for incremental replication of changes in a state based distributed database synchronization system. If a destination server has one previously established yet unsatisfied synchronization point, a starting synchronization point is formed by extracting the unsatisfied synchronization point from the destination server, identifying a type identifier within the extracted unsatisfied synchronization point identifying a predetermined set of synchronization algorithms and an execution order thereof, identifying a current key within the extracted unsatisfied synchronization point which indicates one of the predetermined set of synchronization algorithms to be started for execution, and adjusting a target state of the destination server to one older than or equal to an established target state specified by the extracted unsatisfied synchronization point.

Abstract: A method and system of organizing items including building up clusters of items, each item having information associated therewith, during building up of the clusters evaluating dynamically a metric of the cluster, the metric of the cluster expressing at least whether the items in a cluster have more in common with each other than they have in common with items outside of the cluster.

Abstract: A system and method are disclosed for implementing dynamic set operations on data stored in a sorted array using a hybrid red-black binary search tree as a data structure. More particularly, the subject invention facilitates the implementation of a binary search to access data items stored in a sorted array by position, rather than by key value. This is accomplished by generating a balanced red-black binary search tree for a sorted array of data items wherein the information stored at each node of the tree includes: a key value; a color; a left pointer to indicate the presence of a child to the left of the node; a right pointer to indicate the presence of a child to the right of the node; a count of descendents along a branch to the left of the node; and a count of descendants along a branch to the right of the node.

Abstract: A database management system is disclosed. One example provides request handler modules through which users interface with the database management system. A master control module assigns database servers to databases. A request handler module receives a database request from a client and sends a database identifier to the master control module, which determines an assigned database server and returns its location to the request handler module. The request handler module then sends the database request to the assigned database server, which handles the database request. The database management system facilitates the addition of database servers without requiring substantial system reconfiguration. It also facilitates migration of database assignments for improved efficiency or other reasons.

Abstract: A framework for a system that will allow a professional to vastly extend the web of his referral network, by using a centralized matching system that both protects the privacy of his client, and allows a broad range of outside specialists the opportunity to present themselves. In addition to a database that allows the referring professional to gauge the capabilities of the candidates, the system also includes a bidding system such that candidates can offer a small reward (cash or otherwise) in exchange for being given the work.

Abstract: A garbage collector that divides a dynamically allocated heap into car sections grouped into trains in accordance with the train algorithm subdivides large trains into subtrains. When an object that is reachable from the train-algorithm-managed generation of the heap is evacuated from a car being collected during a collection increment, it is placed into the last car in the subtrain in which the reference to it resides, even if that car is not the last car in the train to which the reference's subtrain belongs. The train-algorithm test for dead trains is performed not only on top-level trains but also on sub-trains.

Abstract: A data structure extension system for dynamically adding extensions to existing data structures without interfering with underlying code. The data structure extension system includes logic that allows a programmer to “privately” extend fields of existing entries in data structures in the operating system's kernel without interfering with the functionality of the overall data structure for other applications. An extension pointer disposed in the data structure associates each entry of the data structures extended with a respective extension table. The extension table allows for the dynamic addition of non-intefering interfering fields to the data structures. Each extension table entry has corresponding data stored in an external storage unit.

Abstract: A system for originating, storing, processing and delivering data includes a transmission device, a server system, and a recipient connected by various networks. According to one method, the transmission device employing a simple transmit action transmits a message along with metadata to a receiver connected with the server system. Particular metadata are mapped to an address identifier associated with the receiver to determine a location for storing the message, as well as other parameters such as information relating to one or more intended recipients. An intended recipient is notified of an accessible message via e-mail, and can access a copy of the message via a web browser served a web page by the server system.

Abstract: A system and a method for drawing a patent map using a technical field word are disclosed. In the system and the method, a word to be used for drawing a patent map is extracted by calculating weight values of significant words which are gotten by removing unnecessary words from patent data, and this extracted word is matched with a patent to draw the patent map.

Abstract: An improved method and system for comparing database data. Data comparison may be performed either within a database or between two databases. Sets of cyclical redundancy check values may be created, at various points in time. Corresponding cyclical redundancy check values may be compared with each other to determine if the underlying data is different; differences may be displayed. Each cyclical redundancy check value may correspond to a user-determined amount of data within the database. The user-determined amount of data may be: (1) user-specified columns within one of the plurality of tables within the database; (2) a row within one of the plurality of tables within the database; (3) a table within the database; (4) the database in its entirety; or (5) any other subset of the database. A user-determined number of bytes corresponding to a user-determined subset of the user-determined amount of data may be stored for future use.