A Dynamic Architecture for Transformation of Programs In Terms Of Asynchronous and Batched Submission

International Journal of Computer Science and Engineering

© 2016 by SSRG - IJCSE Journal

Volume 3 Issue 7

Year of Publication : 2016

Authors : V.S.Raju, Ramesh Peramalasetty

10.14445/23488387/IJCSE-V3I7P104

How to Cite?

V.S.Raju, Ramesh Peramalasetty, "A Dynamic Architecture for Transformation of Programs In Terms Of Asynchronous and Batched Submission," SSRG International Journal of Computer Science and Engineering , vol. 3,  no. 7, pp. 23-26, 2016. Crossref, https://doi.org/10.14445/23488387/IJCSE-V3I7P104

Abstract:

The execution of use is relying upon backend calls like database calls and/or web administrations. As number of calls increments at backend side, the execution of use reductions as it calls and/or executes same question and/or method/works numerous times. So it corrupts execution. This issue can be illuminated by making a clump of parameters, and by revamping the inquiry/strategy. It depends on project examination and revamp rules, for computerize the era of bunched types of strategies and supplant iterative database calls inside basic circles with a solitary call to the grouped structure. Such manual revamping is tedious and mistake inclined. The system change strategy relies on upon information stream examination which handles question executions inside circles. At runtime, it can consolidate various offbeat solicitations into bunches. The creator has utilized non-concurrent question accommodation and bunching method together to enhance execution pick up. The creator has displayed DBridge, a novel static examination also, program change apparatus to streamline database access. It actualizes these system change procedures for Java programs that utilization JDBC to get to database. It utilizes the SOOT improvement structure for static investigation. The creator has displayed SOOT structure for upgrading Java byte code.

Keywords:

The creator has displayed SOOT structure for upgrading Java byte code.

References:

[1] R. Guravannavar and S. Sudarshan, “Rewriting procedures for batched bindings,” in Proc. Int. Conf. Very Large Databases, 2008 pp. 1107–1123.
[2] M. Chavan, R. Guravannavar, K. Ramachandra, and S. Sudarshan, “DBridge: A program rewrite tool for set-oriented query execution,” in Proc. IEEE 27th Int. Conf. Data Eng., 2011, pp. 1284–1287.
[3] K. Ramachandra, R. Guravannavar, and S. Sudarshan, “Program analysis and transformation for holistic optimization of databaseapplications,” in Proc. ACM SIGPLAN Int. Workshop State Art Java Program Anal., 2012, pp. 39–44.
[4] M. Chavan, R. Guravannavar, K. Ramachandra, and S. Sudarshan, “Program transformations for asynchronous query submission,” in Proc. IEEE 27th Int. Conf. Data Eng., 2011, pp. 375–386.
[5] R. Guravannavar, “Optimization and evaluation of nested queries and procedures,” Ph.D. dissertation, Dept. Comput. Sci. Eng., Indian Inst. Technol., Bombay, India, 2009.
[6] J. Ferrante, K. J. Ottenstein, and J. D. Warren, “The program dependence graph and its use in optimization,” ACM Trans. Program. Lang. Syst., vol. 9, no. 3, pp. 319–349, 1987
[7] K. Kennedy and K. S. McKinley, “Loop distribution with arbitrary control flow,” in Proc. ACM/IEEE Conf. Supercomput., 1990, pp. 407–416.
[8] A. Manjhi, C. Garrod, B. M. Maggs, T. C. Mowry, and A. Tomasic, “Holistic query transformations for dynamic web applications,” in Proc. IEEE 25th Int. Conf. Data Eng., 2009, pp. 1175–1178.
[9] G. Graefe, “Executing nested queries,” in Proc. 10th Conf. Database Syst. Business, Technol. Web, 2003.
[10] M. Elhemali, C. A. Galindo-Legaria, T. Grabs, and M. M. Joshi, “Execution strategies for SQL subqueries,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2007, pp. 993–1004.