Abstract: A computer-implemented method and system for processing a document such as a structured document in which information such as a term, name and belonging department is used as shared information and word consistency or modification can be automatically and easily reflected on all documents.

Abstract: The present invention is a computer-implemented method for detecting and scoring similarities between documents in a source database and a search criteria. It uses a hierarchy of parent and child categories to be searched, linking each child category with its parent category. Source database documents are converted into hierarchical database documents having parent and child objects with data values organized using the hierarchy of parent and child categories to be searched. For each child object, a child object score is calculated that is a quantitative measurement of the similarity between the hierarchical database documents and the search criteria. A parent object score is computed from its child object scores using an algorithm.

Abstract: Systems and methods consistent with the present invention provide an automated manager for an electronic mail archive repository. A method of archiving electronic messages consistent with the present invention creates a repository that holds all electronic messages consistent with a set of rules for archive storage. An interface allows clients to retrieve electronic messages from the repository based upon rules limiting access to the repository. Methods and systems, as broadly described herein, comprise a message archive containing a plurality of messages, each having a client identifier and an archive token, and permit a requester access to select messages in the message archive based on an identifier for the requester and consistent with rules for archive retrieval.

Abstract: Disclosed is a method, system, program, and data structure for transforming at least one column in a database input table. An input data table has multiple columns and rows. A determination is made of multiple data column names and multiple pivot columns in the input table. A row is generated in an output table for each data column name, having one data column name field including one data column name and at least one pivot column field including the value in one pivot column field in the input table, wherein each of the rows in the output table for each data column name has different values in at least one of the data column name field and pivot column field.

Abstract: A distributed proxy server is provided which reduces a delay associated with the retrieval of inline objects of web pages retrieved over a satellite link. The distributed proxy server includes a first component which runs on the browser side of the satellite link and communicates with web browsers, and a second component which runs on an Internet side of the satellite link and communicates with web servers. When a web page is requested over the satellite link and communicates with web servers. When a web page is requested over the satellite ink, the second component determines whether the parent file includes any references to inline objects, and prefetches each such inline object. The prefetched objects are transmitted over the satellite link to the first component, which in-turn stores the prefetched objets in a cache and provides the prefetched objects to the requesting web browser.

Abstract: A database system includes a trigger gateway for implementing trigger functionality. The trigger gateway is located at a communication point between a user and a database system. The trigger gateway receives database commands destined for the database and processes triggers associated with the database commands. Where appropriate, the trigger gateway forwards the database command to the database. A trigger action server, which is located remote from the trigger gateway, may execute trigger actions in response to trigger execution requests sent from the trigger gateway. Alternatively, trigger actions may be executed within the trigger gateway. Trigger processing includes the processing of triggers after failed database commands. Security features are implemented to prevent unauthorized database access through the use of triggers.

Abstract: An image search and retrieval system for searching and retrieving a desired image from a collection of images is provided. The system includes a computer and a plurality of images accessible by the computer. Each of the images has associated therewith an image profile also accessible by the computer. A plurality of selection probability functions are provided, which are set to initial values at the beginning of the search. Software executing on the computer selects a plurality of images based upon the relationship between the profile for each image and the values of the selection probability functions, and displays the selected images. Software executing on the computer receives an indication of at least one chosen image and adjusts the value of each of the selection probability functions based upon the profiles of the chosen images.

Abstract: A loyalty file structure for a smart card includes any number of loyalty files preinstalled by a card manufacturer. Each loyalty file has a password, a file number, a label, an indicator of whether or not the file is currently being rented by a merchant, a length indicator, a data format indicator, and a data region. An issuer creates a unique password for each loyalty file on a card and then issues cards to customers. For customer enrollment at a point-of-sale, a merchant determines if a loyalty file is available. The merchant password is sent to the issuer on-line in real time and is returned along with authorization from the issuer to replace the password of the loyalty file with the merchant password. The file label is changed to a merchant identifier and the file is indicated as being rented. The merchant sends payment or a credit transaction to the issuer for use of the loyalty file.

Abstract: An apparatus and method for efficiently compressing contents of a database system to support ad hoc querying and OLAP type aggregation queries. This invention consists of a new compressed representation of the data cube that (a) drastically reduces storage requirements, (b) does not require the discretization hierarchy along each query dimension to be fixed beforehand and (c) treats each dimension as a potential target measure and supports multiple aggregation functions without additional storage costs. The tradeoff is approximate, yet relatively accurate, answers to queries. We outline mechanisms to reduce the error in the approximation. Our performance evaluation indicates that our compression technique effectively addresses the limitation of existing approaches. The basic method relies on representing the contents of the database by a probability distribution consisting of a mixture of Gaussians.

