Databases
StackOverflow2013
Postsdbo
PODisk backed dictionary/cache for c#
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PODisk backed dictionary/cache for c#
    primarykey
    data
    text
    <p>I'm looking for a drop in solution for caching large-ish amounts of data.</p> <p>related questions but for different languages:</p> <ul> <li><a href="https://stackoverflow.com/questions/226693/python-disk-based-dictionary">Python Disk-Based Dictionary</a></li> <li><a href="https://stackoverflow.com/questions/149488/disk-backed-stl-container-classes">Disk-backed STL container classes?</a></li> </ul> <p>Close question in different terms:</p> <ul> <li><a href="https://stackoverflow.com/questions/100235/looking-for-a-simple-standalone-persistant-dictionary-implementation-in-c">Looking for a simple standalone persistant dictionary implementation in C#</a></li> </ul> <p>I don't need (or want to pay anything for) persistence, transactions, thread safety or the like and want something that is not much more complex to use than a List&lt;> or Dictionary&lt;>.</p> <p>If I have to write code, I'll just save everything off as files in the temp directory:</p> <pre><code>string Get(int i) { File.ReadAllText(Path.Combine(root,i.ToString()); } </code></pre> <p>In my cases in index will be an <code>int</code> (and they should be consecutive or close enough) and the data will be a <code>string</code> so I can get away with treating both a <a href="http://en.wikipedia.org/wiki/Plain_Old_Data_Structures" rel="nofollow noreferrer">POD</a> and would rather go ultra-light and do exactly that.</p> <p>The usage is that I have a sequence of 3k files (as in file #1 to #3000) totaling 650MB and need to do a diff for each step in the sequence. I expect that to total about the same or a little more and I don't want to keep all that in memory (larger cases may come along where I just can't).</p> <hr> <p>A number of people have suggested different solutions for my problem. However none seem to be targeted at my little niche. The reasons that I'm looking at disk backed caching is because I'm expecting that my current use will use up 1/3 to 1/2 of my available address space. I'm worried that larger cases will just flat run out of space. I'm not worried about treading, persistence or replication. What I'm looking for is a minimal solution using a minimum of code, a minimal usage foot print, minimal in memory overhead and minimum complexity.</p> <p>I'm starting to think I'm being overly optimistic. </p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USCommunity
    1. USBCS
    plurals
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    3. PL
      singulars
      1. LTLinked
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. PODisk backed dictionary/cache for c#
      1. USDour High Arch
      1. VTFavorite
    2. VO
      singulars
      1. PODisk backed dictionary/cache for c#
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PODisk backed dictionary/cache for c#
      1. This table or related slice is empty.
      1. VTUpMod
    1. COWhy not the filesystem? That is what is designed for...
      singulars
      1. PODisk backed dictionary/cache for c#
      1. USRedFilter
    2. COI will if someone can't point me to something better that is already written.
      singulars
      1. PODisk backed dictionary/cache for c#
      1. USBCS
    3. CODoesn't a disk-based cache kind of defeat the entire purpose of a caching mechanism?
      singulars
      1. PODisk backed dictionary/cache for c#
      1. USRobert C. Barth
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload