Abstract
Data processing often results in generation of a lot of temporary structures. They cause an increase in processing time and resources consumption. This especially concerns databases since their temporary data are huge and often they must be dumped to secondary storage. This situation has a serious impact on the query engine. An interesting technique of program fusion has been proposed for functional programming languages. Its goal is to reduce the size or entirely eliminate intermediate structures. In this paper we show how this technique can be used to generate robust execution plans of aggregate and recursive queries of query languages based on Stack Based Approach. We will use SBQL as an exemplary language.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wadler, P.: Deforestation: Transforming programs to eliminate trees. Theor. Comput. Sci. 73(2), 231–248 (1990)
Gill, A.J., Launchbury, J., Jones, S.L.P.: A short cut to deforestation. In: FPCA, pp. 223–232 (1993)
Johann, P.: Short cut fusion: Proved and improved. In: Taha, W. (ed.) SAIG 2001. LNCS, vol. 2196, pp. 47–71. Springer, Heidelberg (2001)
Jones, S.P., Tolmach, A., Hoare, T.: Playing by the rules: rewriting as a practical optimisation technique in GHC. In: Haskell Workshop, ACM SIGPLAN, pp. 203–233 (2001)
Grust, T., Scholl, M.H.: Query deforestation. Technical report, Faculty of Mathematics and Computer Science, Database Research Group, University of Konstanz (1998)
Trigoni, A.: Semantic optimization of OQL queries. Technical Report UCAM-CL-TR-547, University of Cambridge, Computer Laboratory (2002)
Subieta, K.: Theory and Construction of Object Query Languages [in Polish]. Publishers of the Polish-Japanese Institute of Information Technology (2004)
Gill, A.: Cheap deforestation for non-strict functional languages. PhD thesis, The University of Glasgow (1996)
Subieta, K., Beeri, C., Matthes, F., Schmidt, J.W.: A stack-based approach to query languages. In: East/West Database Workshop, pp. 159–180 (1994)
OMG Object Database Technology Working Group: Next-generation object database standarization. White Paper (2007)
Rogińska, M., Wiśniewski, P.: Pysbql - python-like query language constructed using stack base approach. In: Annales UMCS, Informatica, pp. 143–151 (2007)
Płodzień, J.: Optimization Methods in Object Query Languages. PhD thesis, Institute of Computer Science, Polish Academy of Science, Warsaw, Poland (2000)
Pieciukiewicz, T., Stencel, K., Subieta, K.: Recursive Query Processing in SBQL. In: Proceedings of the First International Conference on Object Databases, pp. 56–76 (2008)
Ohori, A., Sasano, I.: Lightweight fusion by fixed point promotion. In: Hofmann, M., Felleisen, M. (eds.) POPL, pp. 143–154. ACM, New York (2007)
Stencel, K., et al.: LoXiM database project (2010), http://loxim.sourceforge.net/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burzańska, M., Stencel, K., Wiśniewski, P. (2010). Intermediate Structure Reduction Algorithms for Stack Based Query Languages. In: Kim, Th., Kim, HK., Khan, M.K., Kiumi, A., Fang, Wc., Ślęzak, D. (eds) Advances in Software Engineering. ASEA 2010. Communications in Computer and Information Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17578-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-17578-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17577-0
Online ISBN: 978-3-642-17578-7
eBook Packages: Computer ScienceComputer Science (R0)