65 results about "RDF query language" patented technology

A system and methods are provided for interactive construction of data queries. One method comprises: generating a query based upon a plurality of user-identified data items, wherein the user-identified data items are data items representing desired results from a query, and wherein information related to the user-identified data items is included in a “given” clause of the query, assigning received input data to a hierarchical set of categories, presenting to a user a plurality of new query results, wherein the plurality of new query results are determined by scanning the received input data to find data elements in the same hierarchical categories as those in the “given” query clause and not in the same hierarchical categories as those of an “unlike” clause of the query, receiving from the user an indication as to whether each query result of the presented plurality of new query results is a desirable query result, adding query results indicated by the user as desirable to the “given” clause of the query, adding query results indicated by the user as undesirable to the “unlike” clause of the query, evaluating a metric indicative of the accuracy of the query, and responsive to a determination that the query achieves a predetermined threshold level of accuracy, storing the query.

A method for publishing relational data as XML by translating XML queries into queries against an relational database. Conversion of the relational database into an XML database is not required. Each relational table is mapped to a virtual XML document, and XML queries are issued over these virtual documents. An XML query is parsed and transformed into a language-neutral intermediate representation, which is a sequence of operations describing how the output document is derived from the underlying relational tables. The intermediate representation is then translated into an SQL query over the underlying relational tables and into instructions for a tagger. The SQL query is executed, and the SQL query results are then fed into the tagger, which follows tagger instructions to generate the marked up output.

A usage model and the underlying technology used to provide sequence analysis as part of a relational database system. Included components include the semantic and syntactic integration of the sequence analysis with an existing query language, the storage methods for the sequence data, and the design of a multipart execution scheme that runs the sequence analysis as part of a potentially larger database join, especially using parallel execution techniques.

Systems and methods for extension of a query language for defining a simple formulation of joins by capturing the semantics of an existing linkage between a plurality of tables, via employing a reference join. Such reference join enables a compiler to exploit existing relationships in a data base, and employ existing knowledge about referential constraints for an unambiguous transformation of the reference join expression into the equivalent INNER JOIN on the columns involved. Accordingly, a simpler query syntax and semantics can be provided to express multi-table join navigation over primary key / foreign key relations, for example.

The invention discloses a volume radio direction finde (RDF) data distribution type query processing method based on a Hadoop platform and belongs to the field of the computers. The method mainly comprises the following steps. Step a, RDF data can be uploaded to a hadoop distributed file system (HDFS), data can be read by a MapReduce frame of the Hadoop platform and stored in a distributed database HBase. Step b, a simple protocol and RDF query language (SPARQL) inquiry statement section which is provided by a user can be preprocessed. Statements can be analyzed and extracted a prefix statement, an outcome variable and a picture-model sub sentence. Step c, prefix characters of the picture-model sub sentence can be restored, and the restored picture-model sub sentence can be converted into a tree model. Step d, the tree model can be resolved. Tree joints can be traversed in a bottom-up method and a left-to-right method and inquiry plans can be generated, wherein the inquiry plans are matched with each joints. The final inquiry plans can be sent to the Hadoop platform. Step e, data can be read form the HBase through the MapReduce frame. Distributed query can be implemented according to the inquiry plans. Eventually, the outcome variable can be returned to an inquiry result.

The invention relates to a method for driving web application penetration testing by applying an SGM-SQL (sage grant management-structured query language) injection model, in the method, a web application penetration test framework driven by an SGM-SQL injection attack model is defined; by defining the SGM-SQL injection attack model in the framework and guiding the definition of a formalized definition set of SQL injection safety loopholes and a formalized description system of penetration test cases thereof, the accurate criterion for judging existence of the safety loopholes and the orderedcomplete test cases are further provided for the penetrating testing, and an SQL injection safety loophole penetration test algorithm driven by the SGM-SQL injection attack model is accordingly provided, thereby improving the accuracy of the web application SQL injection safety loophole penetration testing. Practices prove that the method is credible, systematic and complete, and can be applied in the field of the web application safety loophole penetration testing.

