Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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.