Abstract: Methods and systems may provide for identifying one or more visualization characteristics of a user interface (UI) associated with an application on a client device and generating a query plan based on the one or more visualization characteristics, a historical performance of a network infrastructure and a current status of the network infrastructure. In addition, a response to a query from the application may be generated in accordance with the query plan. In one example, generating the query plan includes selecting a number of elements in a responsive data set and/or selecting one or more of a plurality of service endpoints in the network infrastructure to handle the query based at least in part on the one or more visualization characteristics.

Abstract: Embodiments include methods, systems and computer program products for offloading multiple processing operations to an accelerator. Aspects include receiving a database query from an application, performing an analysis on the query, and identifying a plurality of available accelerators. Aspects further include retrieving cost information for one or more templates available on each of the plurality of available accelerators, determining a query execution plan based on the cost information and the analysis on the query, and offloading one or more query operations to at least one of the plurality of accelerators based on the query execution plan.

Abstract: Embodiments include methods, systems and computer program products for offloading multiple processing operations to an accelerator. Aspects include receiving a database query from an application, performing an analysis on the query, and identifying a plurality of available accelerators. Aspects further include retrieving cost information for one or more templates available on each of the plurality of available accelerators, determining a query execution plan based on the cost information and the analysis on the query, and offloading one or more query operations to at least one of the plurality of accelerators based on the query execution plan.

Abstract: The present invention includes a database with a semantic layer for performing standard SQL and complex operations custom to one or more application. In one embodiment the present invention includes receiving a data request from an application in a database, the data request specifying standard SQL operations and custom application operations to be performed for said application. The data request is processed in a semantic layer of the database. The semantic layer processes the standard SQL operations and the custom application operations and generates a logical execution plan comprising the standard SQL operations and the custom application operations. The logical execution plan is converted into a physical execution plan, which is executed by the database to generate a data result. The data result may be sent back to the application.

Abstract: Techniques are provided for improving performance of parallel execution plans that include serial operations. A database server generates a parallel execution plan and includes one or more serial data flow objects in the parallel execution plan, each data flow object including one or more serial row sources. A parallel selector row source is associated with each serial data flow object included in the parallel execution plan. Each parallel selector row source coordinates with a query coordinator process the execution of the associated serial data flow object. In the event that that a plurality of serial data flow objects are included in a parallel execution plan, serial row sources included in the serial data flow objects may be executed concurrently by a separate parallel slave process, instead of sequential execution of each serial row source by the query coordinator process.

Abstract: An apparatus and a method of optimizing queries through scheduling User Defined Operators (UDOs) in a Data Stream Management System (DSMS), are provided. The apparatus includes a query optimizer configured to receive queries, each of the queries including the UDOs and data streams subject to respective operations of the UDOs, and group the data streams and UDOs into scheduling units, each of the scheduling units including one of the data streams and one of the UDOs. The apparatus further includes a scheduler configured to schedule an execution order in which the scheduling units are executed.

Abstract: The approaches described herein provide an efficient way for a database server to support storage and retrieval for any of a growing number of semi-structured data formats. In one embodiment, a set of generic semi-structured data operators are provided that enable users to query, update, and validate data stored in any of a number of semi-structured data formats. In this context, a “generic” semi-structured data operator means a data operator that may be configured to operate on any number of different semi-structured data formats. For example, according to one embodiment, the same set of generic semi-structured data operators may be used to operate on data stored according to the XML, JSON, or any number of other semi-structured data formats.

Abstract: Methods, systems, and computer-readable storage media for optimizing query processing in encrypted databases. In some implementations, actions include receiving a query that is to be used to query an encrypted database, generating a plurality of query plans based on the query, each query plan including a local query and one or more remote queries, the local query being executable at a client-side and the one or more remote queries being executable at a server-side, selecting an optimal query plan from the plurality of query plans, providing one or more remote queries of the optimal query plan to the server-side for execution, receiving one or more remote results, and processing a local query of the optimal query plan and the one or more remote results to provide a final query result.

Abstract: A dynamic split node defined within a calculation model can receive data being operated on by a calculation plan generated based on the calculation model. A partition specification can be applied to one or more reference columns in a table containing at least some of the received data. The applying can cause the table to be split such that a plurality of records in the table are partitioned according to the partition specification. A separate processing path can be set for each partition, and execution of the calculation plan can continue using the separate processing paths, each of which can be assigned to a processing node of a plurality of available processing nodes.

