Timeline for Data structure for a static set of sets
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 4, 2015 at 7:04 | vote | accept | Curious | ||
| Mar 3, 2015 at 23:58 | history | tweeted | twitter.com/#!/StackCompSci/status/572908937311358976 | ||
| Mar 2, 2015 at 20:48 | answer | added | got trolled too much this week | timeline score: 8 | |
| Mar 2, 2015 at 12:01 | comment | added | Raphael | What is the underlying problem? This smells like maybe there's a better solution if you start over. | |
| Mar 2, 2015 at 11:58 | history | edited | Raphael |
edited tags
|
|
| Mar 2, 2015 at 10:41 | comment | added | Zsbán Ambrus | In the future, when you cross-post, please link back to the other versions of the question cstheory.stackexchange.com/q/30655/8067 "datastructure for collection of sets" stackoverflow.com/q/28802695 "Data structure for approximate set matching" | |
| Mar 2, 2015 at 10:14 | comment | added | user3613886 | @Curious here or here; if it is static, you have memory, and want all operatiosn be sublinear, then build a seperate structure for each operation, this is imo the only way to achieve sublinearty for all operations. | |
| Mar 2, 2015 at 10:10 | comment | added | Curious | Can we talk about at least subset and superset operations? | |
| Mar 2, 2015 at 10:07 | comment | added | Curious | But the question talks about searching subset, superset in collection U. Most of the data structures related to set talk about searching an element in a set. | |
| Mar 2, 2015 at 10:02 | history | edited | Curious | CC BY-SA 3.0 |
added 47 characters in body
|
| Mar 2, 2015 at 10:00 | history | edited | Juho | CC BY-SA 3.0 |
added 219 characters in body; edited title
|
| Mar 2, 2015 at 9:54 | comment | added | user3613886 | Which operations need to be sublinear? I don't think you can have all operations sublinear. So a set contains maximal 4 elements? and approximate set matching is when a it only differs by one element? and in your sets the position of the elements is not important? | |
| Mar 2, 2015 at 9:46 | comment | added | Curious | So, with bitvector representation, I have to compare my input against every set in U? | |
| Mar 2, 2015 at 6:56 | comment | added | Curious | The trivial solution would be to compare the input set with every set in U. I am looking for a more efficient solution. The number of sets in U is over a million. | |
| Mar 2, 2015 at 6:38 | review | First posts | |||
| Mar 2, 2015 at 6:46 | |||||
| Mar 2, 2015 at 6:36 | history | asked | Curious | CC BY-SA 3.0 |