Abstract: The present invention generally provides methods, systems and articles of manufacture that provide a database query application that allows user to compose an abstract query that includes a sequence operator. In one embodiment, sequence operators are used to specify which data elements, from a sequence of data elements, should be retrieved for an abstract query. In another embodiment, a sequence operator may be used to specify that a condition included in an abstract query should be evaluated against particular data elements of the sequence.

Abstract: In an embodiment a method is provided. The method includes receiving forecast information in a computer from a first group of users. The method also includes integrating the forecast information into a database and corresponding OLAP cube accessible by the computer. The method further includes receiving comments on specific entries of the forecast information in the computer from a second group of users. The method also includes receiving changes of the forecast information in the computer from a second group of users The method further includes integrating comments and changes into the database and OLAP cube. Moreover, the method includes providing a display of the comments and the changes to the first group of users in an interface to the computer.

Abstract: The invention provides an evaluation system for reliably evaluating large amounts of content. The evaluation system is managed by a primary authority that designates one or more contributing authorities by delegating to each a specific quantity of authority. Each contributing authority may in turn designate and delegate authority to one or more additional contributing authorities, subject to the restriction that the total quantity of authority delegated does not exceed the quantity of authority the contributing authority was itself delegated. Each contributing authority, and optionally the primary authority itself, may evaluate one or more portions of content by associating a rating with each evaluated portion of content. A composite rating for a particular portion of content may then be determined based upon the ratings associated with the portion of content.

Abstract: A method and system for propagating the relevance of labeled documents to a query to unlabeled documents is provided. The propagation system provides training data that includes queries, documents labeled with their relevance to the queries, and unlabeled documents. The propagation system then calculates the similarity between pairs of documents in the training data. The propagation system then propagates the relevance of the labeled documents to similar, but unlabeled, documents. The propagation system may iteratively propagate labels of the documents until the labels converge on a solution. The training data with the propagated relevances can then be used to train a ranking function.

Abstract: A method and system for controlling an application server in order to provide application services to clients while maintaining synchronization between records of tables of a database server. An application server retrieves records of tables and stores them locally on the application server. When a client requests some fields of a record of a table, the application server generates a bookmark that uniquely identifies the record. The bookmark may contain a table identifier and a record identifier or a query identification and an identifier of a record within the query result. The bookmark is opaque to the client and only the application server need know how to interpret its contents. When the application server provides the requested fields of the record to the client, it also provides the record bookmark to the client. When the client wants to identify the record, it uses the bookmark provided by the application server.

Abstract: A query result set is an example of a type of body of data whose content is defined by a query. Modifications to a database can change the result of a query and therefore what the content of such a body of data, such as a result set, should be. Active Queries is an approach that enables a database server to detect database changes that alter the result of a query registered for a client and to notify a client of those changes. The notifications may be sent to, for example, a cache manager responsible for maintaining coherency of a result set cache generated by the query. The notification notifies the cache manager of when and/or what changes are needed to maintain the coherency of the cache.

Abstract: Using an ontology to perform an information search utilizing a meaning given to information on a network without being required to perform complicated operations for forming an inquiry sentence in conformity with the ontology. A pre-stage before a search engine provides an information search supporting system having a morpheme analysis section, a syntactic and semantic analysis section, and a conversion execution section which converts a natural language sentence on which syntactic analysis and semantic analysis have been performed into an inquiry sentence described in an ontology description language by referring to a case frame ontology dictionary in which are stored information indicating to which property in an ontology does the relationship among a predicate, a subject and an object in the natural language sentence correspond and the case frame of the natural language sentence in the property.

Abstract: In certain embodiments, a database system for processing a query request comprises at least one master node operable to store a precompiled query that is capable of resolving a query request received by the database system. The at least on master node is further operable to receive a query request comprising one or more parameters and associated with the precompiled query, and to communicate a request to perform one or more activities associated with the precompiled query. The system further comprises a plurality of slave nodes coupled to the at least one master node, each of the slave nodes operable to store one or more key parts each comprising data capable of resolving a portion of the precompiled query. At least one of the slave nodes is operable to receive the request communicated by the at least one master node and to process the request communicated by the at least one master node.

Abstract: The disclosed embodiments enable multi-stage query scoring, including “snippet” generation, through incremental document reconstruction facilitated by a multi-tiered mapping scheme. The mapping scheme includes a first mapping between unique tokens contained in a set of documents and unique global token identifiers (e.g., 32-bit integers) contained in a global-lexicon (i.e., dictionary). The mapping scheme also includes a second mapping between the global token identifiers and a set of fixed-length local token identifiers (e.g., 8-bit integers) contained in one or more mini-lexicons (i.e., sub-dictionaries). Each mini-lexicon is associated with a range of token positions in the tokenized documents. The first and second mappings are used to encode/decode documents into local token identifiers having fixed widths which can be compactly stored in the tokenspace repository. The use of fixed-length local token identifiers allows for fast and efficient decoding of tokenized documents.

