Abstract: An apparatus and method to optimize a query access plan in a computer database system. In preferred embodiments, the query optimizer determines the query can be optimized and generates for the query an optimized access plan that eliminates records defined by a Where clause and one or more ordering criteria prior to ordering the records (sorting or grouping) and then returning a first n rows.

Abstract: A key attribute may be selected for a set of objects in a fact repository. A candidate attribute is identified and objects having an attribute-value pair with the candidate attribute are gathered. The candidate attribute is selected as a key attribute if the names of the gathered objects and the values of the objects for the candidate attribute satisfy predefined criteria. For instance, objects may be merged into one object if they have same or similar names and have the same value for a key attribute.

Abstract: A method and apparatus for reproducing metadata provides a data structure in which metadata whose preferential reproduction is desired can be selected and reproduced. The metadata relevant to a moving image includes a stream data structure including one or more access units each being a data unit which can be independently processed, and each of the access units includes first data to specify an effective period defined with respect to a time axis of the moving image, object area data describing a spatio-temporal region in the moving image, second data including one of or both of data to specify a display method relevant to the spatio-temporal region and data to specify a processing to be performed when the spatio-temporal region is specified, and third data to specify, in a case where one or more access units exist on a same screen in the moving image at a time of reproduction of the metadata, reproduction priority of each of the access units.

Abstract: An apparatus and method use ontological relationships in a query language and a computer database to improve database performance and utility. A set of ontological relationships are stored in the database and new query clauses are used to query the data in advantageous ways. Ontological relationships are preferably stored in a tree structure. This tree structure then can be used to reflect the ontological relationships of data stored in the columns of a database.

Abstract: Method and system for effectuating personalized, process-integrated information, communications and entertainment (ICE) service delivery to enterprise and residential subscribers. In one embodiment, the process-integrated ICE delivery system includes at least one application server disposed as part of a service delivery platform, wherein the at least one application server is interfaced with an enterprise network for hosting one or more service application modules. A process flow management server interfaced with the enterprise network is operable for managing a modularized flow of a business process in the enterprise, wherein the modularized flow includes a number of process blocks, at least a portion of the process blocks each having an interface with one or more service application modules that are activated depending on where a particular project is located.

Abstract: A system receives a search query, determines whether the received search query includes an entity name, and determines whether the entity name is associated with a common word or phrase. When the entity name is associated with a common word or phrase, the system generates a link to a rewritten query, performs a search based on the received search query to obtain first search results, and provides the first search results and the link to the rewritten query. When the entity name is not associated with a common word or phrase, the system rewrites the received search query to include a restrict identifier associated with the entity name, generates a link to the received search query, performs a search based on the rewritten search query to obtain second search results, and provides the second search results and the link to the received search query.

Abstract: A synonym search section searches a synonym dictionary for synonym group identifiers indicating synonym groups to which tags included in first structure-designating information from a terminal belong. Based on a search result, a structure-designating-information generation section generates second structure-designating information in which the tags included in the first structure-designating information are replaced with the respective synonym group identifiers indicating the synonym groups. A synonym-structure-template search section searches a synonym-structure-template management block for a synonym structure template that matches the second structure-designating information. An acquisition section acquires, from a database, a document structure in a structured document indicated by a structure template corresponding to the detected synonym structure template.

Abstract: A method, system and computer program product for controlling access to data files stored in a repository is disclosed. The method includes receiving a request for a data file from a requester. The request specifies a data format preference for receiving the data file. The requested data format is different than either of a data format used to create the data file and a data format in which the data file is stored at the time of the request. The method also includes determining if the requester is authorized to access the requested data file and translating the requested data file from a stored data format into the requested data format responsive to receiving the request if the stored format differs from the requested format. The method further includes making the translated data file accessible to the requester if it is determined that the requester is authorized.

Abstract: The invention relates generally to a system and method for creating custom multi-relational ontologies. The invention includes a system and method for creating a master ontology and the application of one or more customizing constraints to the master ontology. Also provided are methods for creating custom ontologies using path-finding and creation of custom ontologies by applying customizing constraints to extraction, assembly, curation, and publication processes.

