on-disk | 易学教程

Disk-backed STL container classes? [closed]

阅读更多关于 Disk-backed STL container classes? [closed]

问题 Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed last year . I enjoy developing algorithms using the STL, however, I have this recurring problem where my data sets are too large for the heap. I have been searching for drop-in replacements for STL containers and algorithms which are disk-backed, i.e. the data structures on stored on disk rather than the heap. A friend

Scalable stl set like container for C++

阅读更多关于 Scalable stl set like container for C++

问题 I need to store large number of integers. There can be duplicates in the input stream of integers, I just need to store distinct amongst them. I was using stl set initially but It went OutOfMem when input number of integers went too high. I am looking for some C++ container library which would allow me to store numbers with the said requirement possibly backed by file i.e container should not try to keep all numbers in-mem. I don't need to store this data persistently, I just need to find

B+Tree on-disk implementation in Java

阅读更多关于 B+Tree on-disk implementation in Java

问题 Does anyone know where to find a B+Tree on-disk implementation? I went through google forward and backward and unfortunately I couldn't find anything sensible. Other threads have suggested to maybe take the tree from sqlite, sqljet or bdb but these trees are nested in the whole database and you can't really "just" filter out the B+Tree. I'm really looking for only a on-disk B+Tree... without any fancy things around. 回答1: There is a GDBM-inspired Java persistence engine: MapDB 回答2: If you need

Disk-backed STL container classes? [closed]

阅读更多关于 Disk-backed STL container classes? [closed]

I enjoy developing algorithms using the STL, however, I have this recurring problem where my data sets are too large for the heap. I have been searching for drop-in replacements for STL containers and algorithms which are disk-backed, i.e. the data structures on stored on disk rather than the heap. A friend recently pointed me towards stxxl . Before I get too involved with it... Are any other disk-backed STL replacements available that I should be considering? NOTE: I'm not interested in persistence or embedded databases. Please don't mention boost::serialization, POST++, Relational Template