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: Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations.

Abstract: There are provided a system and method for predicting query execution time in a database system. A cost model determination device determines a cost model of a database query optimizer for the database system. The cost model models costs of queries applied to the database system. A profiling device determines profiling queries for profiling input/output cost units and processor cost units relating to the database system, and profiles the cost units using the profiling queries to output profiled cost units. A calibrating device calibrates cost units in the cost model responsive to the profiled cost units to output calibrated cost units. A sampling re-estimator samples and re-estimates a cardinality estimation of a final query plan to output an updated cardinality estimation. A predictor applies the calibrated cost units and the updated cardinality estimation in the cost model to generate a prediction of an execution time of a given query.

Abstract: Database tables can have different types of database indices defined for the database tables and different numbers of database indices. The efficiency of reading the indexes can vary with the different profiles of the indexes, which impacts the costs of access plans that use the indexes. Weights can be predefined to reflect the relative efficiencies of the different characteristics. Costs can be computed in accordance with a variety techniques (e.g., based on edge traversals). The weights can be predefined to reduce costs, increase costs, or a combination thereof. A database management application or associated application or program can also refine or revise these weights based on statistical data gathered about the operation of the database and/or heuristics that are developed based on observations/research. The corresponding weights can be adjusted accordingly.

Abstract: Optimizing the execution of a query in a multi-database system includes identifying a region within a table, the table being referenced in the query. The region is stored on data-storage devices on first and second system databases in the multi-database system. A first access plan for the query is developed, the first access plan comprising accessing the version of the region stored on the first system database. A second access plan for the query is developed, the second access plan comprising accessing the version of the region stored on the second system database. A selection is made between the first access plan and the second access plan to execute the query. The query is executed using the selected access plan to produce a result.

Abstract: A query governor intelligently sets tailored thresholds for a query accessing a computer database. The query governor preferably generates a tailored threshold for each query sent to the database for execution. The tailored threshold for the query is preferably compared to an estimated query execution time to determine whether to execute the query. The query governor uses one or more factors applied to a standard threshold to generate the tailored threshold. The factors preferably include user factors and query factors. These factors are dynamically adjusted by the query governor in an intelligent way to increase optimal use of the database. Other factors may include factors such as job priority factor, resource factor and an application factor.

Abstract: A system and method for performing a query operation on a pair of relations in a database system coupled to a heterogeneous system (HS) is disclosed. Assuming that that pair of relations is partitioned and already loaded into the HS, the database system receives a query on the pair of relations and based on the type of query operation computes the cost of performing the query operation on the database alone or the costs of performing the query operation with the assistance of the HS, each of the costs corresponding to a particular algorithm. If the costs indicate that the HS improves the performance of the query operation, then the HS computes portions of the operation, and returns the results back to the database system. If any parts of the relation are out of sync with the database system, the database system performs operations to maintain transactional consistency.

Abstract: A computer system affords a user the ability to interactively formulate, visualize, and modify query plans that are to be posed to a database. The computer system provides query visualization in the form of decision trees having nodes selectable/deselectable to search for alternative query plans with lower or minimum execution time. The estimated cost and/or the execution time of a subtree of a query plan may be mapped according to a rectangle area metaphore, with the area of a rectangle enclosed by a larger rectangle representing a parent node in the plan tree. Query plans may be saved by the system in order to facilitate their visualization, optimization, and/or modification at a later date.

Abstract: A method and system for providing keyword ranking using a common affix is provided. The method for providing keyword ranking using the common affix includes: extracting a common affix using a keyword set; and providing keyword ranking which includes the extracted common affix.

Abstract: A query is received and an initial data flow graph comprising a plurality of nodes is generated for executing the query. The initial data flow graph is optimized using a model optimizer that accesses at least one of a plurality of patterns to identify a matching pattern and executes at least one optimization rule associated with a matching pattern. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.

Abstract: A database system includes an optimizer to generate resource estimates regarding execution of a request in the database system, and a regulator to monitor execution of a request and to adjust a priority level of the request based on the monitored execution and based on the resource estimates provided by the optimizer. The regulator is executable to further feed back statistics regarding execution of the request to the optimizer to improve accuracy of resource estimates provided by the optimizer.

