内存映射 - 部分基于磁盘的算法 [英] Memory mapped - partially disk based algorithms

问题描述

有没有什么好的资源或书籍可溢出的数据结构，也就是说，排队？

当存储大对象时，它可能会填满所有内存，但如果您可以保留内存中最常用的该队列结构的项目，其余的在磁盘上（类似分页）。

同样，此问题也适用于其他结构，如链表，数组，哈希表等。

解决方案

您要查找的内容可能是I / O高效算法的主题。
Google搜索没有为我提供任何图书，但这个课程页面包含与您可能相关或可能不相关的文章列表。

您还应该查看 B-tree的WikiPedia页面，特别是文件系统中的B树。

Are there any good resources or books for spillable data structures, that is, say, a queue?

When storing large objects it could fill up all of memory, but if you can keep, say, the most used items of that queue structure in memory and the rest on disk (sort of like paging).

Similarly, this question applies to other structures such as linked lists, arrays, hashtables and so on.

解决方案

What you are looking for might be the topic of I/O efficient algorithms. A Google search didn't turn up any books for me, but this course page contains a list of articles which may or may not be relevant for you.

You should also take a look at the WikiPedia page for B-trees, especially the section on B-trees in filesystems.

这篇关于内存映射 - 部分基于磁盘的算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！