Abstract: A data structure and corresponding search methods are disclosed for improving the performance of table lookups. A data structure for the table is employed using a single hash table with hash table entries pointing to tree fragments that are contiguous in main memory and can be efficiently loaded into a local data store or cache. Decision nodes are stored in a contiguous block of memory in a relative position based on the position of the decision node in the tree structure, including blank positions. Leaf nodes are stored in a contiguous block of memory based on the position of the leaf node in the tree structure, concatenating leaf nodes to eliminate blank positions. Leaf nodes of the tree fragments contain indicia of a data record, or indicia of another tree fragment. The data structure and corresponding search algorithm are employed for searches based on a longest prefix match in an internet routing table.

Abstract: A system performs cross-language query translations. The system receives a search query that includes terms in a first language and determines possible translations of the terms of the search query into a second language. The system also locates documents for use as parallel corpora to aid in the translation by: (1) locating documents in the first language that contain references that match the terms of the search query and identify documents in the second language; (2) locating documents in the first language that contain references that match the terms of the query and refer to other documents in the first language and identify documents in the second language that contain references to the other documents; or (3) locating documents in the first language that match the terms of the query and identify documents in the second language that contain references to the documents in the first language.

Abstract: A system and method for archiving and restoring data from an operations center of a utility data center are described. The system includes a number of database systems, located in the operations center, a cell manager, located in a utility controller of the utility data center and coupled to each of the database systems through a designated port in a firewall. The system also includes a media agent coupled to each of the databases and to the cell manager. The media agent is configured to receive data from the database systems for forwarding to an archival storage device.

Abstract: A garbage collector employs the train algorithm to collect a heap generation incrementally, collecting “car sections” in a collection order. As it updates the “remembered sets” by which it keeps track of where references to objects in respective car sections are located, it also updates oldest- and youngest-car indicators for each car section. The oldest- and youngest-car indicators for a given car section specify limits in the collection sequence beyond which references to objects in the given car have not been found. The garbage collector uses these indicators to identify cars that contain no objects that are reachable except through a reference chain that includes the collection set for the current collection increment. It adds one or more such cars to the collection set, and it collects the thus-expanded collection set without processing the remembered sets associated with the added cars.

Abstract: Three-dimensional computer model data, moving image data or still image data showing at least one person is stored in an archive database 126, 703, 850, 1303, together with additional information to improve the searching and retrieval of data therefrom. The additional information includes view parameter data 512, 1040 which defines at whom or what each person is looking during each predetermined period of time or image. Text data 504, 1020 which comprises words associated with the person, and viewing histogram data 540 which, for each period of text data defines the percentage of time that the speaking person spent looking at each other person or object, may also be stored.

Abstract: Object level conflict detection is provided. In an optimistic concurrency embodiment, when an object is to be updated, the database system is checked to determine whether any data related to fields of the object have changed since the object was read. This can be accomplished by storing a copy of the data when the initial object read function is performed and subsequently comparing the initial copy with the database data as it stands when the update is to be performed.

Abstract: Diagnosis of corruption in interrelated data entities uses a graph of nodes and edges. Datum nodes represent the data entities, relationship nodes represent the relationships among the data entities. The datum nodes are connected through their relationship nodes by the edges. When corruption is detected, the relationships are analyzed and each edge connecting a datum node to a relationship node is removed from the graph when the corresponding relationship is invalid. The datum nodes that remain connected to their relationship nodes form a subgraph and the corresponding data entities are considered correct. In one aspect, if more than one subgraph is formed, the datum nodes in the largest are used. In another aspect, the data entities and relationships are analyzed to create the graph when the data entities are assumed correct. The data entities may be data and metadata of various types that can be associated with the data.

Abstract: A method of communicating data between databases having different formats includes providing a first computer (4), a second computer (14), and a server (22) in a distributed computer network (2) where the server (22) is configured to send, receive, and process data packets including records having different formats to and from the first computer (4) an the second computer (14). The server (22) converts a first record in a first format (26a) into the first record in the second format (26b) and converts a second record in the second format (26b) into the first format (26a). The second computer is configured to receive data packets having the first record in the second format (26b), and to send data packets having the second record in the second format (26b).

Abstract: A document information management method includes the steps to be executed by: a document registration program of storing a document in a document storage unit in accordance with a registered document by a user, document properties and a user profile, and forming document query and query structure indices of document properties and the user profile to store these indices in a query data storage unit and to further form several seeds documents; a related document retrieval program of retrieving a query data storage unit by using the seeds documents as query expressions to obtain query results of the document, the document properties and the user profile; and a related information notification program of generating related information of the document for each of the query results, and notifying the related information for each notice destination, including the related information of the document, of the document properties and of the user profile.