Abstract: Mechanisms for performing database queries are provided. With these mechanisms, in response to a query request, a query plan intended for minimum query response time and a query plan intended for minimum query total time for the query request are obtained execution of the minimum query response time query plan and the minimum query total time query plan is started. Before the execution of the minimum query total time query plan reaches a specified point, an initial query result obtained from the execution of the minimum query response time query plan is output. In response to the execution of the minimum query total time query plan reaching the specified point, continuing the execution of the minimum query total time query plan to output remaining query results.

Abstract: A method, system, and computer program product for managing database statistics are provided. The method, system, and computer program product provide for receiving a query for optimizing, collecting statistics specific to the query prior to generating any access plans for executing the query, and generating an access plan for executing the query based on the collected statistics.

Abstract: An image processing apparatus stores therein a use charging table that shows a charging condition with respect to use of the image processing apparatus and a cooperative job charging table that shows a charging condition with respect to execution of a cooperative job. In the case where a received job is an apparatus job to be executed only by the image processing apparatus, the use charging table is read. Charging processing is performed based on the read charging table, and a remaining amount is calculated. In the case where a received job is a cooperative job to be executed by the image processing apparatus and a service providing apparatus cooperatively with each other, the cooperative job charging table is read, and charging processing is performed with reference to the read cooperative job charging table as necessary.

Abstract: Database report generation technology for handling a single logical query that requires data that is physically located in two different sources. The system uses intelligent push-down joins, which move data from one source to the other and join data within that source. The system dynamically determines which direction to move data depending on how the data is used in a query.

Abstract: Provided are a computer implemented method, computer program product, and system for re-writing a query. A query including a query predicate is received. It is determined that the query predicate includes one column with an associated predicate mapper. An equivalent predicate is generated for the query predicate using the predicate mapper that provides a mapping from the one column to another column. A cost of the query with the equivalent predicate is evaluated. In response to determining that the cost of the query is optimal, the query is rewritten to replace the query predicate with the equivalent predicate.

Abstract: A system and method for implementing incremental evaluation that is advantageous over nonincremental evaluation. The system and method incrementally maintain each individual aggregate value, for non-nested queries, using a constant amount of work.

Abstract: A query is received which causes an initial data flow graph that includes a plurality of nodes that are used to execute the query is generated. Thereafter, the initial data flow graph is optimized using a model optimizer that includes an optimizer framework and an application programming interface (API). The optimizer framework provides logic to restructure the initial data flow graph and a rules engine for executing one or more optimization rules. The API allows for registration of new optimization rules to be executed by the rules engine. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described.

Abstract: A method and system for remote binding of meta-content to a uniform resource indicator are provided. The method includes providing a script to a web browser application in response to the web browser, application accessing the uniform resource identifier of a content provider system and requesting an asset therefrom. The script is generated by a remote server system and is provided to the web browser application by routing the web browser application from the content provider system to the remote server system. The method also includes receiving a call from the web browser application at the remote server system via the script. The call includes the uniform resource identifier of the content provider system. Using the uniform resource identifier, the remote server system queries a data source to determine whether meta-content for the asset is available.

Abstract: Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.

Abstract: A computer-implemented method, apparatus and article of manufacture for optimizing a database query. A query execution plan is generated for the database query, which may be stored in an in-line query capture database. Execution of the query execution plan may be monitored in order to generate performance information, which also may be stored in the in-line query capture database. The data stored in in-line query capture database may be used during the initial generation of query execution plans, as well as for the re-optimization of a query execution plan, during the execution of the query execution plan.

Abstract: Inputs are received. The inputs are a star schema data model comprising a non-partitioned fact table (F) comprising fields (f1, f2, . . . fn); a set of queries (Q=q1, q2, . . . qm); and a set of weights for each query in Q. Each weight defines the priority of a respective query in a workload. The inputs are pre-processed to produce a most-granular-partitioning. The most-granular-partitioning is processed to produce an initial multi-level partitioned primary index, the processing including determining the scan cost of one of the queries in Q. The initial multi-level partitioned primary index is processed to produce a final multi-level partitioned primary index, the processing including determining the query cost of one of the queries in Q. F is partitioned using the final multi-level partitioned primary index. A query from Q is run against F to produce a result. The result is stored.

