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. © 2012 IEEE.
Recommended Citation
V. K. Nerella et al., "Exploring Compile Time Caching of Explicit Queries in Programming Codes," Proceedings of the IEEE Symposium on Reliable Distributed Systems, pp. 477 - 478, article no. 6424899, Institute of Electrical and Electronics Engineers, Dec 2012.
The definitive version is available at https://doi.org/10.1109/SRDS.2012.27
Department(s)
Computer Science
International Standard Serial Number (ISSN)
1060-9857
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Dec 2012