Abstract: The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.

Abstract: Described are a system and method for accepting a string-based search expression, parsing the search expression into an expression tree, distributing the tree (or portion thereof) across heterogeneous repositories, and merging the results. The system is data-location transparent, encapsulates a federation model within query nodes and query trees. A client application produces and issues the search expression to the system. One type of expression tree node is an attribute node corresponding to an attribute included in the search expression. Metadata is associated with the attribute node for identifying each repository that supports the attribute represented by that attribute node. A call passes to the expression tree to perform the search, which occurs in a recursive-descent traversal of the tree. The search completes in a single tree traversal. Sub-trees receive a relevant portion of the search expression to translate into a query expression specific for each type of searched repository.

Abstract: A method and apparatus for reporting policy violations in messages is described. In one embodiment, a violation is identified by detecting fragments in a message that match information from any one or more rows within a tabular structure of source data. The fragments that match this information are then specified as part of reporting the violation.

Abstract: Access to selected content in different file formats can be managed by conducting, in a single purchase transaction, a user purchase of access rights that allow a user to acquire multiple copies of the same selected content in media files having different file formats. An authorization signal is communicated to a content provider or multiple content providers who did not conduct the purchase transaction. The authorization signal contains information that allows the content provider or the multiple content providers to authorize the user to acquire multiple copies of the same selected content in different file formats without requiring the user to conduct multiple transactions. Each copy of the selected content acquired from a content provider is in a media file having a different file format.

Abstract: A method, computer program, and database system are disclosed for querying tables stored on multiple processing modules. The method includes specifying module group characteristics. A plurality of modules corresponding to the module group characteristics are then identified. The identified modules are sampled for statistics concerning at least one table specified in a query. An execution plan for the query is optimized based at least in part on the sampled statistics.

Abstract: A method of and system for evaluating contacts stored in data source. In one embodiment the method allows a user to define a data format; allows a user to define a plurality of rules intended to operate on and assess a quality of data formatted according to the data format; map data identifying a plurality of contacts from the data source to the data format; and execute the plurality of rules on the mapped data to produce a set of analyzed data that allows evaluation of potential contacts according to an assessed quality of the data.

Abstract: Two or more interrelated hierarchies within a set of performance data may be integrated into a single hierarchy. The single hierarchy may be provided in a single user interface to allow a user to navigate the single hierarchy. By navigating through the single hierarchy, a user may view relationships between application elements, cumulative performance data for categories and elements, and other information. A single integrated hierarchy includes a sequence of node types. The node types for an integrated hierarchy may include categories, relationships and elements. The node types may repeat as a sequence within the hierarchy, and more than one node type may be combined into a single level of the hierarchy. Aggregated metrics such as response time may be displayed with the integrated hierarchy.

Abstract: An iterative search technique is used to quickly and accurately locate information in a database, such as one storing information about digital versatile discs (DVDs). First, a presumably unique search key is generated for an unidentified DVD and compared with corresponding keys in a database. If no match is found progressively less specific information is used to generate a series of search keys that are similarly compared with corresponding keys in the database. If at least one possibly matching record is found, it is determined whether the best matching record can be considered a match, otherwise, less specific information is used to search for a match until predefined least specific information is used.

Abstract: The invention provides an evaluation system for reliably evaluating large amounts of content. The evaluation system is managed by a primary authority that designates one or more contributing authorities by delegating to each a specific quantity of authority. Each contributing authority may in turn designate and delegate authority to one or more additional contributing authorities, subject to the restriction that the total quantity of authority delegated does not exceed the quantity of authority the contributing authority was itself delegated. Each contributing authority, and optionally the primary authority itself, may evaluate one or more portions of content by associating a rating with each evaluated portion of content. A composite rating for a particular portion of content may then be determined based upon the ratings associated with the portion of content.

Abstract: Methods, apparati, and products are provided, including running a hashing algorithm against a portion of a file to generate a hash value, determining whether the hash value is substantially similar to a stored hash value associated with another portion of another file, the portion and the another portion being standardized, and identifying a location of the another file if the hash value is substantially similar to the stored hash value associated with the another portion of the another file.

Abstract: A user interface may be provided that allows a user to select one or more stored items and display metadata attributes for those items. The user may further specify modifiers for one or more of the metadata attributes and perform searches based on selected ones of the metadata attributes and/or selected ones of the modifiers. In addition, a descriptive phrase may be automatically generated for one or more items. The descriptive phrase may be generated based on one or more of the metadata attributes. In doing so, metadata attributes may be converted to more user-friendly forms and collected into a sentence or other phrase. The descriptive phrase may be attached to the one or more items.