Abstract: Provided are a method, system and article of manufacture for generating a value associated with one of a plurality of leaf nodes by implicitly randomly climbing an implicit tree having the leaf nodes. A determination is made of an ancestor node of a current node, wherein each ancestor node at a level of the ancestor node is associated with a different set of ordered leaf nodes, wherein there is a unique value associated with each leaf node. A determination is made of a first leaf node of the ordered leaf nodes associated with the determined ancestor node. A determination is made as to whether the determined ancestor node is a rightmost ancestor node at the level of the ancestor node. A first formula is used to determine a last leaf node of the ordered leaf nodes associated with the determined ancestor node in response to determining that the ancestor node is the rightmost ancestor node.

Abstract: A data query system including a first storage medium including a data schema having a data schema query language associated therewith, a second storage medium including an ontology model including classes and properties, the ontology model having an ontology query language associated therewith, wherein constructs of the database schema are mapped to corresponding classes, properties or compositions of properties of the ontology model, and an ontology query processor generating a query expressed in the data schema query language corresponding to a specified query expressed in the ontology query language. A method is also described and claimed.

Abstract: Aspects are introduced for indexing contents of a shell namespace extension. A plurality of files are indexed, and it is encountered that one of the files contains at least one file reference. The file is then accessed as a shell namespace extension so that the file reference can be indexed.

Abstract: The present invention provides a Distinct Author Identification System (“DAIS”) for disambiguating data to discern author entities and link or associate authorships with such author entities. The invention provides powerful disambiguation processes applied across one or more databases to yield a disambiguated authority database of authors. An entire database of publications may be processed by the DAIS to group/link authorships and to identify author entities. The author entities may then be matched or associated with actual authors to establish an authority database of authors. After initial evaluation, the DAIS may be used to reevaluate some or all of the database(s) and/or the authority database established by the DAIS may be used to add or update information. DAIS may use “hierarchical clustering” to link authorships and identify authors based on authorship similarity. DAIS evaluates the likelihood that authorships are from the same author.

Abstract: A method and system for automatically verifying a change to a database. An input file including a test query for the database and an expected output from executing the test query is received. The test query is automatically executed on the database. An actual output resulting from executing the test query is retrieved. Based on a comparison between the actual output and the expected output, a match or mismatch between the actual output and the expected output is automatically identified. If a mismatch is identified, a failure indication is stored that indicates that the database change is invalid and that the database change may initiate a defect in an application coupled to the database. In one embodiment, the change to the database is a change in a services engagement. In one embodiment, the test query is automatically generated in the method and system described above.

Abstract: Seek operations required to perform restore processes at an HFS server are reduced by storing storage addresses of data associated with hash values included in recipes with the recipes. In a typical embodiment, an HFS server receives a recipe for entry into a hash file system and performs a reference check on the recipe to avoid data corruption. This includes using hash values of the associated data to lookup storage addresses for the associated data in corresponding index stripes. The identified storage addresses can be appended to/stored with the recipe when the recipe is stored by the HFS server. Later during a restore process, retrieval of the recipe also retrieves the storage addresses without having to look up the storage addresses in the corresponding index stripes. Consequently, seek operations during restore can be cut in half and the speed of performing the restore can be doubled.

Abstract: A method of transforming and canonicalizing semantically structured data includes obtaining data from a network of computers, applying text patterns to the obtained data and placing the data in a first data file, providing a second data file containing the obtained data in a uniform format, and generating interface specific sentences from the data in the second data file.

Abstract: A resource string associated with output text is identified. A regular expression pattern is generated from the resource string. The regular expression pattern is matched to the output text. A verification result based on the matching of the regular expression pattern to the output text is provided.

Abstract: A method of transforming queries based upon an entity/relationship schema into multi-dimensional expression queries is provided. The method comprises matching an object referenced in an entity/relationship schema based report specification to a corresponding object in the entity/relationship schema, the corresponding object adorned with associated multidimensional metadata; adding the associated multi-dimensional metadata to the object referenced in the entity/relationship schema based report specification; translating the entity/relationship schema based report specification into a multi-dimensional expression query; and retrieving directly all data required to populate a report output of the entity/relationship schema report specification.

Abstract: In a method for determining contextual summary information across documents retrieved in response to a user query applied to a collection of documents the documents matching the query are identified. A query-dependent subsection of each of the matching documents is selected. Document properties associated with the document subsection are selected and associated with localized structures within the document. Relationships between localized document properties and user queries are determined and used to compute contextual summary information, whereby localized document properties are profiled across the retrieved documents in a contextual manner. The method allows a user query to select localized structures within a matching document and is generally applicable in information retrieval and the analysis of retrieved information.

Abstract: Methods and systems verify and control the quality of metadata associated with a media data file. The metadata may be used, for example, by media content recommendation systems. In one embodiment, a first attribute is selected from metadata associated with a media data file and an attribute dependency corresponding to the first attribute is determined. The metadata may be searched to determine whether it includes a second attribute that satisfies the dependency. If the dependency is not satisfied, the metadata is flagged for reevaluation. The metadata may also be flagged for reevaluation, for example, if the metadata includes inconsistent attributes, if the total number of assigned attributes within the metadata does not exceed a predetermined value, or if an expected attribute dimension is missing or does not include an expected number of defined attributes. In certain embodiments, user selections are controlled to provide consistent attribute combinations.

Abstract: Seek operations required to perform backup and/or restore processes at an HFS server are reduced by localizing storage of data referenced by hash values included in a recipe near the recipe. In a typical embodiment, an HFS server receives a recipe and new underlying data for entry into a hash file system. The HFS server identifies a first storage node for the recipe, contiguously stores the new data in the first storage node, and indexes hash values and storage addresses of the new data in storage nodes selected based on the hash values of the new data. Storage addresses for the new data (and other data referenced by the recipe) are appended to the recipe. Later during a restore process, retrieval of the recipe also retrieves the storage addresses. Data pieces stored contiguously can then be collectively retrieved in one seek rather than in separate individual seeks.

Abstract: A system to generate an SQL sub-expression that implement access control rules stored in a library server. The SQL sub-expression is then merged with the SQL passed from an application program interface (API). The access control checking mechanism is implemented on the server side of the content management system. In this client/server environment, the query SQL statement is built in two layers: the API (client) layer and the server layer. The API sends the query string to the underlying stored procedure. The stored procedure then generates the access control logic based on the configuration parameters of the library server. This access control logic is dynamically added to the query string sent by the API. The stored procedure prepares, builds and executes this new query string as a dynamic SQL statement.

Abstract: Some aspects include determination of a data structure including a plurality of query language configuration parameters and at least two values associated with each of the plurality of query language configuration parameters, and generation, based on the data structure, of a first structured language query associated with a first value associated with one of the plurality of query language configuration parameters, and a second structured language query associated with a second value associated with the one of the plurality of query language configuration parameters.