DocumentCode
3144947
Title
Exploring Compile Time Caching of Explicit Queries in Programming Codes
Author
Nerella, V.K.S. ; Madria, Sanjay ; Weigert, T.
Author_Institution
Dept. of Comput. Sci., Missouri Univ. of Sci. & Technol., Rolla, MO, USA
fYear
2012
fDate
8-11 Oct. 2012
Firstpage
477
Lastpage
478
Abstract
Object oriented programming languages raised the level of abstraction by incorporating first class query constructs explicitly in the program codes. These query constructs allow programmers to express operations over collections as object queries and also provide optimal query execution utilizing query optimization strategies from domain of databases. However, when a query is repeated in the program, it is executed afresh. This paper presents an approach to reduce the run time execution of programs involving explicit queries by caching the results of repeated queries and incrementally maintaining the cached results. We propose determination of cache entries at compile time by performing the program analysis. We also describe the cache heuristics for determining which queries to cache.
Keywords
cache storage; object-oriented languages; object-oriented programming; program compilers; program diagnostics; query processing; abstraction level; compile time cache heuristics; database domain; object oriented programming language; object query; optimal query execution; program analysis; programming code; query construct; query optimization strategy; run time execution; Java; Object oriented programming; Query processing; Reliability;
fLanguage
English
Publisher
ieee
Conference_Titel
Reliable Distributed Systems (SRDS), 2012 IEEE 31st Symposium on
Conference_Location
Irvine, CA
ISSN
1060-9857
Print_ISBN
978-1-4673-2397-0
Type
conf
DOI
10.1109/SRDS.2012.27
Filename
6424899
Link To Document