The query method and device suitable for an On-Line Analytical Processing (OLAP) query engine includes a client agent module, a query pattern matching module, a query distributed execution module, and a pre-aggregation module. The query pattern matching module is configured to obtain an MDX query request received by an OLAP query engine and process the MDX query request to generate at least one set of aggregation query sets. The one set of aggregation query sets includes a plurality of aggregation query requests. The query distributed execution module is configured to perform concurrent processing on the plurality of aggregation query requests. The aggregation query requests are arranged corresponding to the aggregation query results. An efficient OLAP query execution engine can deal with complex OLAP queries of various reporting system. Therefore, the execution efficiency of MDX query can be significantly enhanced, and analysis requests of the reporting systems are rapidly responded.

A computing device receives user selection of a data source. The computing device receives a user input to specify a level of detail (LOD) expression, which includes a first keyword, a SORT keyword, and an analytic expression. In response to the user input, the computing device identifies one or more data fields from the data source. The device translates the LOD expression into one or more executable database queries referencing the identified data fields. The computing device executes the queries to retrieve data from the data source. The computing device generates and displays a data visualization using the retrieved data.

A computing device receives user selection of a data source. The computing device receives a user input to specify a level of detail (LOD) expression, which includes a first keyword, a SORT keyword, and an analytic expression. In response to the user input, the computing device identifies one or more data fields from the data source. The device translates the LOD expression into one or more executable database queries referencing the identified data fields. The computing device executes the queries to retrieve data from the data source. The computing device generates and displays a data visualization using the retrieved data.

The disclosed subject matter relates to a system and method for providing an automated assistant that retrieves information from a knowledge base in response to a user's natural language question. A user's natural language question voice is transformed into an intermediate representation. From the intermediate representation, a cypher query is generated which may be used to query the database. The query results are provided in response to the user. The transformation into the intermediate representation is database independent while the cypher query is dependent upon the database queried.

Methods and systems are provided for searching information in a distributed data processing system. A system for processing a semantic search query where the system may include a memory and a processor coupled to the memory being configured to, receive a structured search query, process the structured search query to deconstruct into query elements, identify a set of connected elements that define a data source associated with the received structured search query based on a processed query element, process the query elements to determine one or more command data element types associated with the received structured search query, and process data associated with the defined data source according to a command data element type to develop a semantic search query resultant data set.

A binary relational database model is described whereby application-layer object structures are easily inferred from database query templates. The object structures take the form of acyclic hypergraphs, which are induced from primal graphs representing query templates. Database applications may iterate through the collection of returned object structures, accessing the data in each structure. The returned object structures are not based on a fixed object model, thereby permitting rich structures with greater applicability than traditional ORM systems. A relationship between non-primitive entities may be directly expressed without the need for alternative join tables. Development and maintenance costs are thus substantially reduced, and data is more efficiently stored and manipulated for database applications.

Various methods, apparatuses/systems, and media for automatically mapping physical data models or objects to logical data models which in turn are automatically mapped to business terms are disclosed. A database stores a raw physical data model of an application. A processor extracts the raw physical data model of the application from the database. The processor also converts physical object names associated with the raw physical data model into English terms based on a taxonomy expansion list; applies a plurality of standardization and contextualization rules to the English terms generated from converting the physical object names; outputs names based on applying the plurality of standardization and contextualization rules to the English terms; applies fuzzy logic and machine learning routines and matching algorithms for matching the names to predefined logical terms; and automatically generates a mapping of physical objects or elements in the application with logical attributes and related business terms.

Systems, devices, computer-implemented methods, and/or computer program products that facilitate generative relation linking for question answering over knowledge bases. In one example, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components can comprise a relation linking component. The relation linking component can map relations identified in a natural language question to corresponding relations of a knowledge base using a generative model.

Systems and methods are described herein for interpreting natural language search queries that account for contextual relevance of words of the search query that would ordinarily not be processed, including, for example, processing each word of the query. Each term or phrase is associated with a respective part of speech, and a frequency of occurrence of a combination of adjacent terms or phrases public domain is determined. A relevance of each term is then determined based on its respective type of term and frequency of occurrence in the public domain. The natural language search query is then interpreted based on the importance or relevance of each term.

Adapting database queries from a common interface into conditions specific to database storage formats, optimization of a data model, and virtualization of query results from combined databases.