Abstract: A method, apparatus, article of manufacture, and data structure for use in efficiently generating sequence numbers in a multi-system data-sharing environment. Sequence number assignment logic, performed by a computer system, generates a recoverable, unique sequence number for assignment to an application, wherein the sequence number is contained in a control page stored in a database on a data storage device coupled to the computer system and shared with other computer systems, and updates to the control page are serialized across all of the computer systems.

Abstract: Provided is a method, system, and program for automatically handling an error when retrieving a file for an application. An error is detected while the application retrieves a file from the storage device. A user defined policy is checked to determine whether a backup copy should be restored, and the file is restored from the backup copy if the user defined policy indicates that the backup copy should be used.

Abstract: A data processing apparatus in which attachment of removable memory card is detected and it is determined whether or not binary data is stored in the memory card. If it is determined that binary data is stored in the memory card, it is further determined whether or not meta data is stored in the memory card. If it is determined that the meta data is stored, the meta data is added to the binary data. If it is determined that no meta data is stored, meta data registration processing is started, and addition processing is performed after registration of the meta data. On the other hand, if it is determined that no binary data is stored, the registration processing is started to register the meta data in the memory card.

Abstract: A method for acquiring order information data from a server controlling the order information for medical imaging system, and controlling the order information, comprises the steps of; storing order information data acquired from the server, in a memory device; detecting a change of the order information data in the server; and acquiring the changed order information data from the server to store in the memory device when the change of the order information data in the server is detected.

Abstract: A storage system which supports distributed management of client configurations by storing such configuration information for a number of products across the storage network in a central repository is provided. The system further includes an external parser configuration file to provide a framework allowing users to access configuration data. The parser is separate from the configuration information repository. The parser is key-driven and extensible, facilitating programming, updates and modifications without modifying the binary library containing the configuration information.

Abstract: A method, apparatus, and computer readable medium for searching and navigating a document database is provided. Document categories are assigned unique numeric category identifiers. Each document in a database is assigned to one of the document categories. Metadata is associated with each electronic document that includes the numeric category identifier corresponding to the category assigned to the document. The database may be searched or browsed based on category by utilizing the metadata. URLs may also be embedded in a Web page that includes a list of document identifiers and an index. The list of document identifiers is a list containing the identities of an arbitrary number of search results. The index identifies one of the documents in the list of document identifiers to be retrieved. When such a URL is selected, a Web server computer utilizes the list of document identifiers and the index to identify the document to be returned.

Abstract: A set of keyword candidates having orientation, with keywords input by a user as an origin, is appropriately presented.

Abstract: Aspects of the invention provide methods for rewriting and computing database queries that include outer join conditions, and for determining columns that satisfy a criteria. According to one aspect, a component relation key is assigned to each unique column in a first table and an aggregate relation key is generated for each record in a second table, wherein the aggregate relation key is based on one or more of the component relation keys corresponding to columns with non-null values from the second table. Distinct aggregate relation keys are determined, and an original query with an outer join is rewritten into at least a number of sub-queries equal to the number of distinct aggregate keys, wherein each sub-query includes a join condition based on each column represented by the respective distinct aggregate keys. Significantly, the combination of sub-queries is logically equivalent to the original query, but does not include outer join conditions. Therefore, a more efficient query is provided.

Abstract: A method and apparatus to accelerate variable length decode is disclosed, including a method and an apparatus to initialize data structures. The initialization apparatus includes a start address storage region to receive a start address from a processor and a memory access engine coupled to the start address storage region. The memory access engine writes a predetermined pattern to a data structure located in a memory device. The data structure is defined by the start address stored in the start address storage region and is further defined by a predetermined data structure size.

Abstract: A semantic network is disclosed herein that is useful for identifying word patterns in text. The semantic network may be used to identify word patterns accurately and substantially in real time. The semantic network is comprised of recognized words, which form word patterns, and objects, which are identified by certain of the word patterns. The word patterns are located at nodes in the semantic network. The nodes are linked in a hierarchical structure, with varying, identifiable levels. Under the method of building a semantic network, a computer program is provided and loaded onto a computer. The software is preferably linked with a knowledge base from which identified objects can be obtained. The objects are each classified by object type as they are received. Each object has a label which corresponds to a upper level word pattern. The word pattern is parsed or “tokenized” and combinations of the words in the label are assigned as word patterns at various nodes.

