Standard
The impact of using combinatorial optimisation for static caching of posting lists. / Petersen, Casper; Simonsen, Jakob Grue; Lioma, Christina.
Information retrieval technology: 11th Asia Information Retrieval Societies Conference, AIRS 2015, Brisbane, QLD, Australia, December 2-4, 2015. Proceedings. ed. / Guido Zuccon; Shlomo Geva; Hideo Joho; Falk Scholer; Aixin Sun; Peng Zhang. Springer, 2015. p. 420-425 (Lecture notes in computer science, Vol. 9460).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Petersen, C
, Simonsen, JG & Lioma, C 2015,
The impact of using combinatorial optimisation for static caching of posting lists. in G Zuccon, S Geva, H Joho, F Scholer, A Sun & P Zhang (eds),
Information retrieval technology: 11th Asia Information Retrieval Societies Conference, AIRS 2015, Brisbane, QLD, Australia, December 2-4, 2015. Proceedings. Springer, Lecture notes in computer science, vol. 9460, pp. 420-425, Asia Information Retrieval Societies Conference, Brisbane, Australia,
02/12/2015.
https://doi.org/10.1007/978-3-319-28940-3_36APA
Petersen, C.
, Simonsen, J. G., & Lioma, C. (2015).
The impact of using combinatorial optimisation for static caching of posting lists. In G. Zuccon, S. Geva, H. Joho, F. Scholer, A. Sun, & P. Zhang (Eds.),
Information retrieval technology: 11th Asia Information Retrieval Societies Conference, AIRS 2015, Brisbane, QLD, Australia, December 2-4, 2015. Proceedings (pp. 420-425). Springer. Lecture notes in computer science Vol. 9460
https://doi.org/10.1007/978-3-319-28940-3_36Vancouver
Petersen C
, Simonsen JG, Lioma C.
The impact of using combinatorial optimisation for static caching of posting lists. In Zuccon G, Geva S, Joho H, Scholer F, Sun A, Zhang P, editors, Information retrieval technology: 11th Asia Information Retrieval Societies Conference, AIRS 2015, Brisbane, QLD, Australia, December 2-4, 2015. Proceedings. Springer. 2015. p. 420-425. (Lecture notes in computer science, Vol. 9460).
https://doi.org/10.1007/978-3-319-28940-3_36Author
Petersen, Casper ; Simonsen, Jakob Grue ; Lioma, Christina. / The impact of using combinatorial optimisation for static caching of posting lists. Information retrieval technology: 11th Asia Information Retrieval Societies Conference, AIRS 2015, Brisbane, QLD, Australia, December 2-4, 2015. Proceedings. editor / Guido Zuccon ; Shlomo Geva ; Hideo Joho ; Falk Scholer ; Aixin Sun ; Peng Zhang. Springer, 2015. pp. 420-425 (Lecture notes in computer science, Vol. 9460).
Bibtex
@inproceedings{ea0d7a5da96f49fcbbd48e15beef4436,
title = "The impact of using combinatorial optimisation for static caching of posting lists",
abstract = "Caching posting lists can reduce the amount of disk I/O required to evaluate a query. Current methods use optimisation procedures for maximising the cache hit ratio. A recent method selects posting lists for static caching in a greedy manner and obtains higher hit rates than standard cache eviction policies such as LRU and LFU. However, a greedy method does not formally guarantee an optimal solution. We investigate whether the use of methods guaranteed, in theory, to and an approximately optimal solution would yield higher hit rates. Thus, we cast the selection of posting lists for caching as an integer linear programming problem and perform a series of experiments using heuristics from combinatorial optimisation (CCO) to nd optimal solutions. Using simulated query logs we nd that CCO yields comparable results to a greedy baseline using cache sizes between 200 and 1000 MB, with modest improvements for queries of length two to three.",
author = "Casper Petersen and Simonsen, {Jakob Grue} and Christina Lioma",
year = "2015",
doi = "10.1007/978-3-319-28940-3_36",
language = "English",
isbn = "978-3-319-28939-7",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "420--425",
editor = "Guido Zuccon and Shlomo Geva and Hideo Joho and Falk Scholer and Aixin Sun and Peng Zhang",
booktitle = "Information retrieval technology",
address = "Switzerland",
note = "Asia Information Retrieval Societies Conference, AIRS2015 ; Conference date: 02-12-2015 Through 04-12-2015",
}
RIS
TY - GEN
T1 - The impact of using combinatorial optimisation for static caching of posting lists
AU - Petersen, Casper
AU - Simonsen, Jakob Grue
AU - Lioma, Christina
PY - 2015
Y1 - 2015
N2 - Caching posting lists can reduce the amount of disk I/O required to evaluate a query. Current methods use optimisation procedures for maximising the cache hit ratio. A recent method selects posting lists for static caching in a greedy manner and obtains higher hit rates than standard cache eviction policies such as LRU and LFU. However, a greedy method does not formally guarantee an optimal solution. We investigate whether the use of methods guaranteed, in theory, to and an approximately optimal solution would yield higher hit rates. Thus, we cast the selection of posting lists for caching as an integer linear programming problem and perform a series of experiments using heuristics from combinatorial optimisation (CCO) to nd optimal solutions. Using simulated query logs we nd that CCO yields comparable results to a greedy baseline using cache sizes between 200 and 1000 MB, with modest improvements for queries of length two to three.
AB - Caching posting lists can reduce the amount of disk I/O required to evaluate a query. Current methods use optimisation procedures for maximising the cache hit ratio. A recent method selects posting lists for static caching in a greedy manner and obtains higher hit rates than standard cache eviction policies such as LRU and LFU. However, a greedy method does not formally guarantee an optimal solution. We investigate whether the use of methods guaranteed, in theory, to and an approximately optimal solution would yield higher hit rates. Thus, we cast the selection of posting lists for caching as an integer linear programming problem and perform a series of experiments using heuristics from combinatorial optimisation (CCO) to nd optimal solutions. Using simulated query logs we nd that CCO yields comparable results to a greedy baseline using cache sizes between 200 and 1000 MB, with modest improvements for queries of length two to three.
U2 - 10.1007/978-3-319-28940-3_36
DO - 10.1007/978-3-319-28940-3_36
M3 - Article in proceedings
SN - 978-3-319-28939-7
T3 - Lecture notes in computer science
SP - 420
EP - 425
BT - Information retrieval technology
A2 - Zuccon, Guido
A2 - Geva, Shlomo
A2 - Joho, Hideo
A2 - Scholer, Falk
A2 - Sun, Aixin
A2 - Zhang, Peng
PB - Springer
T2 - Asia Information Retrieval Societies Conference
Y2 - 2 December 2015 through 4 December 2015
ER -
