Corpus ID: 188102841

Holistic Optimization By Prefetching Query results

  title={Holistic Optimization By Prefetching Query results},
  author={Bodepudi Sai Purna Chand},
  journal={Journal of emerging technologies and innovative research},
In this we perform the prefetching opportunities and chaining with algorithms. In many cases, the query is in a procedure which does not offer much scope for prefetching within the procedure; in contrast, our approach can perform prefetching in a calling procedure, even when the actual query is in a called procedure, thereby greatly improving the benefits due to prefetching. 

Figures and Topics from this paper

Apollo: Learning Query Correlations for Predictive Caching in Geo-Distributed Systems
Through extensive experimentation with two different benchmarks, it is shown that Apollo provides significant performance gains over popular caching solutions through reduced query response time, and its robustness and scalability as a predictive cache for geo-distributed database applications. Expand
Optimizing Communication Cost in Distributed Query Processing
This thesis presents an intensive experimental study that emphasizes the crucial impact of middleware configuration on the time for communicating query results, and proposes an effective strategy for calibrating the network-dependent parameters of the communication time estimation function i.e, the costs of first message and non first message in their batch. Expand
Compiling Database Application Programs
This paper studies the automatic specialization and optimization of database application programs -- sequences of queries and updates, augmented with control flow constructs as they appear in database scripts, UDFs, transactional workloads and triggers in languages such as PL/SQL. Expand
Program Analysis and Compilation Techniques for Speeding up Transactional Database Workloads
This thesis proposes a novel transaction repair approach for in-memory databases, and shows how to build an optimizing compiler for transaction programs using generative programming and state-of-the-art compiler technology, and presents techniques for aggressive code inlining, fusion, deforestation, and data structure specialization in the domain of relational transaction programs. Expand
Efficient Estimation of Result Selectivity for Web Query Optimization
Web Query optimization techniques have not scaled up to the quality of classical database optimizers. The main reason is the lack of availability of meta data statistics from local data sources. ThisExpand
A Foundation of Lazy Streaming Graphs
This paper establishes the soundness of DG Calculus through bisimulation with a system for eager graph processing, and features fine-grained in-data lazy processing, endowed with expressive optimizations such as batching, fusion, and splicing. Expand
Compilation and Code Optimization for Data Analytics
The vision of abstraction without regret argues that it is possible to use high-level languages for building performance-critical systems that allow for both productivity and high performance, instead of trading off the former for the latter. Expand


Holistic optimization by prefetching query results
This approach can perform prefetching in a calling procedure, even when the actual query is in a called procedure, thereby greatly improving the benefits due toPrefetching, and incorporated into a tool for holistic optimization called DBridge. Expand
Program transformations for asynchronous query submission
This paper addresses the issue of automatically transforming a program written assuming synchronous query submission, to one that exploits asynchronous query submission and builds a tool that implements the proposed transformation techniques on Java code that uses JDBC calls. Expand
Holistic Query Transformations for Dynamic Web Applications
This paper introduces the concept of source-to-source holistic transformations---transformations that seek to optimize both the application code and the database requests made by it, to reduce clientlatency and evaluates the effect of these two transformations on three realistic Web benchmark applications. Expand
DBridge: A program rewrite tool for set-oriented query execution
DBridge is presented, a novel static analysis and program transformation tool to optimize database access by performing holistic transformations, which include both program and query rewrite. Expand
Optimization and Evaluation of Nested Queries and Procedures
This work proposes a solution, based on program analysis and rewrite rules, to automate the generation of batched forms of procedures and replace iterative database calls within imperative loops with a single call to the batched form. Expand
Program analysis and transformation for holistic optimization of database applications
The design and implementation of DBridge is discussed, with a focus on how the Soot framework has been used to achieve these goals, and some of the future directions for the tool are discussed. Expand
Rewriting procedures for batched bindings
This paper proposes techniques that can be used to automatically rewrite programs to replace multiple calls to a query by a batched call to a correspondingly rewritten query, and Rewrite a stored procedure/function to accept a batch of bindings, instead of a single binding. Expand
Exploiting Asynchronous IO using the Asynchronous Iterator Model
This paper proposes a new iterator model called the Asynchronous Iterator Model, where a getnext() call on an operator can return a status LATER instead of blocking on an IO, permitting other actions to be initiated while an IO is pending. Expand
Execution strategies for SQL subqueries
The basic building blocks that Microsoft SQL Server utilizes to optimize and execute relational subqueries are explored and it is shown that indeed alternative execution strategies are needed in different circumstances, which make a cost-based query optimizer indispensable for adequate query performance. Expand
Loop distribution with arbitrary control flow
A code generation algorithm that produces code for the resulting program without replicating statements or conditions is presented, which is optimal in that it generates the minimum number of new arrays and tests possible. Expand