Abstract: A method and system for accessing a large object (LOB) that belongs to a cell in a table are provided. An index is built on a column in which the cell resides. The index has a key that includes a LOB identifier. A database server receives from a client a request to access the LOB. The server uses a LOB identifier value for the LOB to traverse the index to locate an index entry for the LOB. The server then follows address information contained in the index entry to a storage containing at least a portion of the LOB and accesses the portion of the LOB as specified in the request. A method and system for tracking storage for data items are also disclosed. Within an index that is built to access the data items are stored both index entries for locating blocks that store current versions of the data items, and index entries for locating blocks that store non-current versions of the data items.

Abstract: In a text mining technique, if the system only extracts characteristic words and phrases frequently cooccurring with the respective components of an analysis axis as an analysis condition, similar words and phrases are extracted for any component. To clearly indicate existence of characteristic words and phrases which do not appear as cooccurrence words and phrases for other components of the analysis axis, it is desired to appropriately present distinguishable features between the components to the user. For this purpose, the frequency of appearances of a plurality of characteristic words and phrases in a document satisfying each analysis condition is calculated. As a result, multiple cooccurrence words and phrases and component-cooccurrence words and phrases are discriminatively displayed. It is therefore possible for the user to appropriately analyze the contents of a plurality of documents.

Abstract: A method and system are described in a data processing system including a database for efficiently retrieving copies of data rows from the database. Query criteria is received by a server from a client which specifies search criteria describing data rows and which requests a particular number of the data rows to return. Each of the data rows is associated with a unique primary key which uniquely identifies a particular data object. The primary key for each of the data rows meeting the specified criteria is first retrieved from the database by the server. Thereafter, copies of only the particular number of the data rows are retrieved from the database using the primary keys. Copies of only the particular number of data rows are then returned to the requesting client.

Abstract: A method and apparatus for parallel execution of trigger actions. One or more embodiments of the invention comprise providing a C++ class (hereinafter referred to as “dispatcher”) that can take an SQL query or trigger action and start parallel execution of the trigger action. The trigger action is optimized and parallelized. The dispatcher executes the trigger action, sets up the communication links between the various operators in the trigger action, and ensures that all the results are sent back to the trigger.

Abstract: A computer method for enhancing distribution centers management. The method includes the steps of providing a demand database comprising a compendium of individual demand history; providing a distribution database comprising a compendium of at least one of distribution centers management solutions, distribution centers information, and distribution centers diagnostics; and, employing a data mining technique for interrogating the demand and distribution databases for generating an output data stream, the output data stream correlating a demand problem with a distribution solution.

Abstract: The present invention provides a method and system for interaction between a browser engine and an application. The application includes a plurality of function modules. When the application is initiated, it sends a request to the browser engine. After the browser engine receives the request, it downloads a browser display in response to the request. The browser display includes a plurality of function icons. Each of the function icons corresponds to one of the function modules of the application. When a user selects one function icon on the browser display, the browser engine initiate the function module of the application corresponding to the function icon so that the application executes a specific function.

Abstract: Searching online catalog databases by shoppers is improved by performing similarity searching on searches performed by the shopper, in conjunction with adjusting the similarity metric used during the search to interactively improve the relevance of the resulting search results to the shopper. This involves using relevance feedback and/or product redefinition to learn the “implied concept” of the shopper's stated product requirements; that is, the quality of the search results is enhanced through understanding the concept implied by the shopper's queries by, for example, learning from the product results marked as “relevant” or “irrelevant” by the shopper. This approach is in contrast with attempts to enhance search results using, for example, the shopper's past orders or previous actions, or the past orders or previous actions of other shoppers who may have a purchase history similar to that of the current shopper.

Abstract: A data storage and management apparatus for storing and managing data of an object as a persistent object in a data storing system. When storing an object in the data storing system, information on complexity of data of at least one attribute of the object is recorded in the apparatus, and data of each of the at least one attribute of the object is stored in a first table in the data storing system when the data of the attribute is not complex data, and in a second table in the data storing system when the data of the attribute is complex data. When manipulating data of an attribute of the object in the data storing system, the above information on complexity is referred to, and manipulation is performed on the first table when the data of the attribute is not complex data, and on the second table when the data of the attribute is complex data.

Abstract: This invention includes the step of transmitting a query to a set of search engines. Any result lists returned from these search engines is received, and a subset of entries in each result list is selected. Each entry in this subset is assigned a scoring value according to a scoring function, and each result list is then assigned a representative value according to the scoring values assigned to its entries. A merged list of entries is produced based upon the representative value assigned to each result list.

Abstract: Data available in a system is identified. Each data is categorized as a scalar data or a tabular data. The tabular data is associated with data from a table and the scalar data is not. Each data is further categorized as a parameter data or a statistic data. The statistic data is pulled from the system. The parameter data is either pulled from the system or pushed to the system. The data is grouped into groups based on logical relationships of data in the groups. A blank form is developed for each group of data. Each blank form has one or more fields defined to accommodate the data in the group. Using the blank form, the data is pushed to the system and to pulled from the system.