Abstract: A system and method for synchronizing database information over a communications network distributed among a plurality of servers. The system allows each server to track the state of a replica on each of the servers, and changes to the servers are communicated between the servers along with their states. The states may be stored as an array of timestamps, the timestamps each indicating a time at which the replica on each server was updated. In a network wherein two servers (a first and third server) cannot communicate directly, a first network server transmits a change to an intermediate (a second) server including its state information. The second server transmits the change to the third server, and the third server updates its replica. The third server transmits its state information to the second server, and the timestamp information is conveyed to the first server. The state information of the third server may be transmitted to the second server during later updates of the third server's replica.

Abstract: An document image that is the source of Optical Character Recognition (OCR) output is displayed so that a user can select a region of the displayed document image. When the region is selected, text of the OCR output corresponding to the selected region is submitted as an input to a search engine.

Abstract: A method is provided to facilitate the re-creation of a destroyed database system by saving the database configuration data into a database configuration file. A human-readable database configuration file is created by retrieving configuration data from the system databases as well as the user databases. The database system can be configured so that periodically a procedure is automatically run to create the database configuration file. The procedure also creates scripts which can be executed to re-create a database.

Abstract: A method and apparatus provides network management data in a manner that can be more efficient than data provided using conventional SNMP. A requested data description is received containing the names of the data requested, and this requested data is provided. Tables are provided by providing a table name, a list of columns, and for each row in the table, the name of the row and the data for the row in the order the column names were provided. Rows may be provided in the order stored, or numerically by row name. All columns of every row of a table may be provided or just columns specified in the requested data description.

Abstract: There is provided a processing system capable of preventing third parties from improper operation. Referring to FIG. 4, a storage device generates a pseudo random number (key data k), calculates a value g (k) of a function g, rearranges each bit of the key data k and value g (k) in accordance with a predetermined method, transmits them to a terminal device, and calculates a value f (k) of a function f. The terminal device receives data and calculates a value g (k). The terminal device compares the value g (k) received from the storage device and the value g (k) calculated by the terminal device. If the values do not match, access to the storage device is stopped. If the values match, the terminal device calculates and transmits value f (k) to the storage device. The storage device compares the value f (k) calculated by the storage device and the value f (k) received from the terminal device and responds to a result of the comparison by determining whether to permit access from the terminal device.

Abstract: Property linking for object-oriented computing environments. In one embodiment, a computer-implemented method including first linking a second property of a second object to a first property of a first object, according to a predetermined criteria. When an event occurs regarding a change in the first property, the change is examined in relation to the predetermined criteria, to determine whether the change in this property necessitates a change in the second property. If it does, then the second property is changed in accordance with the predetermined criteria.

Abstract: In a distributed computing system, a first process may register interest in an event occurring in another address space or physical machine in such a way as to allow the subsequent notification of the event's occurrence to contain an object that includes methods that are to be run on receipt of the notification. When the notification is received, either by the first process or by some other entity designated by the first process to be the final point of notification, the methods may be executed as specified by the first process.

Abstract: A computer-implemented system and method for allowing users to interactively develop search queries is provided. The system performs query development utilizing a hierarchical concept tree stored in memory, wherein the nodes of the concept tree are concepts that describe various search topics. Parent/child relationships are created between the concepts, with children concepts describing sub-categories of a parent concept, and so on. Any concept at any level in the tree structure may be related to one or more character strings descriptive of the related concept. Query development is performed by traversing the various relationships in the hierarchical tree structure to selectively add related character strings to a potential query. According to one embodiment, the user is allowed to control the manner and extent of the traversal, and is further allowed to de-select any located concepts and character strings for further use in query development.

Abstract: Character data of a word or phrase in a document is designated. Desired data is retrieved from a predetermined database on the basis of the designated character data. One sentence including at least the designated character data is cut out and subjected to sentence analysis. On the basis of a sentence analysis result, specific data is selected from the retrieval result acquired from the database. In addition, character data of a word or phrase in a document is designated. One sentence including at least the designated character data is cut out and subjected to sentence analysis to extract a keyword. A retrieval condition is prepared on the basis of the extracted keyword, and desired data is retrieved from a predetermined database on the basis of the retrieved conditional expression.

Abstract: A method and apparatus are described for computing the value at a given percentile of a population and the percentile of a given value in the population. In the described system, computing efficiencies are achieved by storing received values in “buckets” and performing percentile calculations based on values in the buckets.

Abstract: A deletion method and apparatus for deleting search keys from a data structure stored in the computer storage system comprising a compact multi-way search tree structure. The method deletes in bulk search keys based on the lexical position of the search keys, thereby avoiding repetition searches for search keys requested for deletion.