147 reputation
4
bio website blog.soluciones3f.com.ar
location Buenos Aires, Argentina
age 34
visits member for 2 years
seen Feb 22 at 16:12

Oct
2
awarded  Popular Question
Jan
18
accepted Bloom filters or similar, but with no false positive
Jan
11
comment Bloom filters or similar, but with no false positive
A cache would not work for me. No item will be check twice. I have a big csv with one key that I am assured have no duplicates. I just need to check which are already in the system. Unfortunately to go to the db to check the existence for every key is a slow process that I am trying to improve. Being keys in the file unique, I don't see how a LRU o MRU cache could improve something. Maybe I could sort the input file.. and some cache technique using along with tries to reduce memory consumption could help.. but I prefer a "lazy programmer" approach jejejeje.
Jan
10
comment Bloom filters or similar, but with no false positive
There is no probabilistic shortcuts even when I do allow false negatives? Hash tables is out of question because the size of the sets (one set can fit in memory, but all of them no). Tries.. may be is a good fit. I should try.
Jan
10
asked Bloom filters or similar, but with no false positive
Aug
19
accepted Serializing an object in different ways
Aug
19
comment Serializing an object in different ways
Just for being the first to respond and taught me the name of what I was doing, I am choosing this answer as correct. But @matcauthon is worthy.
Jul
14
asked Serializing an object in different ways
May
18
awarded  Popular Question
Oct
10
awarded  Student
Oct
6
awarded  Scholar
Oct
6
accepted Should I use a workflow engine?
Sep
27
asked Should I use a workflow engine?