Abstract: There is provided a method for searching a database to obtain data. The method includes (a) prioritizing a set of keys that are derived from a match inquiry, thus yielding a prioritized set of keys, wherein the prioritizing is based on, for each key of the set, an efficacy of using the key, (b) determining a subset of the prioritized set, and (c) retrieving, using the subset, a set of candidates for satisfying the match inquiry.

Abstract: Disclosed herein are techniques for measuring or assessing the costs of executing operations across a plurality of computing systems. The cost of transferring data across at least one arrangement of computing systems is determined. The cost of executing at least one arrangement of the operations is also determined.

Abstract: Various technologies described herein pertain to parallel local sequence alignment that aligns a query sequence with a database sequence. The database sequence is segmented into a plurality of stripes. A first processing unit can compute Smith-Waterman values for a first stripe of the database sequence across the query sequence based on a cost function that models biological similarity between sequences. Moreover, a second processing unit can compute Smith-Waterman values for a second stripe of the database sequence across the query sequence based on the cost function. Further, a subset of the Smith-Waterman values for the second stripe of the database sequence across the query sequence can be re-computed based on the cost function (e.g., by the first processing unit or the second processing unit). The subset of the Smith-Waterman values to be re-computed can be determined based on a query sequence length and the cost function.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for query optimization in a database system. These mechanisms and methods for query optimization in a database system can enable embodiments to optimize OR expression filters referencing different logical tables. The ability of embodiments to optimize OR expression filters referencing different logical tables can enable optimization that is dynamic and specific to the particular tenant for whom the query is run and improve the performance and efficiency of the database system in response to query requests.

Abstract: Computer-based methods, computer-readable storage media and computer systems are provided for optimizing integration flow plans. An initial integration flow plan, one or more objectives and/or an objective function related to the one or more objectives may be received as input. A computing cost of the initial integration flow plan may be compared with the objective function. Using one or more heuristics, a set of close-to-optimal integration flow plans may be identified from all possible integration flow plans that are functionally equivalent to the initial integration flow plan. A close-to-optimal integration flow plan with a lowest computing cost may be selected from the set as a replacement for the initial integration flow plan.

Abstract: An optimizer uses comprehensive reasoning regarding partitioning, sorting, and grouping properties for query optimization. When optimizing an input query expression, logical exploration generates alternative logical expressions. Physical optimization explores physical operator alternatives for logical operators. Required partitioning, sorting, and grouping properties of inputs to physical operators are determined. Additionally, delivered partitioning, sorting, and grouping properties of outputs from physical operators are determined. In some embodiments, enforcer rules are employed to modify structural property requirements to introduce alternatives for consideration. Property matching identifies valid execution plans in which the delivered partitioning, sorting, and grouping properties satisfy corresponding required partitioning, sorting, and grouping properties. An execution plan having the lowest cost is selected as the optimized execution plan.

Abstract: A method and a system are provided for exploring a large textual data set via interactive aggregation. In one example, the method includes receiving the large textual data set and an original query template, building an index for the query template, wherein the building the index comprises ordering the index a particular way to optimize query time, receiving one or more bindings for the original query template, computing an answer to the original query template using the index and the one or more bindings, and anticipating one or more future queries that a user may submit and that are related to the original query template.

Abstract: Embodiments of the present invention provide a method, system and computer program product for pre-migration performance prediction of a database management system (DBMS). In an embodiment of the invention, a method for pre-migration performance prediction of a DBMS can include executing a calibration workload in a target DBMS to produce a conversion factor of cost of executing the calibration workload to temporal performance of executing the calibration workload. The method also can include subsequently submitting a sample workload from a database of a source DBMS for evaluation of cost of execution on an empty replica of the database in the target DBMS. Finally, the method can include predicting a temporal performance of the sample workload in the target DBMS as a product of the conversion factor and the cost of execution of the sample workload on the empty replica of the database in the target DBMS.

Abstract: Embodiments of the present invention provide a method, system and computer program product for pre-migration performance prediction of a database management system (DBMS). In an embodiment of the invention, a method for pre-migration performance prediction of a DBMS can include executing a calibration workload in a target DBMS to produce a conversion factor of cost of executing the calibration workload to temporal performance of executing the calibration workload. The method also can include subsequently submitting a sample workload from a database of a source DBMS for evaluation of cost of execution on an empty replica of the database in the target DBMS. Finally, the method can include predicting a temporal performance of the sample workload in the target DBMS as a product of the conversion factor and the cost of execution of the sample workload on the empty replica of the database in the target DBMS.

