Databases
StackOverflow2013
Usersdbo
USSarah
 

Note that there are some explanatory texts on larger screens.

plurals
  1. USSarah
    primarykey
    data
    text
    plurals
    1. POEfficient data storage, partitioning, and selection in d3
      singulars
      1. PTQuestion
    2. PO
      singulars
      1. PTAnswer
    3. POMultiset container appears to stop sorting
      singulars
      1. PTQuestion
    1. POPredicate syntax when partitioning a vector of pointers (C++)
      singulars
      1. PTQuestion
    2. PO
      singulars
      1. PTAnswer
    3. POInserting objects into hash table (C++)
      singulars
      1. PTQuestion
    1. VO
      singulars
      1. PO(How) Can I approximate a "dynamic" index (key extractor) for Boost MultiIndex?
      1. USSarah
      1. VTBountyStart
    1. COThanks to you and the other commenters for correcting my bad ideas about Java. I had also forgotten about the existence of hash sets (or multi-index containers in Boost). In your example in Java, there is still only one instance of each host in memory, right? I absolutely want to avoid copying instances of an object. What you wrote looks easy in Java, but I'm not sure how to use pointers as keys for hash sets in C++. I will look into it. Thanks again.
      singulars
      1. PO
      1. USSarah
    2. COThis is exactly the sort of thing that I haven't done before and wasn't sure could be done. Thanks also for pointing out the memory and insertion time penalties. I think I will avoid it for now, since we will probably start with many serotypes. The random access index, if I understand it correctly, is also slightly costly with insertions and deletions. Option four appears cheapest, assuming that most of the time I need only the number of people of a given age infected with a serotype.
      singulars
      1. PO
      1. USSarah
    3. COThe "Biassed..." link refers again to the Boost libraries, which do not appear to have a PRNG for binomial distributions. The November reference gives a few approximations. Coming up with efficient and high-quality PRNGs from binomial distributions where the number of trials can vary enormously is, from what I understand, something of a mathematical challenge. I was hoping a library already exists that can handle all these scenarios. It looks like I might have to test out TR1 and GSL myself--was hoping others here might already have experience w/ them.
      singulars
      1. PORandom numbers from binomial distribution
      1. USSarah
 

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