The embodiment of the invention discloses a blood relationship analysis method of a structured query language, and a tool thereof. The blood relationship analysis method comprises the steps: extracting service systems of a plurality of different types of databases, and continuously importing the structured query language of the service systems into a message queue list in batches; preprocessing structured query languages containing static parameters and dynamic parameters in the message queue list respectively; performing grammatical proofreading on the preprocessed structured query language,generating abstract syntax trees matching the structured query languages of the different types of databases, traversing the abstract syntax trees, and obtaining the blood relationship of the structured query languages; and obtaining blood relationship veins and key blood relationship data of the blood relationship, finally forming a blood relationship map, and finally completing analysis and prediction of the service system. According to the embodiment of the invention, dynamic and static structured query languages of various types of databases can be analyzed continuously in batches, and data traceability and prediction of a service system are completed, and an analysis result is accurate.

The invention discloses a synchronized method for not only structured query language (NOSQL) and a relational database management system (RDBMS) database and a system with the synchronized method. The synchronized method for not only structured query language (NOSQL) and a relational database management system (RDBMS) database and the system through changing a java form entity instance object which needs to be stored by a data operation method into a JavaScript Object Notation (JSON) form entity instance object changes the JSON from entity instance object is stored into a NOSQL database. When an update record of the NOSQL database is detected in the NOSQL database, the JSON form entity instance object is changed into the JAVA form entity instance object, and the JAVA form entity instance object is stored into the RDBMS database through the corresponding data operating method of the JAVA entity instance object. The synchronized method for not only structured query language (NOSQL) and a relational database management system (RDBMS) database and the system provides a favorable transition for an existing system from a RDBMS storage mode to a NOSQL saving mode, and enables the existing system to experience the good performance brought by NOSQL through only simply modifying a data storage layer. Service codes do not need to be modified, RDBMS storage support is remained, and therefore a good security of the integrity of data is achieved.

A simple record query language (SRQL) is a generic record meta-data query solution that can natively describe the information contained in a record and search each against it to find records whose meta-data matches a particular set of criteria. SRQL includes both a record data structure that includes searchable SRQL attributes that describe the record, and queries that are able to search the attributes. The attributes are an XML node that exists in the record header itself. There are two types of queries, to wit local to find records in the local data store, and distributed to find records that may be stored in a neighbor's data store. As such, SRQL finds particular applicability to peer-to-peer networks.

A method, software and / or computer system for representing a set of SPARQL queries. The set of SPARQL queries are converting into an RDF representation of the set of SPARQL queries (that is, a SPARQL RDF graph). The SPARQL RDF graph is applied to a target RDF graph to yield a transformed target representing the responses to the set of queries, as an ontology or as text.

A system and a method are provided for querying a knowledge resource. The querying system is configured for executing queries in a query language that accepts global backreferences that are not limited to a being located in the condition including a regular expression (regex) to which the global backreference refers. In the method, an input query is received, a query based thereon containing one or more global backreferences is executed, and results are retrieved. One condition of the query includes a regex that identifies strings that match the regex. The regex includes one or more capturing groups for capturing substrings of an identified matching string. The global backreference retrieves the captured substring(s). Each global backreference in the query can be a remote backreference, which is outside the regex condition to which it refers, or a local backreference, which is in the same condition as the regex.

The invention relates to RDF (Resource Description Framework) graph data processing. In order to provide a high-efficiency parallel query processing method for the large-scale RDF graph data, reduce read-write times of disks and improve query efficiency, the invention adopts the technical scheme that an SPARQL (Simple Protocol And Rdf Query Language) parallel query method facing the large-scale RDF graph data comprises the following steps: 1, describing the RDF graph data by using a bulk synchronous parallel (BSP) model; 2, marking by using URIs (Uniform Resource Identifiers) of resources; 3, for each triple in an RDF graph data set, i.e. a subject calculating unit S, a predicate P and an object calculating unit O, establishing a directed edge e from the subject calculating unit S to the object calculating unit O, using an URI of the predicate P as a mark of the e and storing related information of the e in a local data field of the subject calculating unit S; 4, for each edge e in the step 3, using an URIr as a mark of an er; 5, acquiring an query request q0 submitted by a user; 6, selecting different propagation paths to carry out propagation; 7, estimating a quantity of information contained in each clause in the qi-1 by utilizing a greedy algorithm; 8, repeatedly carrying out the steps 6 and 7 until all the clauses are bound. The SPARQL parallel query method is mainly applied to graph data processing.

