Speeding-up data-driven applications with program summaries

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Speeding-up data-driven applications with program summaries

Full text

Pdf (636 KB)

Source

ACM International Conference Proceeding Series archive
Proceedings of the 2009 International Database Engineering & Applications Symposium table of contents

Cetraro - Calabria, Italy

SESSION: Full papers table of contents

Pages 66-76

Year of Publication: 2009

ISBN:978-1-60558-402-7

Authors

Sonia Guéhis	Univ. Paris-Dauphine, Paris, France
Virginie Goasdoué-Thion	Univ. Paris-Dauphine, Paris, France
Philippe Rigaux	Univ. Paris-Dauphine, Paris, France

Sponsors

: BytePress
Concordia University : Concordia University
: ACM
: Universita della Calabria, Rende(CS), Italy
: ICAR-CNR, Rende (CS), Italy
: ACM International Conference Proceeding Series

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 12, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1620432.1620440 What is a DOI?

ABSTRACT

We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution at the server side, and partly of query submission and network exchanges between the program and the server. The natural organization of database programs leads to submit an intensive flow of elementary SQL queries to the server, and exploits only locally its optimization power. In this paper, we develop a global optimization approach. We base this approach on an execution model where queries can be executed asynchronously with respect to the flow of the application program. Our method aims at choosing an efficient query scheduling which limits the penalty of client/server interactions. Our results show that the technique can improve the execution time of database programs by several orders of magnitude.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.
	2	P. Bohannon, P. Buneman, B. Choi, and W. Fan. Incremental Evaluation of Schema-Directed XML Publishing. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 503--514, 2004.
	3	P. Bohannon, H. Korth, and P. Narayan. The Table and the Tree: Online Access to Relational Data through Virtual XML Documents. In Intl. Proc. on WebDB 2001 Workshop on Databases and the Web, 2001.
	4	P. Bohannon, H. Korth, P. Narayan, S. Ganguly, and P. Shenoy. Optimizing View Queries in ROLEX to Support Navigable Tree Results. In Proc. Intl. Conf. on Very Large Data Bases (VLDB), 2002.
	5	I. T. Bowman and K. Salem. Optimization of Query Streams Using Semantic Prefetching. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 179--190, 2004.
	6	M. J. Carey, J. Kiernan, J. Shanmugasundaram, E. J. Shekita, and S. N. Subramanian. XPERANTO: Middleware for Publishing Object-Relational Data as XML Documents. In Proc. Intl. Conf. on Very Large Data Bases (VLDB), pages 646--648, 2000.
	7	B. Choi, W. Fan, X. Jia, and A. Kasprzyk. A Uniform System for Publishing and Maintaining XML Data. In Proc. Intl. Conf. on Very Large Data Bases (VLDB), pages 1301--1304, 2004.
	8	U. Dayal. Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers. In Proc. Intl. Conf. on Very Large Data Bases (VLDB), pages 197--208, 1987.
	9	M. F. Fernandez, Y. Kadiyska, D. Suciu, A. Morishima, and W. C. Tan. SilkRoute: A framework for publishing relational data in XML. ACM Trans. on Database Systems, 27(4):438--493, 2002.
	10	R. A. Ganski and H. K. T. Wong. Optimization of Nested SQL Queries Revisited. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 23--33, 1987.
	11	HIBERNATE 3.3.0. Red Hat Middleware, 2004. http://www.hibernate.org.
	12	W. Kim. On Optimizing an SQL-like Nested Query. ACM Trans. on Database Systems, 7(3):443--469, 1982.
	13	B. Ludäscher, Y. Papakonstantinou, and P. Velikhov. Navigation-driven evaluation of virtual mediated views. In Proc. Intl. Conf. on Extending Data Base Technology, pages 150--165, 2000.
	14	H. Pirahesh, J. M. Hellerstein, and W. Hasan. Extensible/Rule Based Query Rewrite Optimization in Starburst. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 39--48, 1992.
	15	Ruby on the Rails. http://rubyonrails.org.
	16	P. Seshadri, H. Pirahesh, and T. Y. C. Leung. Complex Query Decorrelation. In Proc. IEEE Intl. Conf. on Data Engineering (ICDE), pages 450--458, 1996.
	17	J. Shanmugasundaram, E. J. Shekita, R. Barr, M. J. Carey, B. G. Lindsay, H. Pirahesh, and B. Reinwald. Efficiently publishing relational data as XML documents. The VLDB Journal, 10(2--3):133--154, 2001.
	18	D. Shasha and P. Bonnet. Database Tuning: principles, experiments, and troubleshooting techniques. Morgan-Kaufmann, 2002.
	19	TPC Benchmark H (Decision Support), Standard Specification, Revision 2.8.0. Transaction Processing Performance Council, 2008. http://www.tpc.org/tpch.
	20	The XPath language recommandation (1.0). World Wide Web Consortium, 1999. http://www.w3.org/TR/xpath.
	21	The Zend Framework. Zend Technologies. http://framework.zend.com.