Patent classifications
G06F16/8358
System for accessing a relational database using semantic queries
This invention is a system for integrating relational databases into a semantic web framework utilizing a simple mapping process and the SQL query optimizer present in the SQL database engine.
METHODS, SYSTEMS, AND COMPUTER READABLE MEDIUMS FOR PERFORMING A FREE-FORM QUERY
Methods, systems, and computer readable mediums for performing a free-form query are disclosed. According to one exemplary embodiment, a method for performing a free-form query includes receiving free-form information for requesting information about a computing system, converting the free-form information into at least one compatible query for querying at least one data set, querying, using the at least one compatible query, the at least one data set for the information about the computing system, and providing the information about the computing system.
OPTIMIZING A CACHE OF COMPILED EXPRESSIONS BY REMOVING VARIABILITY
Approaches presented herein enable optimization of a cache of compiled XML Path Language (XPath) expressions by removing variability from XPath expressions. More specifically, XPath expressions are identified that are the same but for one or more hardcoded values. These hardcoded values are identified and replaced in an identified XPath expression with an identifier to form a cache optimized XPath expression that lacks the hardcoded value variability of the identified XPath expressions. This cache optimized XPath expression is inserted into a cache optimized function that receives the hardcoded value as arguments and assigns the received hardcoded value to the identifier in the cache optimized XPath expression. The identified XPath expressions are then rewritten as calls to the cache optimized function or to another function wrapping the cache optimized function. Therefore, only the cache optimized XPath expression, instead of several of the identified XPath expressions, is stored in the XPath expression cache.
Discovering contexts and structured data structures from hazy data
A method for storing data of an unknown data context and structure in a structured storage system is described. The method includes extracting a list of key-value pairs from one or more inbound data blocks from one or more external data sources; calculating similarities for the list of key-value pairs from the one or more inbound data blocks based on one or more current existing data structures; determining a highest similarity from the similarities for the list among the one or more current existing data structures; determining that the highest similarity for the list does not meet a predetermined similarity threshold; creating a new data structure to store the list of key-value pairs for a first inbound data block from the one or more inbound data blocks; and storing the list of key-value pairs in the new data structure in the structured storage system.
Methods, systems, and computer readable mediums for performing a free-form query
Methods, systems, and computer readable mediums for performing a free-form query are disclosed. According to one exemplary embodiment, a method for performing a free-form query includes receiving free-form information for requesting information about a computing system, converting the free-form information into at least one compatible query for querying at least one data set, querying, using the at least one compatible query, the at least one data set for the information about the computing system, and providing the information about the computing system.
Correcting resource descriptive framework statements based on similarity of terms to web ontology
A list of unique terms, each having prefix and associated property data, contained in a defined web ontology is generated. A RDF statement about a web resource is received, and a list of unique terms contained in the RDF statement is generated. A problem term is identified within the list of unique terms contained in the RDF statement that is not present among the list of unique terms contained in the web ontology. A list of candidate terms that are contained in the web ontology that satisfy a threshold similarity to the problem term is generated. A candidate term is selected from among the list of candidate terms having a data type for the property data matching a data type for the property data of the problem term. The candidate term is substituted for each occurrence of the problem term contained in the RDF statement.
Device and method for managing structured document, and computer program product
According to an embodiment, a structured document management device includes a query data receiving unit; a structural condition dividing unit; a structural condition rewriting unit; and a query execution unit. The query data receiving unit is configured to receive query data for searching a structured document. The structural condition dividing unit is configured to divide the query data into elements including a structural condition. The structural condition rewriting unit is configured to rewrite the structural condition into a rewritten query when a type of the structural condition is other than a descendant structural condition. The rewritten query is predetermined to include a joining process with a descendant structural condition so as not to affect structural conditions appearing before and after the structural condition. The query execution unit is configured to output a search result in response to query data that includes the structural condition and the rewritten query.
SHARING INFORMATION BETWEEN NEXUSES THAT USE DIFFERENT CLASSIFICATION SCHEMES FOR INFORMATION ACCESS CONTROL
Systems and methods for sharing information between distributed computer systems connected to one or more data networks. In particular, a replication system implements methodologies for sharing database information between computer systems where the databases use different classification schemes for information access control.
COMPUTER IMPLEMENTED METHOD FOR CREATING DATABASE STRUCTURES WITHOUT KNOWLEDGE ON FUNCTIONING OF RELATIONAL DATABASE SYSTEM
Computer implemented methods for storing ad hoc relations between previously unrelated database objects assigned to different database structures using an electronic computing device are presented, the methods including: causing the electronic computing device to define at least three database structures: structure A, structure B and structure C, where each of the at least three database structures each includes a number of objects, where there exists at least one relation between objects of structure A and objects of structure B, and where there exists at least one relation between objects of structure B and objects of structure C; filtering data of structure A; accessing structure B using a first selected relation between structure A and structure B; storing information about filtering of structure A and information on a first selected path between structure A and structure B; filtering results obtained from structure B.
Computer implemented method for creating database structures without knowledge on functioning of relational database system
Computer implemented methods for storing ad hoc relations between previously unrelated database objects assigned to different database structures using an electronic computing device are presented, the methods including: causing the electronic computing device to define at least three database structures: structure A, structure B and structure C, where each of the at least three database structures each includes a number of objects, where there exists at least one relation between objects of structure A and objects of structure B, and where there exists at least one relation between objects of structure B and objects of structure C; filtering data of structure A; accessing structure B using a first selected relation between structure A and structure B; storing information about filtering of structure A and information on a first selected path between structure A and structure B; filtering results obtained from structure B.