Databases
StackOverflow2013
Postsdbo
POGiven a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POGiven a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
    primarykey
    data
    text
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USPeter Mortensen
    1. USuser288609
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    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. POGiven a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POGiven a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POGiven a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
      1. This table or related slice is empty.
      1. VTUpMod
    1. COFor ~1.76e9 blocks, a bloom filter of size roughly 7e8 bits or 700MB with 5 hash functions should give you a false positive probability of about 1/8.0e9, which should be *more* than enough.
      singulars
      1. POGiven a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
      1. This table or related slice is empty.
    2. CO@Monomer: maybe put that in an answer? I don't see anyone else who's gotten it. Make it community wiki if you'd like others to flesh out the details.
      singulars
      1. POGiven a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
      1. USPotatoswatter
    3. CO@Potatocorn: feel free to take up the answer. btw, I'd suggest the mitzenmacher paper about only neededing 2 hash functions, might be interesting.
      singulars
      1. POGiven a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
      1. This table or related slice is empty.
 

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