Abstract:
Methods and systems for auditing queries using query differentials are disclosed. A method includes identifying a set of queries, determining if results of each query of the set of queries are different from results of respective differentials of each query of the set of queries, and based on the determining, making a characterization of each query of the set of queries as one of safe and unsafe. Access is provided to the characterization of each query of the set of queries.
Abstract:
A method for compressing data. The method includes accessing, within an electronic system, a database relation comprising a plurality of attributes and determining a sort order of the plurality of attributes of the database relation. The method further includes determining an order of a plurality of compression operators operable to compress the database relation and compressing the database relation to produce a compressed database based on the sort order and the order of the plurality compression operators.
Abstract:
A flexible query hints system and method for discovering and expressing query hints in a database management system. Embodiments of the flexible query hints system and method include a power hints (Phints) language that enables the specification of constraints to influence a query optimizer. Phints expressions are defined as tree patterns annotated with constraints. Embodiments of the flexible query hints system and method also include techniques to incorporate the power hints language expressions into an extended query optimizer. Theses techniques include computing a directed acyclic graph for Phints expression, deriving candidate matches using the Phints expression and the graph, computing candidate matches, and extracting a revised execution plan having a lowest cost and satisfying constraints of the Phints expression. Embodiments of the flexible query hints system and method include a flexible query hint user interface that allow users to interactively adjust query hints.
Abstract:
A relational database server may concurrently execute many relational queries, but a complex relational query may cause performance delays in the fulfillment of other relational queries. Instead, the relational database server may generate a query plan for the relational query, and may endeavor to partition the relational query between a spool operator and a scan operator into two or more query slices, where each query slice may be executed within a query slice threshold. Many alternative candidate query plans may be considered, such as inserting spool and scan operators after various operators and parameterizing operators in order to partition the records of a relation into two or more ranges based on an attribute of the relation. A large search space of candidate query plans may be reviewed in order to select a query plan that respects the query slice threshold while efficiently executing the logic of the relational query.
Abstract:
A database server may be configured to compute distinct page counts of pages accessed to execute operands of respective queries. The queries may be executed against a table comprised of the pages and having an index managed by the database server. The distinct page counts may be obtained by counting, as a part of the executing of the queries, distinct pages accessed during the execution of the queries.
Abstract:
A query progress indicator that provides an indication to a user of the progress of a query being executed on a database. The indication of the progress of the query allows the user to decide whether the query should be allowed to complete or should be aborted. One method that may be used to estimate the progress of a query that is being executed on a database defines a model of work performed during execution of a query. The total amount of work that will be performed during execution of the query is estimated according to the model. The amount of work performed at a given point during execution of the query is estimated according to the model. The progress of the query is estimated using the estimated amount of work at the given point in time and the estimated total amount of work. This estimated progress of query execution may be provided to the user.
Abstract:
An exhaust gas recirculation system for a compression ignition engine is provided wherein the exhaust gas recirculation is shut off depending upon the sensed or calculated humidity in the intake manifold relative to the dew point of the exhaust/intake air mixture. The humidity of the exhaust/intake air mixture may be measured in the intake manifold, charge air mixer or the ambient humidity may be sensed. If humidity is measured in the air charge mixer or in the ambient air, other factors such as engine speed and load, intake manifold pressure, EGR flow and air/fuel ratio may be used to calculate the humidity in the intake manifold. When the temperature of the mixture in the intake manifold is less than the dew point of the mixture, the engine control strategy may be shut off the EGR to prevent condensation in the exhaust gas recirculation system or engine.
Abstract:
A NOx estimation system includes an operating mode determination module that determines an operating mode of an engine, and an emission prediction module. The emission prediction module estimates NOx emission based on the operating mode, a plurality of sensed parameters, and a map. The map correlates the plurality of sensed parameters to the NOx emission based on the operating mode.
Abstract:
Database systems use a plan cache to avoid the overheads (e.g., time, money) of query recompilation. Query plans can become invalidated by updates to the statistics on data or changes to the physical database design. Once a plan is invalidated, it can be repaired utilizing one or more of the disclosed embodiments. Incremental repair of query plans includes reusing parts of the current plan rather than discarding the plan entirely when it is invalidated. Repair to an existing query plan is attempted before resorting to full recompilation.
Abstract:
Stop-and-restart query execution that partially leverages the work already performed during the initial execution of the query to reduce the execution time during a restart. The technique selectively saves information from a previous execution of the query so that the overhead associated with restarting the query execution can be bounded. Despite saving only limited information, the disclosed technique substantially reduces the running time of the restarted query. The stop-and-restart query execution technique is constrained to save and reuse only a bounded number of records (intermediate records or output records) thereby releasing all other resources, rather than some of the resources. The technique chooses a subset of the records to save that were found during normal execution and then skipping the corresponding records when performing a scan during restart to prevent the duplication of execution. A skip-scan operator is employed to facilitate the disclosed restart technique.