Abstract: Automatic categorization of a financial transaction based upon a mapping of useful characters from the transaction's description to a financial category. The description of the financial transaction is parsed to identify one or more useful strings of characters. A data file of business names is then searched for a match with the parsed string or strings from the transaction description. The data file is optimized to minimize both lookup times and the size of the data file by representing business-name-to-financial-category mappings using a serialized trie accessed via a memory mapped file. Nodes of the trie having children but no siblings are compressed into dangling nodes. A table of shared suffixes is also used. If a match is found in the business name data file, then the transaction is categorized according to the corresponding business name to financial category mapping. Otherwise, the transaction may be categorized based upon a match found in a database of financial transaction description keywords.

Abstract: A database including vertical tables useful for storing large numbers of objects having potentially thousands of attributes in, e.g., e-commerce applications. To support querying the vertical database using conventional SQL, a horizontal view over the underlying vertical tables is defined, and then queries are posed against the view. The queries are automatically transformed and executed against the vertical tables. If desired, the query results can be transformed back to a horizontal format. In this way, it appears to the user that a conventional horizontal data format is being used.

Abstract: This invention relates to a computer implemented automated remote support in a computing system that utilizes machine learning to provide constantly improving support capability. It comprises a means for parsing input requests, means for automatically executing test cases, a Database for storing data pertaining to behaviour of products and Multiproduct combinations, as well as searching means for searching through the Database for previous occurrences of similar requests. An Expert System utilizing machine learning capabilities generates the final solution and constantly updates the organization of the data in the Database in order to improve the effectiveness of subsequent searches.

Abstract: A content-based image retrieval system retrieves an image based on an angular radial transform (ART) image descriptor. In the content-based image retrieval system, a method for retrieving an image includes the steps of: a) receiving a query image; b) extracting a query image descriptor from the query image based on at least an angular component and a radial component of the query image; c) comparing the query image descriptor with an image descriptor stored on the database; and d) determining a degree of a similarity between the query image descriptor and the image descriptor stored on the database.

Abstract: Query results and statistics regarding them are generated using a novel representation of an n-attribute relation as an order n relational tensor. Orders of the relational tensor respectively correspond to each of the attributes, and each coordinate along an order relates to a key value of the corresponding attribute. Numeric values are stored in the relational tensor, each numeric value representing a count of tuples having the attribute key values that correspond to the coordinate of the numeric value along the orders of the relational tensor. This storage representation is useful in a variety of contexts for enhancing the performance of a RDBMS system. Specifically, a data-representing relational tensor can be used to produce results for operations such as SQL restriction operations using IN and EXISTS criteria.

Abstract: A plurality of actions are applied to a directed graph, where the directed graph has a plurality of nodes. A node in the directed graph is traversed to, and an specific method for each of the plurality of actions is performed on the traversed-node. The traversing and performing are repeated until all nodes in the directed graph have been traversed to. Only a single traversal of the directed graph need be performed to apply all of the actions to the directed graph. The plurality of the actions are in the form of a chain. Each action has an action object pointer, and the actions include a base action at a tail end of the chain and at least one chain action at a head end of the chain. The action object pointer of each chain action points to an immediately adjacent action toward the tail end of the chain, and the action object pointer of the base action points to the chain action at the head end of the chain.

Abstract: A workflow management system provides an integrated approach to exchanging information real-time and notifying responsible persons of pending deadlines concerning a particular deal. The web-based system includes a server having a centralized database of deal data and at least one client system facilitates a method of uploading initial proposed deal data, notifying an underwriter of the uploaded proposal, uploading a workflow timeline for the proposed deal and notifying responsible persons that actions for tasks are due according to the timeline. The workflow management system is further configured to restrict database access to authorized users for viewing of and providing updates to the deal.

Abstract: The search engine of the present invention combines the rated index of the content of a web site with the correlation of links to other sites to provide a logical grouping of related sites and enhanced search engine ranking capability. Further, the search engine enhances the results by indicating the closest groupings to the desired topic and iteratively refining the search results. Moreover, the search engine may be utilized to search through any types of data or information having links, pointers or other indicators to other data related in any fashion. For example, the present invention may be utilized to search through data containing documents listing or citing other related documents by specific identification (e.g., case law, patents, various newspaper or other articles, etc.), whereby a search query may result in finding initial documents satisfying the query and other documents related to those initial documents.

Abstract: Entries which become lookup objects and have variable length comparison conditions are divided into a plurality of groups, a representative lookup key is taken as lookup data for each group, and mask data that sets a range for matching with a match candidate, as well as comparison object data, is stored in masked lookup memory so that setting can be made for each of the entries. Information corresponding to the groups that match the lookup conditions is obtained from the masked lookup memory, and the lookup object entries are limited to the data within the object group. Further, the entries, which become lookup objects, are classified into a tree state, with nodes adopted at points where bit values are either “0” or “1”, in order from the first bit, and lookup for matching entry is performed after the entries are limited to the data within the object groups.