Abstract: A method of producing a representation of the progress of a process being performed on a database may be embodied in a data processing system. The method may include obtaining for each of a plurality of subprocesses included in the database process an estimated rate of using a system resource during execution of the subprocess and an estimated volume of data to be processed. The actual rate of using the first system resource and the actual volume of data processed during execution of the at least one subprocess may be determined for at least one of the plurality of subprocesses. An output signal may be generated that is representative of the estimated and actual rates and the estimated and actual volumes of data for the at least one subprocess.

Abstract: A method includes receiving a query for data, the query including a deadline for completion. The method includes determining a plurality of access plans for the query. The method includes selecting an access plan from the plurality of access plans, wherein the access plan is selected according to an execution time for the access plan that indicates the query can be completed prior to the deadline for completion and wherein the access plan is selected to provide a lowest resource usage among access plans that can be completed prior to the deadline for completion.

Abstract: A computer-implemented method for generating online search results includes receiving, over the Internet, referring URL data including a query, and a network site ID for a network site that was visited based on third party search engine analysis of the query; generating indexed query and network site data based on the received referring URL data and network site; receiving a new query from a user; determining a network site relevant to the new query based on the indexed query and network site data; and displaying to the user a link to the network site. Systems for generating online search results are also disclosed.

Abstract: A data processing system processes transaction database information to predict future demand using data regression techniques to extract trend line information from historical pattern frequency values. By extrapolating the trend line, a predicted pattern frequency value may be calculated. By applying regression techniques (such as least-squares approximation), the trend line information may be extracted and projected to predict the future pattern frequency which may be applied to calculate the expected value of a recommendation rule.

Abstract: In an embodiment, a recursive query is received that comprises a first select statement with a seed select statement and a second select statement with a recursive reference, wherein the recursive query further identifies at least two columns in at least one table, wherein the at least two columns have parent-child relationships represented by nodes in a graph, wherein the graph represents the organization of values in rows in the at least one table. A target recursion depth is calculated for the graph based on a fanout of the graph. In an embodiment, the target recursion depth is calculated by summing the fanout at each recursion depth of the graph multiplied by a number of nodes at each recursion depth of the graph. An estimated number of rows that the recursive query will return is estimated based on the target recursion depth.

Abstract: Methods, computer systems, and computer-readable storage media for dynamically correcting misspelled search queries are provided. A portion of a search query is received, and a data store is accessed. It is determined that the portion of the search query is absent from the data store and, thus, comprises a misspelled portion of a search query. Correctly spelled portions of search queries are dynamically determined for the misspelled portion of the search query using a trie data structure, and the misspelled portion of the search query is associated with the correctly spelled portions of search queries. Search suggestions are determined for the correctly spelled portions of search queries and are ranked based on a frequency of use and on a transformation cost of associating the misspelled portion of the search query with the correctly spelled portion of search queries. The ranked search suggestions are provided to a user.

Abstract: Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed.

Abstract: A data management system receives a query for data. A deadline for completing the query is supplied along with the query. The data management system determines access plans for the query and selects one of the access plans for execution to return a results set for the query. The selected access plan is selected according to an estimated ability to complete the query prior to the deadline. Further, the access plan is selected according to a lowest resource usage among the plans that can be completed the query prior to the deadline.

Abstract: A System and method include receiving a request for data at a programmed computer, the request identifying a field and an operation for an embedded database, translating the request via the programmed computer into multiple requests tailored to schemas of multiple different databases, estimating a cost to execute the request against each of the multiple different databases, and identifying the database that can execute the request with the least cost.

Abstract: A ranking system is described for adjusting quality distributions of items responsive to pairwise comparisons. The pairwise comparisons are selected for a user providing a preference between the items in the pairwise comparisons. The selection is determined based on the cost of an error in the rankings of items in combination with the likelihood there is an error in the item rankings. On receiving the comparison result from the user, the quality distributions are updated and can include a confidence modifier to determine the confidence the user's preference is reflective of the actual preference between the items.