The invention provides a query sentence optimization device which comprises a query location module used for obtaining an external query and a subquery in original inquiry sentence, a query combination module used for combining the external query and the subquery into a new external query and a query sentence generation module used for generating new query sentence according to the new external query. Correspondingly, a query sentence optimization method is further provided. By means of the technical scheme, field information of the queries can be compared according to the external query and the subquery to further judge which fields are redundant fields, filter the redundant fields and improve execution efficiency of structured query language (SQL) sentence. Simultaneously, the external query and the subquery are combined to be operated, nested subqueries are removed, and the aims of flattening and simplifying the SQL sentence are achieved.

Novel methods for expressing paths contained in queries are provided. The path expressions are composed from tokens selected from the group consisting of object identifiers, attribute identifiers, a relationship operator, and path qualifiers. Path expressions can be more easily created than by creating the path expressions directly in SQL. The path expressions can easily be incorporated into queries for querying data structured according to an object model. Examples of such queries include queries for implementing rules for checking data corresponding to IT infrastructures to see if the IT infrastructure is compliant with policies created for the IT infrastructure.

Methods, systems, and articles of manufacture that allow saved abstract queries to be referenced from within query statements constructed using standard query languages, such as Structured Query Language (SQL), are provided.

The invention discloses a BIM (Building Information Model) specification detection device based on semantic retrieval. The detection device includes a specification and model input module, a conversion module from building specification to semantic query, a semantic information extraction module of a BIM, a semantic model generation module of the BIM, a specification integrity detection module and a specification conformity detection module. According to the detection device, extraction is carried out on the BIM on the basis of specification requirements, detection space is reduced, and the query efficiency of semantic detection is improved; and an SPARQL (SPARQL Protocol and RDF Query Language) and OWL (Web Ontology Language) ontology technology are introduced, and the problem that a storage format of the BIM is hard to be efficiently retrieved is solved.

The invention relates to a knowledge question answering method, a knowledge question answering system and a computer-readable storage medium. The method comprises the following steps: a question answering request is received; the question answering request carries the active question text information; Determining a query language according to the source question text information and a preset question label template; Query the recommended entity group matching the query language from the dynamically updated knowledge management database, and generate knowledge map based on the recommended entity group; Sending knowledge map. The invention provides a knowledge question answering method, A knowledge question answer system and a computer-readable storage medium, The preset question label template can check the integrity of query language, improve the accuracy of query language, query language and knowledge management database together ensure the accuracy and real-time of recommended entitygroup, knowledge map form unified recommended entity group, to provide users with professional knowledge answers.

The invention discloses a not only structured query language (NoSQL)-based method for realizing message-oriented middleware. The method comprises the following steps of: forwarding a cache and restoring shutdown. In a NoSQL, the access control of data is performed in an internal memory, and the read-write speed is high; messages are stored in the NoSQL, so that the high efficiency of message caching can be ensured; when searched, the messages can be positioned quickly by utilizing the advantage of the read-write speed of the internal memory; and by matching with a journal file, the lost of the messages can be avoided after the shutdown of a message-oriented middleware server, and the messages before the shutdown can be restored after restarting.

Embodiments of the present invention address deficiencies of the art in respect to database query management and execution and provide a novel and non-obvious method, system and apparatus for processing an adaptive query expression in an on-demand data service. In one embodiment of the invention, an adaptive query handling method can include receiving an initial query in a database driven application, parsing the initial query to identify a query expression key, matching the query expression key to an adaptive query expression, and transforming the adaptive query expression to a final query expression through a replacement of annotations in the adaptive query expression with static expressions conforming to a query language for the final query expression. Thereafter, the final query expression can be applied to a database subsystem for the database driven application.

The present invention provides a database capable of integrated query processing and a data processing method thereof. The database capable of integrated query processing includes: a storage unit configured to store data including relational data, and graph data; a converter configured to convert a query language for a property graph data model for processing the graph data into a relational algebra that is a statement in an intermediate stage; and a controller configured to control the converter so as to convert the query language for the property graph data model in an input integrated query into a syntactic statement structure, and convert the query language for the property graph data model included in the query into the relational algebra, when the integrated query, in which the query language for the property graph data model and the relational query language are mixed, is input.