Abstract: A method and apparatus for generating content for an electronic content access system wherein requests for host content are received and responses to such requests include at least references to the host content requested and at least references to guest content related to the host content requested, comprising obtaining host content from sources external to the electronic content access system, importing the obtained host content to a host content database, distilling the host content to derive host content summary data for the host content, storing the host content summary data in an indexable structure and storing guest content in an indexable structure, such that a query using host content summary data can be applied as a search against the guest content to retrieve guest content related to the requested host content without requiring preassociated links to guest content.

Abstract: A query optimization technique that determines whether a query includes a self join that is transitively derived through table expressions having UNION operators. If so, the query is simplified to eliminate the table expressions and to reduce the query to an equivalent query over tables.

Abstract: In an example information processing apparatus, three information groups divided by type into general information, system-inherent information, and user information, are utilized to give operational directions. The information processing apparatus selects one or more best information from a plurality of input information based on the three information groups, whereby the best information can be selected with flexibility and high reliability.

Abstract: A system and method for automatically processing and responding to large volumes of customer complaints regarding Unsolicited Commercial Email (UCE) and other service disruptions. The complaints include one or more electronic mail (email) documents, each email document including a header and body portion. The process parses the header and body portions from each email document, normalizes the header and body portion by stripping unwanted characters, and extracts specific information relating to the email document from the source of the complaint. The extracted information can be input to a database that can be accessed by the Customer Support Center (CSC) of the Internet Service Provider (ISP).

Abstract: A method and mechanism for pipelined table functions is disclosed. With pipelining, data from a first table function does not have to be materialized into a complete collection before it is consumed by a succeeding table function. Instead, a producer of data creates a stream of data that is immediately utilized by a consumer of that data. Also disclosed is a method and mechanism for parallel processing of table functions, in which the set of work operated upon by a table function is sub-divided into smaller portions that are assigned to a plurality of table function slaves. Also disclosed is an integration between pipelining and parallelized execution for table functions.

Abstract: Sparsely distributed prefixes within a bitmapped multi-bit trie are compressed by one or more of: replacing a single entry table string terminating with a single prefix end node with a parent table entry explicitly encoding a prefix portion; replacing a table with only two end nodes or only an end node and an internal node with a single parent table entry explicitly encoding prefix portions; replacing two end nodes with a single compressed child entry at a table location normally occupied by an internal node and explicitly encoding prefix portions; and replacing a plurality of end nodes with a prefix-only entry located at the table end explicitly encoding portions of a plurality of prefixes. The compressed child entry and the prefix-only entry, if present, are read by default each time the table is searched. Run length encoding allows variable length prefix portions to be encoded.

Abstract: A system and associated method for data mining prediction is presented according to which the user selects a database table by means of a graphical user interface. Some records in the table are complete, while other records are incomplete. A subset of records of the database table is determined wherein each record of the subset contains a data value in the column selected for prediction. This subset of records is used to generate a model by means of a data mining algorithm, such as linear regression, radial basis function, decision tree or neural network methods. The resulting model is then utilized to predict the empty data fields in the column. After completing the prediction, the predicted values are entered into the column for display to the user.

Abstract: A garbage collector collects a generation of a dynamically allocated heap in a computer's memory incrementally. A collection set within the generation is associated with each collection increment. The collector reclaims for reuse the memory space occupied by any collection-set object not reachable by a reference chain that extends from outside the collection set. The collector monitors the total amount of allocation that occurs within the generation between collection increments, and it bases the collection-set size on those allocation amounts.

Abstract: A method and system are provided for allowing users to register XML schemas in a database system. The database system determines, based on a registered XML schema, how to store within the database system XML documents that conform to the XML schema. This determination involves mapping constructs defined in the XML schema to constructs supported by the database system. Such constructs may include datatypes, hierarchical relationship between elements, constraints, inheritances, etc. Once the mapping has been determined, it is stored and used by the database system to determine how to store subsequently received XML documents that conform to the registered XML schema.

Abstract: A database system stores data relating to media objects and includes a meta table, a supplementary meta table, a content table, a supplementary content table, each supplementary content data record being linked to a supplementary metadata record and to a content data record. An object type link table links together records in the meta table, and a content data link table links together records in the content data table. An information retrieval system analyzes the tables and provides, for a selected instance of an object, information about that object's attributes and relationships with other objects in a hierarchical form.

Abstract: A system and method for planning, developing and implementing data warehouse solutions. A methodology including a plurality of tasks associated with the design and implementation of a data warehouse solution is represented by a visual model that identifies relationships between the tasks, and includes links between the tasks and content contained within a methodology database. The visual model is displayed within a visual modeling program, and can be customized for a particular data warehouse engagement through the selection of tasks displayed in the visual model for inclusion in the particular data warehouse engagement. Additionally, a customized methodology plan, statement of work, and project methodology guide for a particular data warehouse engagement can be automatically generated from content extracted from the visual model and methodology database.