Abstract: Methods, systems, and computer program products are provided for query expression evaluation for query optimization. Embodiments include receiving a query including a plurality of predicates; creating a truth table representing the possible solutions to the query; identifying a plurality of intersections of the truth table, the plurality of intersections including each predicate of the query; assigning a selectivity factor to each predicate; determining in dependence upon the selectivity factors for each predicate a selectivity rating for each of the intersections of the truth table; selecting one or more of the intersections in dependence upon the selectivity rating; and determining in dependence upon the selected intersections a percentage of rows in a database table returned by the query; and providing the percentage of rows in the database table to an access plan generator for query optimization.

Abstract: A computer readable storage medium comprises executable instructions to generate a stream cube to store data received from multiple data sources. A plurality of multi-dimensional data streams are generated to represent the received data. A materialization strategy is repeatedly determined for the stream cube. The stream cube is materialized according to the materialization strategy to record the multi-dimensional data streams.

Abstract: A method for providing optimized data representation of relations for in-memory database query processing is disclosed. The method seeks to optimize the use of the available memory by encoding relations on which the in-memory database query processing is performed and by employing auxiliary structures to maintain performance. Relations are encoded based on data patterns in one or more attribute-columns of the relation and the encoding that is selected is suited to a particular type of data in the column. Members of a set of auxiliary structures are selected based on the benefit the structure can provide and the cost of the structure in terms of the amount of memory used. Encoding of the relations is performed in real-time while query processing occurs, using locks to eliminate conflicts between the query processing and encoding.

Abstract: Adaptive index density in a database management system is provided, which includes receiving a number of partitions for an index for a database table, the index subject to creation. The adaptive index density also includes selecting a column from the database table, the column selected based upon an estimated frequency of execution of database queries for the column. The adaptive index density further includes calculating an estimated cost of executing each of the database queries for the column, and determining data to reside in each of the partitions of the index responsive to the estimated cost.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for analyzing and enhancing query plans. In one aspect, a method includes receiving a query plan, automatically identifying, by one or more computers, one or more operations included within the query plan that may degrade the performance of a query, and providing a report that identifies the identified operations as performance degrading operations.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for query optimization in a database system. These mechanisms and methods for query optimization in a database system can enable embodiments to optimize OR expression filters referencing different logical tables. The ability of embodiments to optimize OR expression filters referencing different logical tables can enable optimization that is dynamic and specific to the particular tenant for whom the query is run and improve the performance and efficiency of the database system in response to query requests.

Abstract: An adaptive query execution plan enhancement is provided by: selecting a sample of literal sets from an execution history of a query statement; determining a plurality of access paths by applying each literal set in the sample to the query statement; for each given access path of the plurality of access paths, determining a total execution cost by applying each literal set in the sample to the given access path; and selecting a preferred access path from the plurality of access paths based on the total execution costs for each given access path. A plurality of preferred access paths for a plurality of query statements in an application workload is collected and may be presented as a query execution plan enhancement recommendation to users.

Abstract: A request handler may determine a query of a data stream management system (DSMS), wherein the query includes a plurality of operators being configured to execute the query collaboratively within the DSMS, and wherein stored stream-related data includes operator-associated windows of state data from the stream data, the request handler being further configured to determine a new query having new windows corresponding to the windows of the original query. A windows sorter may sort the new windows from longest duration to shortest duration to obtain a sorted new windows list. A migration estimator may calculate individual migration times for migrating state data from each window to its corresponding new window, beginning with the longest new window of the sorted new windows list. A migration aggregator may aggregate the individual migration times to obtain a total migration time for the new query.

Abstract: A networked data processor maintains a database of information concerning potential evidence from litigants in legal proceedings supporting stipulated discovery agreements, and requiring meet-and-confer sessions prior to seeking court supervision. Individual or adverse parties can participate. Sources include data custodians, file repositories, electronic data, witnesses, etc. Managers and employees are polled to populate a database defining the litigant's organization and evidence. The evidence may be sequestered, copied and processed, e.g., filtered for confidentiality or privilege, analyzed as to format, and queried to assess the volume of data that would be responsive under alternative discovery specifications. Cost and time are assessed under alternative specifications and reports are provided for use in negotiating a discovery plan. A stipulated discovery plan may result, or if not, a meet-and-confer session is electronically managed in a multi-user teleconference.