A RDBMS is usually accessed using blocking drivers like JDBC/ODBC which require clients to block and wait for the result of each query they issue. An asynchronous database access mechanism would eliminate the need for such blocking and greatly improve client performance. Thread-Per-Connection and Thread Pooling are two methods currently being used to provide this asynchrony. This is inefficient since a lot of memory and computing power is spent in creating, scheduling and switching multiple threads. By these methods we cannot show how asynchronous database access can be achieved with a single thread using the Fork-Join mechanism which employs Future objects in Java. So, in this paper we propose an approach for automatically extracting embedded schemas from regular applications, e.g., written in java and automatically computing how schemas change as applications evolve. To showcase our approach, we perform a long-term schema evolution study. Our platform can be used for performing long-term, large-scale embedded schema evolution studies that are potentially beneficial to dynamic updating and schema evolution researchers.
Automatically Extracting Embedded Schemas from Regular Applications
예술인문사회 융합 멀티미디어 논문지
약어 : AJMAHS
2012 vol.2, no.1, pp.25 - 32
DOI : 10.35873/ajmahs.2012.2.1.004
발행기관 : 사단법인 인문사회과학기술융합학회
연구분야 : 학제간연구
Copyright © 사단법인 인문사회과학기술융합학회
약어 : AJMAHS
2012 vol.2, no.1, pp.25 - 32
DOI : 10.35873/ajmahs.2012.2.1.004
발행기관 : 사단법인 인문사회과학기술융합학회
연구분야 : 학제간연구
Copyright © 사단법인 인문사회과학기술융합학회
Thread-Per-Connection, Thread Pooling, Fork-Join mechanism, long-term schema evolution study
- 1. [학술대회] S. Wu / 2011 / Schema Evolution Analysis for Embedded Databases / ICDE Workshops 2011
- 2. [기타] P. Bhattacharya / 2010 / Dynamic updates for web and cloud applications / in APLWACA
- 3. [인터넷자료] / Microsoft: ODBC–Open Database Connectivity Overview
- 4. [인터넷자료] / Oracle: JDBC 4.0 API Specification Final Release
- 5. [단행본] I. Neamtiu / 2006 / Practical dynamicsoftware updating for C in PLDI / ACM Press
- 6. [학술대회] K. Makris / 2009 / Immediate multi-threaded dynamic softwareupdates using stack reconstruction / Proceedings of the 2009 conference on USENIX Annual technical conference, ser. USENIX’09
- 7. [기타] S. Subramanian / 2009 / Dynamic softwareupdates: a vm-centric approach / in PLDI
- 8. [학술지] Mackinnon / 1998 / A Model for Query Decomposition and Answer Construction in Heterogeneous Distributed Database Systems / Journal of Intelligent Information Systems / 11 (1)
- 9. [학술대회] D.-Y. Lin / 2009 / Collateral evolution of applications and databases / ERCIM Workshop on Software Evolution/International Workshop on Principles of Software Evolution
타입을 선택하세요
Automatically Extracting Embedded Schemas from Regular Applications
@article{ART001942481},
author={
Mohamed Hamdi
and
Maricel Balitanas
},
title={
Automatically Extracting Embedded Schemas from Regular Applications
},
journal={
예술인문사회 융합 멀티미디어 논문지
},
issn={2383-5281},
year={2012},
number={1},
pages={25 - 32},
doi={10.35873/ajmahs.2012.2.1.004},
url={http://dx.doi.org/10.35873/ajmahs.2012.2.1.004}
TY - JOUR
AU - Mohamed Hamdi
AU - Maricel Balitanas
TI - Automatically Extracting Embedded Schemas from Regular Applications
T2 - 예술인문사회 융합 멀티미디어 논문지
PY - 2012
VL - 2
IS - 1
PB - 사단법인 인문사회과학기술융합학회
SP - 25 - 32
SN - 2383-5281
AB - A RDBMS is usually accessed using blocking drivers like JDBC/ODBC which require clients to block and wait for the result of each query they issue. An asynchronous database access mechanism would eliminate the need for such blocking and greatly improve client performance. Thread-Per-Connection and Thread Pooling are two methods currently being used to provide this asynchrony. This is inefficient since a lot of memory and computing power is spent in creating, scheduling and switching multiple threads. By these methods we cannot show how asynchronous database access can be achieved with a single thread using the Fork-Join mechanism which employs Future objects in Java. So, in this paper we propose an approach for automatically extracting embedded schemas from regular applications, e.g., written in java and automatically computing how schemas change as applications evolve. To showcase our approach, we perform a long-term schema evolution study. Our platform can be used for performing long-term, large-scale embedded schema evolution studies that are potentially beneficial to dynamic updating and schema evolution researchers.
KW - Thread-Per-Connection, Thread Pooling, Fork-Join mechanism, long-term schema evolution study
DO - 10.35873/ajmahs.2012.2.1.004
UR - http://dx.doi.org/10.35873/ajmahs.2012.2.1.004
ER -
Mohamed Hamdi , Maricel Balitanas (2012). Automatically Extracting Embedded Schemas from Regular Applications. 예술인문사회 융합 멀티미디어 논문지, 2(1), 25 - 32.
Mohamed Hamdi , Maricel Balitanas . 2012, “Automatically Extracting Embedded Schemas from Regular Applications”, vol.2, no.1, pp. 25 - 32. Available from: doi:10.35873/ajmahs.2012.2.1.004
Mohamed Hamdi and Maricel Balitanas “Automatically Extracting Embedded Schemas from Regular Applications“ 예술인문사회 융합 멀티미디어 논문지 2.1 pp. 25 - 32. (2012): 25.
Mohamed Hamdi , Maricel Balitanas . Automatically Extracting Embedded Schemas from Regular Applications 예술인문사회 융합 멀티미디어 논문지 [Internet]. 2012; 2(1), : 25 - 32. Available from: doi:10.35873/ajmahs.2012.2.1.004
Mohamed Hamdi , Maricel Balitanas . “Automatically Extracting Embedded Schemas from Regular Applications“ 예술인문사회 융합 멀티미디어 논문지 2, no.1, (2012): 25 - 32. doi: :10.35873/ajmahs.2012.2.1.004