Abstract: Described are techniques for managing an index structure used to access data portions. A token having a token value for a data portion is provided. An entry in said index structure for said data portion is provided. The index structure is accessed using said token value as a key to determine said entry in said index structure for said data portion. The entry is allocated to have a location in accordance with said token value.

Abstract: A presentation interface for rendering Web form content can include a Web form, a repeated item section, and a collection control section. The Web form can be written in a markup language based upon a Standard Generalized Mark-up Language (SGML). The Web form can include a repeating structure that references a collection of data items. The repeated item section can present the data items in a tabular format. The repeated item section can also include multiple selectors, one selector corresponding to each data item. The collection control section can include at least one user selectable collection actuator, such as a button, that performs a function associated with the actuator upon only those designated data items in the collection for which a corresponding selector has been chosen.

Abstract: A media service application responsive to a media retrieval request received from a user of client computer to retrieve a video designated by the retrieval request. The media service retrieves relevant advertisements as a function of metadata included in the video file and/or stored personal preference data of the user. If the retrieval request is an online viewing request the media service application integrates the retrieved advertisements into the retrieved video and transfers an integrated video/advertisement file to the client If the retrieval request is a download request the media service application transfers the retrieved ad and retrieved video to the client as separate files for integration by the client during playback of the video.

Abstract: According to this invention, a document processing apparatus capable of creating document information including attribute information and page content information from electronic data created by an application program, includes a storage unit which stores, as part of document information, original document information for specifying electronic data as a source of the document information, an update instruction unit which allows a user to instruct regeneration of the document information, and an update unit which creates content information of the document information from electronic data specified by using the original document information and replaces the content information included in the document information with the created content information, in accordance with an instruction issued through the update instruction unit.

Abstract: Files belonging to a file group are collected at an uppermost tier when a specific action occurs with respect to a key file of the file group. When an action with respect to a keyword occurs while a management processor of a disc adapter is taken as a management server and a host is taken as an agent, and file promotion processing is carried out by the management server by starting management software in accordance with a microprogram. When the content of the specific action satisfies promotion conditions, the other files belonging to the same file group as the key file are promoted to the uppermost tier to be ready for utilization.

Abstract: A plurality of documents is scored, where at least some of the documents are characterized by at least one link from at least one other of the documents. For each of at least particular ones of the plurality of documents, a score is assigned to that particular document, with respect to a topic, based at least in part on an incoherency characteristic associated with at least one document linking to that particular document.

Abstract: An electronic device including a receiving unit which receives data to be saved, a data name and a user name from outside, a memory area management unit which saves the data to be saved in a memory area, a directory management unit which assigns a name which relates the data to be saved to already saved data in the memory area to a data management list parameter which expresses a relationship between data saved in the memory area and a display unit which displays the name of data saved in the memory area based on the data management list parameter, in compliance with a demand from outside, wherein the directory management unit changes the name assigned to the data management list parameter, depending on data saved in the memory area.

Abstract: Techniques for automatically checking the relevance and variety of search results are provided. A query is submitted to a search engine, which uses a search algorithm to obtain search results based on the query. A set of the top n related terms for the query is identified. For each related term in the set of terms, its relative frequency in relation to all terms in the set of terms is determined. If the term does not occur in any of the results, then a loss in variety proportional to the relative term frequency for the term has occurred. Otherwise, the relevance of the search results is calculated by comparing the proportion of results containing the term with the relative term frequency for a term. This process is repeated for all terms in the set of related terms to produce a total variety and relevance for the results.

Abstract: Embodiments of the invention provide a method, article of manufacture, and an apparatus used to optimize the execution of a database query. One embodiment includes a computer-implemented method that includes the steps of receiving a query of a database, prior to executing the query, analyzing the query to select a locking strategy to use in executing the query, and executing the query using the selected locking strategy. Depending on the content of a particular query, or the status of a database, a query optimizer may determine whether to escalate from a row level locking strategy to a page level locking strategy when executing the data query.

Abstract: A method for achieving interactive browsing includes steps performed by a computer coupled to a knowledge base and a document database. The knowledge base stores a plurality of terms and information relating to each term, and the document database stores a plurality of documents. The steps include acquiring terms in which a user has interest; extracting information relating to the terms in which the user has interest from the knowledge base in order to display the information in a first display part of a user interface; and extracting documents containing the terms in which the user has interest from the document database in order to display a list of extracted documents in a second display part of the user interface.

Abstract: Copy protected materials are backed up or restored and made available for play on electronic media players through an online retrievable system. Corrupted segments of electronic media storage files are identified and located prior to being read, executed, or played. An uncorrupted copy from the network is then located, and software instructions provide for the storage of the uncorrupted segment of the file on electronic media player, merging the uncorrupted segment into the reading, executing, or playing of the electronic storage media file to seamlessly produce an output in real-time that is indistinguishable from the uncorrupted file.

Abstract: A method for filtering a table may include creating a filter in response to a user selecting data in a first table. The method may also include applying the filter to at least one other table in response to a user selecting at least one column in the at least one other table.

Abstract: A data transfer system capable of lightening the load on a server and reducing the amount of data carried over a network. A search/registration unit of the server determines whether or not shape data in graphics information created by a three-dimensional application is registered in shape cache information and, if not registered, registers the shape data. If the shape data is registered, a data transfer unit replaces the shape data with designation information specifying the corresponding data in the shape cache information to generate graphics differential information, and transmits the generated information to a client. A registration unit of the client registers new shape data in shape cache information in accordance with the graphics differential information. A data restoration unit searches the shape cache information based on the designation information to extract the corresponding shape data, and replaces the designation information with the shape data to restore the graphics information.

Abstract: Join expressions, expressed in terms of objects, are translated into a relational database join statement by generating a parse tree based on the join expression. The parse tree is traversed to build the relational database join statement.

Abstract: One embodiment of the present invention provides a method and a system for performing a nearest-neighbor matching operation using a parallel hybrid spill tree. During operation, the system receives an object to be compared to a set of objects stored in the parallel hybrid spill tree. The system first searches a “top tree” of the parallel hybrid spill tree to identify a partition that is likely to contain a nearest neighbor of the object. Each node in the top tree defines an associated partition for the parallel hybrid spill tree. The system then searches a “leaf sub-tree” of the parallel hybrid spill tree that corresponds to the associated partition in an attempt to identify the nearest neighbor of the object.

Abstract: A system and a method for a structurally decoupled exchange of objects deposited in variable object-oriented data structures is performed. In a first tool, at least one first object-oriented data structure is deposited and for each object coming from the first tool, of the first data structure, one unambiguous identification mark is allocated. In a second tool, at least one second object-oriented data structure is deposited and for each object, of the second data structure, the unambiguous identification mark of the associated partner object and at least one path information item over the hierarchical position of the associated partner object with the hierarchical position of the object of the second data structure from the first data structure is allocated. A module for comparing the structures taking into consideration the identification marks and path information, is provided, for determining the differences of the structures.

Abstract: A method is disclosed for analyzing computer events recorded in a plurality of computer datasets. The method includes a read module configured to access chronicle records in two datasets, an extraction module configured to extract a timestamp from each chronicle record, a generation module configured to generate a chronicle time indicator for each chronicle record based on the extracted timestamp, and a placement module configured to place the generated chronicle time indicator into the associated chronicle record. Typically, chronicle records in a first chronicle record have records with desired timestamp characteristics while chronicle records in a second dataset have chronicle records with incompatible timestamp characteristics. The method generates the chronicle time indicator to be compatible with desired timestamp characteristics of the first dataset and place the generated chronicle time indicator in each incompatible chronicle record.