Abstract: In an embodiment, a query plan is compressed to data in a cache at a high compression level if a runtime of a query that the query plan implements is greater than a high time threshold. The query plan is compressed to the data in the cache at a medium compression level if the runtime of the query that the query plan implements is less than the high time threshold and greater than a low time threshold. The query plan is stored to the data in the cache at an uncompressed level if the runtime of the query that the query plan implements is less than the low time threshold.

Abstract: A method, article of manufacture, and apparatus for searching a computing environment, such as a cloud data repository. In some embodiments, this includes providing an extension function for distributed execution of queries. In some embodiments, subqueries or subexpressions of a query may be executed in parallel amoung different repositories or collections.

Abstract: Techniques for managing XML data associated with multiple execution units ensure that execution units are able to use XML data coming from other execution units. Such techniques are applicable when, but for the technique, an XML type value is produced in a particular form by one execution unit and is supposed to be consumed by another execution unit that is unable to process data in the particular form, and involves detecting that the foregoing situation exists and annotating information sent to an XML producer execution unit to cause the XML type value to be transformed into a canonical form that can be shared by all relevant execution units.

Abstract: A method, system and computer program product for providing translated web content is disclosed. The method includes receiving a request from a user on a web site, the web site having a first web content in a first language, wherein the request calls for a second web content in a second language. The method further includes dividing the first web content into a plurality of translatable components and generating a unique identifier for each translatable component. The method further includes identifying a plurality of translated components of the second web content using the unique identifier of each of the plurality of translatable components of the first web content and putting the plurality of translated components of the second web content to preserve a format that corresponds to the first web content. The method further includes providing the second web content in response to the request that was received.

Abstract: A probabilistic data structure is generated for efficient query processing using a histogram for unsorted data in a column of a columnar database. A bucket range size is determined for multiples buckets of a histogram of a column in a columnar database table. In at least some embodiments, the histogram may be a height-balanced histogram. A probabilistic data structure is generated to indicate for which particular buckets in the histogram there is a data value stored in the data block. When an indication of a query directed to the column for select data is received, the probabilistic data structure for each of the data blocks storing data for the column may be examined to determine particular ones of the data blocks which do not need to be read in order to service the query for the select data.

Abstract: A query is received. The query comprises a plural number of efficiency expressions. A key is generated for the query indicating a first selectivity region in multi-dimensional selectivity space comprising an array of selectivity regions arranged according to a grid with a number of dimensions equal to the plural number. The generated key is used to look up a stored query plan among a plurality of stored query plans. A stored query plan is executed for the query that is associated with a stored key determined to match the generated key.

Abstract: As an abstract representation, a set of equivalent logical structures representative of multiple execution plans for execution of a database query can be used to optimize a database query. A logical structure can include one or more logical operators each representing multiple physical operators for executing the database query. Group and Operator Rules can be applied as rules to the set of equivalent logical structures to obtain additional equivalent logical structures and logical operator until no additional logical operators can be obtained. A set of possible implementation plans for the total number of the obtained logical operators can be obtained, for example, based on physical and/or implementation context.

Abstract: A method for matching bulk data, involving receiving a plurality of input records, performing block distribution on the plurality of input records to obtain a plurality of block records, wherein performing block distribution comprises distributing the plurality of input records to a first plurality of containers, performing concurrent matching operations on the plurality of block records to obtain a plurality of single best records, and loading the plurality of single best records into a master index database.

Abstract: Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.

Abstract: A computer-implemented method, apparatus and article of manufacture for performing an automatic error recovery in a database system. Automatic error recovery is performed for a query execution plan, following errors, problems or failures that occur during execution, by automatically or manually deactivating and/or activating components, features or code paths, and then re-submitting the query execution plan for execution in the computer system.

Abstract: There is provided a computer-executed method of executing a rowset insert against a database. The method comprises receiving a structured query language statement (SQL) specifying the rowset insert. Additionally, the method comprises raising an error for a first row of the rowset insert. The method also comprises updating a table for a second row of the rowset insert. Further, the method comprises updating a materialized view of the table based on the second row. Additionally, the method comprises performing a commit to the database. The table comprises the second row, and the updated materialized view is consistent with the table.

Abstract: A database table is provided. The database table includes several column tuples. A column is selected in the database table. The column tuples of the selected column are partitioned into several bins. Each bin includes a range of tuples and associated metadata. The associated metadata includes at least one of: a minimum tuple value for the tuples in the bin, a maximum tuple value for the tuples in the bin, a minimum tuple identifier for the bin and a maximum tuple identifier for the bin. The bins are sorted based on the tuple values to provide an approximate index for the database.