Abstract: A content searching/providing system searching a record content from a randomly accessible memory storing contents and providing the record content to a user is provided. The system comprises: a content classification unit classifying the record contents of the memory in accordance with a predetermined rule; a channel assignment unit assigning a virtual channel to each classification; a content arrangement unit arranging the record contents classified into the same classification on the corresponding virtual channels; a user operation receiving unit receiving a user operation for commanding channel selection and content search on a channel; and a content providing unit acquiring a record content from a selected virtual channel in response to the user operation received via the user operation receiving unit and providing the record content.

Abstract: An internet presentation system includes an internet accessible server that permits access to a database of editable and executable presentation files to select users with a specific type of periphery device. The periphery device, or projector, includes a hardware ID used by the server to authenticate the user. The server additionally maintains an administration mode by which select administrators may create and edit template files and color scheme files required, but not editable, by the select users. The server also maintain statistic of the select users and their activities. The administrators use the statistics to target template and color scheme files for deletion and editing.

Abstract: A method for measuring composite distortion levels using a coherent multicarrier RF signal generator having incrementally related frequencies is disclosed. The invention provides for the use of a coherent multicarrier signal generator that permits arbitrary RF carrier phase control on an individual carrier basis in order to enable sequential distortion measurements under varying carrier phase conditions. In order to obtain measurement results that match those obtained by the use of prior art non-coherent signal sources, the present invention provides for averaging of distortion measurement results over a ‘phase configuration ensemble’ that is obtained by multiple sequential measurements, in which the individual carrier phases for each measurement are preselected at random.

Abstract: A storage format and methods for improving the performance of the symbol table of an encoded vector index. The symbol table comprises a hash table, entries of the hash table storing associated key values and codes for the encoded vector index. Hash table entries store an accumulated count of occurrences of prior and the current key values, which improves the efficiency of responding to a request for a key range count. A binary radix tree is used to locate entries, which comprises a plurality of nodes, corresponding to binary digits of a binary representation of a key value. Codes are assigned to key values for the encoded vector index in a distributed fashion, so there are available code values between existing code values in the code ordering, that can be assigned to new key values, alleviating the need to reorganize the code values upon an insertion.

Abstract: The present invention provides a computer-implemented method and system for optimally packing a plurality of randomly sized and shaped articles into a container. In particular, the invention determines the preferred packing configuration in a preferred container for packing a plurality of randomly sized and shaped articles in a customer order wherein particular articles in the order have specialized shipping requirements. In determining the preferred packing configuration, the method and system uses criteria based upon particular characteristics of the articles, the cost of packing labor, packing material, and delivery of the packed container. In a particular embodiment, the preferred packing configuration is displayed graphically or as written instructions and the container is packed manually.

Abstract: An apparatus, program product and method integrate virus checking functionality into a computer database search environment to assist in protecting a user computer from contracting a computer virus when accessing search results. The generation of a display representation of a result set generated in response to a search request may be based at least in part upon virus status information associated with at least a portion of a plurality of result records identified in the generated result set. Moreover, an apparatus, program product, and method configure a first computer to receive virus status information generated by a plurality of computers, with such received virus status information stored in a virus database that is accessible by the first computer.

Abstract: The present invention provides a system and method that facilitates data consistency maintenance between two segments of memory. A data consistency maintenance and recovery system and method of the present invention uses a dual page configuration and locking process to store and track data. A primary page is used as the primary data storage location and a mirror page operates as a copy of the primary page, except during certain stages of data manipulation operations. In one embodiment the present invention facilitates consistency maintenance during a write operation to a database. The present invention also facilitates data recovery following a system or process crash.

Abstract: A data import system enables access to data of multiple types from multiple data sources of different formats and provides an interface for importing data into a data analysis system. The interface enables a user to customize the formatting of the data as the data is being imported into a data analysis system. A user may select first user defined options for operating on a first data set received during a data importation process. An intermediate representation of the data set is generated based on the user first defined options. A user may specify second user defined options based on the intermediate representation during the data importation process. The second user defined options are processed to produce a final data representation of the data set to be used for analysis of the data. The intermediate representation may be a data table. The processing of a data set may include merging a first and second data set to produce the final data representation.

Abstract: Storing data mining clustering results in a relational database for querying and reporting, including reading, from a hierarchical clustering node, clustering data describing a clustering, and recording the clustering data in a relational clustering record; reading, from a hierarchical cluster node embodied in the hierarchical representation of data mining results, cluster data describing a cluster, and recording the cluster data in a relational cluster record; reading, from a hierarchical cluster attribute node embodied in the hierarchical representation of data mining results, cluster attribute data describing a cluster attribute, and recording the cluster attribute data in a relational cluster attribute record; reading, from a hierarchical cluster attribute bin node embodied in the hierarchical representation of data mining results, cluster attribute bin data describing a cluster attribute bin, and recording the cluster attribute bin data in a relational cluster attribute bin record.

Abstract: The present invention relates to a method for synchronizing databases in a network environment. Specifically, the present invention pertains to a method of using a set of hierarchical rules to enable an efficient and speedy synchronization between multiple copies of a database. The present invention enables an “n-way” synchronization of databases where “n”, the number of databases synchronized, is essentially any number more than two. In one embodiment, the present invention provides rule-based, n-way, synchronization by selecting a focus copy of the database, comparing the data records of the focus copy against the same records in other copies of the database to identify those deleted and modified; removing all the records indicated to be deleted, modifying those to be modified, and adding new record identifiers in the case of multiple modifications to the same record.