Abstract: A tagging application (TA) comprising a web interface program (WIP) and a tagging program (TP). The WIP presents the facet tree by displaying user selected elements of the facet tree along with an activation method for selecting a facet element and assigning a value to the selected facet or facet element. Facets and facet elements are tagged by selecting a value representing the facet element. Facets and facet elements are eliminated by choosing and applying a tagging scenario. After selecting a tagging scenario, and indicating that it is to be applied to the facet element, the TP takes the selected value and applies the selected tagging scenario to populate the tagging for the user in accordance with the tagging scenario. Once the tagging is populated, the TP returns the tagged facet tree to the user. Explanatory notes may be provided to the user with the tagged tree.

Abstract: The invention relates generally to a system and method for creating one or more structured multi-relational ontologies. The invention may include ontologies comprising assertions made up of concept-relationship-concept triplets. The invention may also include predefined sets of concept and relationship types as well as concept type hierarchies and concept-relationship association parameters. The invention may further include properties as concepts, synonyms of concepts as concepts, and documents or parts thereof as concepts.

Abstract: The invention relates to a system and method for parsing and/or exporting one or more multi-relational ontologies. The system may apply a set of export constraints to one or more master ontologies to produce a redacted data subset. The redacted data subset may then be exported to a specified location or application.

Abstract: Installing a payload file contained in a compressed archive of files using a minimum of memory. The payload file is directly installed onto a target data processing system without making additional copies of the particular file on the target data processing system and without intermediate expansion of the entire archive. The compressed archive of files contains an index indicating the location of files within the archive and a configuration logic section that allows an installation program to determine which files should be installed on which data processing systems and where the files should be installed.

Abstract: A database server receives an incoming query and converts the query into its canonical form. The database server compares the canonical incoming query with stored template queries. If the incoming query matches one of the stored template queries, then the query is legitimate and the query is executed on the database. If the canonical incoming query does not match one of the stored template queries, then the database server determines whether the incoming query is malicious or anomalous. The database server identifies tokens in the incoming query that are not present in a similar template query. If the tokens have meaning in the language utilized to express the query, the database server declares the query malicious. Otherwise, the database server declares the query anomalous.

Abstract: A method, system and article of manufacture for processing rule sets and, more particularly, for processing abstract rule sets. One embodiment provides a computer-implemented method of managing execution of an analysis routine configured to process one or more inputs. The analysis routine is defined by at least one abstract rule set having one or more abstract rules each having a conditional statement and a consequential statement. The method comprises determining, from the retrieved analysis routine, a predefined validating condition that needs to be satisfied by at least one of the inputs, and validating a particular data value defining the at least one of the inputs on the basis of the predefined validating condition. If the particular data value is not validated, a predefined action configured to avoid execution of the analysis routine on invalid inputs is performed.

Abstract: A method, system and article of manufacture for processing rule sets and, more particularly, for processing abstract rule sets. One embodiment provides a computer-implemented method of managing execution of an analysis routine on input data. The method comprises receiving input and receiving user-selection of an analysis routine for processing the received input. The analysis routine is defined by at least one abstract rule set having one or more abstract rules each having a conditional statement and a consequential statement. The method further comprises executing the analysis routine on the received input, comprising (i) identifying all required inputs for each abstract rule of the analysis routine, (ii) determining whether the received input includes data for all required inputs, and (iii) if the received input does not include data for one or more of the required inputs, retrieving suitable data for the one or more of the required inputs from the database.

Abstract: A method for evaluating a spatial query comprises receiving a spatial query defining a query window including a void, identifying an interior circle for the query window, wherein the interior circle includes a void, and processing the spatial query by either (1) modifying the at least one interior circle to exclude the void, and using the modified interior circle to evaluate the spatial query by checking whether a data MBR is inside the modified interior circle and when it does, including the data item in the query result set, or (2) by checking whether a data MBR is inside the interior circle and when it does, checking whether the data MBR intersects the MBRs of any of the voids, and including the data item in the query result set when there is no intersection.

Abstract: A database includes a storage to store a data set and a controller to use one or more SQL (Structured Query Language) statements to perform computations associated with a clustering algorithm e.g., a K-means clustering algorithm).

Abstract: A method for estimating a runtime of a query of a data repository may abstract, extract, or otherwise generate one or more parameters of the query. Thereafter, the abstracted parameters may be associated with one or more statistical query records. From these statistical query records, a query runtime may be estimated. Related apparatuses, computer program products, and computer systems are also described.

Abstract: An apparatus and method to optimize a query access plan in a computer database system. In preferred embodiments, the query optimizer determines the query can be optimized and generates for the query an optimized access plan that eliminates records defined by a Where clause and one or more ordering criteria prior to ordering the records (sorting or grouping) and then returning a first n rows.