Abstract: A method, system, and computer program product for relational database management. The method constructs a referentially-complete target subset database from a source database by first estimating the expected size of the target subset database based on application of one or more subsetting rules. If the estimated size needs reduction, the user can modify the subsetting rules, and then modules are invoked to receive the modified subset rules. The method continues by generating a subsetting execution plan by applying the user-modified subset rules to the source database, and then modules process the generated execution plan, which processing results in storage of a referentially-complete target subset database. The user can influence the construction of the execution plan by suggesting an execution model to use during processing of the subsetting execution plan.

Abstract: Generation of synthetic database data includes annotated query subplans for a multiple table query workload that includes a desired cardinality for nodes (v) in the subplans. The subplans may be merged and represented by a direct acyclic graph (DAG). The maximum entropy joint probability distribution for each attribute (x) for each node (v) is determined as: p ? ( x ) = exp [ ( ? v ? ? w v ? f v ? ( x ) Z ] ) for each node v, where wv is a weight of node v, fv is a conjunct of predicates in a subplan rooted at node v, and Z is a normalization factor. This distribution is determined such that the desired cardinality, and selectivities for each node v determined from the desired cardinality, are satisfied. The data for a plurality of tables are generated by sampling the maximum entropy joint probability distribution for a domain of attributes (x) of a plurality of tables. Data may be efficiently generated for multiple table queries and for DAGs.

Abstract: Generation of synthetic database data includes annotated query subplans for a multiple table query workload that includes a desired cardinality for nodes (v) in the subplans. The subplans may be merged and represented by a direct acyclic graph (DAG). The maximum entropy joint probability distribution for each attribute (x) for each node (v) is determined as: p ? ( x ) = exp ( ? v ? ? w v ? f v ? ( x ) Z ) for each node v, where wv is a weight of node v, fv is a conjunct of predicates in a subplan rooted at node v, and Z is a normalization factor. This distribution is determined such that the desired cardinality, and selectivities for each node v determined from the desired cardinality, are satisfied. The data for a plurality of tables are generated by sampling the maximum entropy joint probability distribution for a domain of attributes (x) of a plurality of tables. Data may be efficiently generated for multiple table queries and for DAGs.

Abstract: The present invention relates to a field of evaluating the performance of a Structure Query Language (SQL) in information system. In particular, the invention proposes system and method of integration of a tool in Software Development Life Cycle (SDLC) which assures performance of SQL by estimating an execution time and remote installation of the same in a cloud based testing services. So, it can be used to detect the queries which may not perform well in the production environment.

Abstract: A mechanism is provided for detecting and disregarding application specific nodes contained in shared XML documents. The techniques described involve determining one or more application specific nodes within XML documents and performing path expression evaluations of the XML documents as if the nodes are not present. In one embodiment, a mechanism is provided by which a user may specify the criterion that determine which subset of node in XML documents are to be ignored from path expression evaluations and evaluating a query that specifies a path operation based on a path and ignoring said identified nodes when evaluating said path operation.

Abstract: A database management system that can comprise a memory for storing computer executable instructions and a processing unit for accessing the memory and executing the computer executable instructions. The computer executable instruction scan comprise a compiler to hold a query received at a query input, thereby preventing the query from executing based on a cost comparison between an estimated resource execution cost of a query plan for the query and cost rules.

Abstract: A method comprises grouping, via a data processing system, a plurality of data elements in a same data type into a plurality of data units. The method further comprises gathering, via the data processing system, information about data elements in a first data unit into a first information unit. The first information unit comprising a representation of information that is less than all unique information in the first data unit. The method also comprises storing, via the data processing system, the first information unit on a computer readable storage device. The method additionally comprises identifying, via the data processing system, based at least in part on the first information unit, whether the data elements in the first data unit are required to be retrieved to resolve a first data query received by the data processing system and to resolve the first data query.

Abstract: A grouping apparatus manages user information, and executes grouping processing for extracting a subset which matches a predetermined condition from a set of users. A flow control apparatus transmits a set of users to one of a plurality of grouping apparatuses, and transmits a condition used in grouping processing to each of the plurality of grouping apparatuses. One of the grouping apparatuses transmits, to another grouping apparatus, a first subset which is extracted by executing grouping processing on the set transmitted from the flow control apparatus. The other grouping apparatus extracts a second subset by executing grouping processing on the first subset transmitted from the one of the grouping apparatuses.

Abstract: In an embodiment, a first query is received that specifies a first object identifier. If a first query plan exists that implements the first query, except that the first query plan does not comprise the first object identifier and instead comprises a parameter marker in place of the first object identifier, a first query execution plan is created from the first query plan, substituting the first object identifier in the first query execution plan for the parameter marker, and the first query execution plan is executed to read a first object identified by the first object identifier.

