Patent classifications
G06F16/8365
SELECTING A NORMALIZED FORM FOR CONVERSION OF A QUERY EXPRESSION
A method for execution by a query processing module includes determining a query expression indicating a query for execution. An operator tree is generated based on a nested ordering of a plurality of operators indicated by the query expression. Conjunctive normal form (CNF) conversion cost data is generated based on the operator tree, and disjunctive normal form (DNF) conversion cost data is also generated based on the operator tree. Conversion selection data is generated based on the CNF conversion cost data and the DNF conversion cost data. The conversion selection data indicates a selection to perform either a CNF conversion or a DNF conversion. A normalized query expression is generated by performing either the CNF conversion or the DNF conversion upon the query expression based on the conversion selection data. Execution of the query is facilitated in accordance with the normalized query expression.
SUMMARIZED LOGICAL FORMS FOR CONTROLLED QUESTION ANSWERING
Systems, devices, and methods discussed herein provide improved autonomous agent applications that are configured to generate automated answers to a question using summarized logical forms (SLFs). A myriad of techniques may be utilized to manually or automatically generate one or more summarized logical forms for an answer, where the summarized logical form(s) identifies the main entities/informative portions of the answer. Instead of indexing the whole of the answer as in conventional methods, an answer can be indexed using the summarized logical forms. A subsequent query may be matched to the SLF and the answer may be provided in response to the question. By indexing the answer with its informative portions, the speed and accuracy of identifying the answer is improved.
MEMORY-EFFICIENT VIRTUAL DOCUMENT OBJECT MODEL FOR STRUCTURED DATA
A system may include one or more processors, a non-volatile memory unit storing a sequence of files, and a volatile memory unit storing a partial lexicon. Content within the sequence of files may represent structured data, and elements within the structured data may be uniquely identified by paths. Entries within the partial lexicon may map the paths to the sequence of files and offsets therein identifying the elements that correspond to the paths. Instruction code executable by the processors may cause the system to perform operations including: (i) receiving a specification of a path; (ii) determining that the partial lexicon does not contain a mapping for the path; (iii) obtaining, into the volatile memory unit, supplemental data for the partial lexicon that identifies an element that corresponds to the path; and (iv) providing, for display, storage, or further processing, at least part of the element.
DYNAMIC ENDPOINT GENERATION
In various embodiments, a process for dynamic endpoint generation includes using a stored endpoint definition expressed in a declarative language to dynamically generate an endpoint comprising a representational state transfer (REST) interface. The process includes providing access to a locally-stored database via the endpoint and REST interface.
METHOD AND DATABASE SYSTEM FOR GENERATING A QUERY OPERATOR EXECUTION FLOW
A query operator execution flow includes: identifying an OR operator of the query expression; generating a plurality of parallel sub-flows of the query operator execution flow based on a plurality predicates of the OR operator in the nested ordering of the plurality of operators; and generating a plurality of serial sub-flows of the query operator execution flow based on the OR operator of the query expression, wherein a first consecutive one of the plurality of serial sub-flows includes an identifier appending operator, wherein a second consecutive one of the plurality of serial sub-flows includes a tee operator, wherein a third consecutive one of the plurality of serial sub-flows includes the plurality of parallel sub-flows from the tee operator, and wherein a fourth consecutive one of the plurality of serial sub-flows includes a union distinct operator applied to the plurality of parallel sub-flows. Execution of the query is facilitated by applying the query operator execution flow to a plurality of rows indicated by the query.
FRAMEWORK FOR DEVELOPING AND DEPLOYING APPLICATIONS
A system may determine one or more data sources which the system is configured to access. The system may provide a set of application programming interfaces (APIs) for interacting with data stored in one or more data sources. The APIs may be accessible to one or more web applications which the system is configured to serve. The system may determine that a web application has requested an operation for interacting with the data through one or more APIs in the set of APIs. The system may determine one or more responses based at least in part on the operation requested by the web application. The system may provide the response(s) to the web application.
System for accessing a relational database using semantic queries
This invention is a system for integrating data sets organized in one organization type with data sets organized in a second organization type so that data queries submitted to be processed in the manner of the first organization type can be translated into queries usable by the data set in the second data organization type and the results returned to satisfy the first query.
Web site presentation method, non-transitory computer-readable recording medium, and web site presentation device
A site presentation method includes detecting a characteristic about a feeling for each of a plurality of sites based on a word in a document in each of the plurality of sites, using a processor. The site presentation method includes specifying, based on an access history of a certain user to any of the plurality of sites, a characteristic of a user about a feeling corresponding to the certain user based on a detected characteristic of a site accessed by the certain user, using the processor. The site presentation method includes extracting, from the plurality of sites, a site in which a characteristic that is the same as or similar to the specified characteristic of the user is detected, and presenting the extracted site to the certain user, using the processor.
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 definition of a cache optimized function. The optimized XPath expression receives values as arguments of the cache optimized Xpath function and passes the received values to the variable identifier in the cache optimized XPath expression. The identified XPath expressions can then be rewritten as calls to the cache optimized function. Therefore, only the cache optimized XPath expression, instead of several of the identified XPath expressions, is stored in the cache.
Framework for developing and deploying applications
A system may determine one or more data sources which the system is configured to access. The system may provide a set of application programming interfaces (APIs) for interacting with data stored in one or more data sources. The APIs may be accessible to one or more web applications which the system is configured to serve. The system may determine that a web application has requested an operation for interacting with the data through one or more APIs in the set of APIs. The system may determine one or more responses based at least in part on the operation requested by the web application. The system may provide the response(s) to the web application.