Daniel P. Miranker, Malcolm C. Taylor, Anand Padmanaban. A Tractable Query Cache by Approximation. In Sven Koenig, Robert C. Holte, editors, Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings. Volume 2371 of Lecture Notes in Computer Science, pages 140-151, Springer, 2002. [doi]
@inproceedings{MirankerTP02,
title = {A Tractable Query Cache by Approximation},
author = {Daniel P. Miranker and Malcolm C. Taylor and Anand Padmanaban},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2371/23710140.htm},
tags = {caching, C++},
researchr = {https://researchr.org/publication/MirankerTP02},
cites = {0},
citedby = {0},
pages = {140-151},
booktitle = {Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings},
editor = {Sven Koenig and Robert C. Holte},
volume = {2371},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43941-2},
}