对比两种标签浏览缓存策略，发现按资源缓存更高效
Query-based versus resource-based cache strategies in tag-based browsing systems
- 用选中标签或筛选资源作为缓存索引
- 基于资源的缓存策略运行速度更快
- 适合数字人文等大规模标签系统
标签浏览是数字图书馆中流行的交互模型，用户通过选择描述性标签来过滤资源。典型实现依赖倒排索引，但更新浏览状态需大量集合运算。为缓解此问题，可采用合适的缓存策略。本文比较了两种策略：(i) 查询型缓存，按已选标签集合索引浏览状态；(ii) 资源型缓存，按筛选出的资源集合索引浏览状态。实验基于数字人文领域的真实网络资源集合，结果表明资源型策略在运行时性能上明显优于查询型策略。
原文摘要 · Abstract (English)
Tag-based browsing is a popular interaction model for navigating digital libraries. According to this model, users select descriptive tags to filter resources in the collections. Typical implementations of the model are based on inverted indexes. However, these implementations can require a considerable amount of set operations to update the browsing state. To palliate this inconven-ience, it is possible to adopt suitable cache strategies. In this paper we describe and compare two of these strategies: (i) a query-based strategy, according to which previously computed browsing states are indexed by sets of selected tags; and (ii) a resource-based strategy, according to which browsing states are in-dexed by sets of filtered resources. Our comparison focused on runtime perfor-mance, and was carried out empirically, using a real-world web-based collec-tion in the field of digital humanities. The results obtained show that the re-source-based strategy clearly outperforms the query-based one.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。