A system, in particular a medical information system, for executing queries of a connected data source that stores information in an RDF compatible format and uses preset first concepts includes an input that receives a semantic query from a user, wherein the semantic query includes predefined second concepts of a specific user terminology; a processor including a converter that converts the semantic query received from the input into a database query using query language adapted for the RDF compatible format and including the first concepts, and that searches the connected data source by executing the database query; and—an output that outputs the search results retrieved from the connected data source by the processor. It is possible to carry out efficient database searches based on semantic queries using a specific user terminology with reduced processing power and time.

The invention discloses a descriptive query language for a semantic data model. Aiming at the characteristics that objects in an INM semantic data model can naturally express a complex relationship between entities in a real world and text information, the entities in the real world are intensively expressed in a mode of corresponding to the real world one to one by using an object structure comprising a relationship level structure and a combined level structure and the objects are interconnected to form a graph structure, the invention provides the descriptive query language. The query language comprises a query part and a result structure part which are totally separated, wherein the query part comprises at least one query expression, and the result structure part comprises a structure item. Moreover, the descriptive query language directly expresses query according to the elements of the model, and covers useful characteristics of logic variable, internal present and absent quantifier, explicit generality quantifier and the like in a database and a logic program design. The descriptive query language meets the requirements of simplicity, practicability and strong expression capability.

Searching stored content is disclosed. A first mapping is created from an object to one or more stored relational database tables. A second mapping is created from the object to an indexer schema. One or both of the following is done: 1) using the first mapping to translate a search request expressed in an abstract query language to a first query language associated with the relational database; and 2) using the second mapping to translate the search request to a second query language associated with the indexer schema.

The invention is directed to method of generating database encoded software for controlling operation of a data processing device. The method comprises providing a formal language specification representative of source code for the software, translating said formal language specification into data suitable for storing in database structures and in a form suitable for being queried by a database query language and storing said data in database structures of a database. The method includes using a software development tool in a software development and testing environment to manipulate the database encoded software using a database query language such as SQL and XQuery to develop new software features. The query language can also be used to control replication and / or synchronization of the database encoded software with the contents of a data processing device control program database by way of installing said control program on said device or upgrading the control program software of said device.

A method and system provide an algebraic database management system (ADBMS) that maintains ADBMS type system. The type system includes an ADBMS type database (ATD) and provides a collection of rules that assign a type to constructs. The ATD is a catalog with each record holding typing information. An interpreter dynamically processes, at execution time, a query (that is syntactically modeled on relational algebra). The interpreter: determines inputs of the query; searches the ATD for a data type of each of the inputs, determines compatibility between each of data types of the inputs based on an operator of the query, determines a resultant of the query and a data type of the resultant (based on the operator of the query), and saves the resultant of the query by adding a new record in the catalog.

The invention discloses a method for generating a complex structured query language (SQL) statement for solving the technical problem that the complex SQL statement cannot be generated according to a combined keyword by the conventional method for generating the SQL statement. The method comprises the following step of automatically generating the complex SQL statement according to a keyword specified by a user based on a Postgres database testing set through a method for classifying and combining SQL keywords, designing a basic SQL statement and generating the complex SQL statement, so that the complex SQL statement can be generated according to the combined keyword. The statement can be directly applied to the testing process of a database system, and the problems of high error rate and low efficiency caused by manually writing the combined keyword are solved.

The invention discloses a method for constructing and using FQL query language and a system thereof. The method comprises the following steps: 1. Defining FQL query language and constructing a conversion mechanism from FQL query language to Lucene query language; 2. searching and querying that information to be retrieved according to the grammatical rules of the FQL query language; The FQL query language system comprising an information source module, a search client module, a search server module, a FQL analysis module, a Lucene query language construction module and an index query module. The invention simplifies the whole query sentence as much as possible, achieves the purpose of easy use and easy maintenance, and is very easy to remember, which is beneficial for the developer to improve the development efficiency.