Abstract: A method and system to generate cardinality estimates for at least one query execution plan for a query using a histogram, the cardinality estimation being constrained by a q-error that is a factor by which the estimate deviates, at most, from a true value of the cardinality and a threshold value which the cardinality does not exceed; use the cardinality estimation to determine an optimal query plan for executing the query; and produce an output of the optimal query plan.

Abstract: The subject mater herein relates to database management and, more particularly, to non-equijoin metadata. Various embodiments described herein provide systems, methods, software, and data structures to facilitate non-equijoins of data. Some such embodiments include a data store to hold metadata describing relationships between database tables. The relationships between database tables may include one or more non-equijoins of tables in the form of one or more table-column pairs of a first table being non-equal to one or more table-column pairs of a second table. In some embodiments, the metadata may be used by a query generator to build query statements including one or more non-equijoin.

Abstract: Embodiments relate to an eigenvalue-based data query. An aspect includes receiving a query request that includes a query statement. Another aspect includes calculating eigenvalues of key component elements in the query statement. Another aspect includes matching eigenvalues of nodes in an execution plan of a historical query statement to the eigenvalues of the key component elements. Yet another aspect includes based on determining success of matching the eigenvalues of the key component elements to the eigenvalues of the nodes in an execution plan of the historical query statement, generating an execution plan of the query statement.

Abstract: An improved method, system, and computer program product is disclosed that provides a hybrid approach to optimization which allows different subsets of data accessed by a query to be optimized with different access paths and execution approaches. Transformations may be performed to re-write the query, which restructures the query in a way that facilitates the hybrid optimization process. Multiple transformations may be interleaved to produce an efficient re-written query.

Abstract: Systems and methods are described herein that can implemented by a middle tier of a multi-tier data retrieval system to select data operation(s) that correspond to a query. The query may be received from a front tier. The selection is performed by comparing the query to a query template associated with each data operation. The query template for each data operation includes an algebraic description of queries that each respective data operation can satisfy. The selected data operation(s) are then executed against a data service to obtain data, which is then provided to the front tier. In some embodiments, an execution plan may be created by the middle tier for satisfying the query. The execution plan can include the selected data operation(s) and post-processing step(s). The post-processing step(s) can be applied to the obtained data to satisfy the query. The post-processed data is then provided to the front tier.

Abstract: Embodiments of the invention provide a system and method for searching and reporting on semistructured data that can include dynamic metadata. One embodiment can comprise providing a user interface to a user based on an object type definition for an object type that allows the user to specify search criteria associated with a set of metadata, mapping the user search criteria to a query that comprises at least one structured query constraint and at least one unstructured query constraint, processing the query to search a set of data objects containing semistructured data associated with the object type according to the query and returning a set of results to the user. The search results can be returned to a user based on user-specified reporting parameters. Additionally, the reporting definition can be saved as an object for future execution.

Abstract: A hardware device is used to accelerate query operators including Where, Select, SelectMany, Aggregate, Join, GroupBy and GroupByAggregate. A program that includes query operators is processed to create a query plan. A hardware template associated with the query operators in the query plan is used to configure the hardware device to implement each query operator. The hardware device can be configured to operate in one or more of a partition mode, hash table mode, filter and map mode, and aggregate mode according to the hardware template. During the various modes, configurable cores are used to implement aspects of the query operators including user-defined lambda functions. The memory structures in the hardware device are also configurable and used to implement aspects of the query operators. The hardware device can be implemented using a Field Programmable Gate Array or an Application Specific Integrated Circuit.

Abstract: Providing data to a computer software application by intercepting a request made by a computer software application to retrieve a first data set from a first data storage location, accessing a record, defined in advance of the request, that includes a reference to the first data set and a reference to a second data set, retrieving the first data set from a data storage location other than the first data storage location, and retrieving the second data set from a data storage location other than the first data storage location in advance of a request by the computer software application to access the second data set at the first data storage location.

Abstract: A method and device may accept a first database query plan including a plurality of rows and a second database query plan including a plurality of rows, compare each row in the first database query plan with a corresponding row in the second database query plan, and based on each comparison, calculate a difference between the compared rows. Each difference may be recorded in an output file.

Abstract: Embodiments of the present invention are directed to query-optimization methods and systems that employ risk premiums assigned to database operations in order to increase the robustness and reliability of the evaluation and selection of query-execution plans for executing high-level database queries. Using risk-premium estimates, selection of query-execution plans that include potentially inefficient database operations and inefficient database-operation-execution sequences, often selected by currently available query-optimization methods and systems, are avoided.

Abstract: Providing data to a computer software application by intercepting a request made by a computer software application to retrieve a first data set from a first data storage location, accessing a record, defined in advance of the request, that includes a reference to the first data set and a reference to a second data set, retrieving the first data set from a data storage location other than the first data storage location, and retrieving the second data set from a data storage location other than the first data storage location in advance of a request by the computer software application to access the second data set at the first data storage location.

Abstract: Systems, methods and computer program products for testing the stability and efficiency of a database query engine are described herein. In an embodiment, all possible query execution plans considered by a query optimizer are retained in the form of abstract plans (APs). Each AP is then subsequently supplied with a query to test for stack traces and incorrect results that may occur during the execution of the query. An embodiment includes determining an optimizer efficiency index (OEI) by comparing each AP with a query execution plan chosen by the query optimizer and classifying the APs into various performance buckets based on the degree of improvement or degradation in performance with respect to the query execution plan chosen by the query optimizer. In another embodiment to determine the optimizer efficiency index, APs are ranked based on estimated cost and classified into a plurality of categories based on query optimizer estimates and actual execution behavior.

Abstract: A system and method of processing a data query in a data processing system is provided. The data in the data processing system includes a plurality of individual data elements. The data elements are grouped and stored in at least one data unit. The information about the at least one data unit is gathered and stored in at least one information unit. The method comprises receiving the data query to be executed; using the information in the at least one information unit to optimize and execute the query; resolving the data query; and returning results of the data query for use by the data processing system.

Abstract: A method and apparatus, and article of manufacture are provided to process an abstract query of a database abstraction constructed over an underlying physical data storage mechanism. The database may comprise a single data source, or a federated source spanning multiple systems. Embodiments of the invention process an abstract query by generating an intermediate representation of the abstract query. In one embodiment, the intermediate representation comprises an abstract query plan. An abstract query plan includes a combination of elements from the data abstraction model and elements relating to the underlying physical data storage mechanism. Once generated, a back-end component may easily traverse the abstract query plan to generate an SQL statement (or other resolved query) corresponding to the abstract query.

Abstract: Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.

Abstract: A method of generating predictive reports includes recording a user identification, a timestamp including a connection date, and a query associated with report requested by a user from a database system for each connection of the user identification to the database system during a predetermined period. A plurality of intervals is defined in the predetermined period. Retrieved are instances of the user identification associated with connections of the user identification to the database system during a threshold number of the plurality of intervals based on a position that a current date occupies in a current interval, such that a position of each connection date in a respective interval is the same as the position that the current date occupies in the current interval. The query is executed to generate the report from the database system on the current date prior to a request for the report from the user.

Abstract: One embodiment relates to a system for linking together multiple registries and aggregating data from the multiple registries. The system includes a plurality of local resource or service (resource/service) registries, a distributed index storage and retrieval system, and at least one proxy registry. The proxy registry is configured to receive a search query from a client system, retrieve information from the distributed index storage and retrieval system as to which of the local resource/service registries are relevant to the search query, and obtain pertinent entries from said relevant resource/service registries. Other embodiments are also disclosed.

Abstract: A query configured according to a query template is received. The query includes values for a plurality of parameters. A key is generated for the query that indicates a selectivity region in a selectivity space determined for the included parameter values. Whether the generated key matches any key of a plurality of keys is determined. Each key of the plurality of keys is associated with a corresponding query plan. If the generated key is determined to not match any of the keys, the query is compiled to generate a new query plan, and the generated query plan is executed with respect to the query. If the key is determined to match any key of the plurality of keys, a query plan associated with the matched key is selected, and the query plan associated with the matched key is executed with respect to the query.

Abstract: As an abstract representation, a set of equivalent logical structures representative of multiple execution plans for execution of a database query can be used to optimize a database query. A logical structure can include one or more logical operators each representing multiple physical operators for executing the database query. Group and Operator Rules can be applied as rules to the set of equivalent logical structures to obtain additional equivalent logical structures and logical operator until no additional logical operators can be obtained. A set of possible implementation plans for the total number of the obtained logical operators can be obtained, for example, based on physical and/or implementation context.

Abstract: A query explain plan is described for use with a distributed data system in order to help developers and IT experts to detect bottlenecks and to determine which queries are to blame for a slow running system. In accordance with an embodiment, the distributed data grid utilizes a facility to provide a distributed explain plan. This distributed explain plan provides visibility into how a query was answered by each node in the cluster. For example, one node may have applied the filters of the query in one sequence, while another node may have used a different sequence. Additionally, the distributed query explain plan can provide execution tracing, rendering information about the execution time of each step, total execution time and the like.