4 ms·
@rescrv I remember seeing some of your earlier posts about HyperDex. It continues to be an interesting project to follow. I had several questions that I didn
by DEinspanjer 14y ago
@rescrv I remember seeing some of your earlier posts about HyperDex. It continues to be an interesting project to follow.
I had several questions that I didn't see covered in the docs. Would love to see them answered somewhere:
1. If you have more than f faults and the cluster shuts down, what are the ramifications? How do you start it back up and recover? What if one or more of the faulted nodes are unrecoverable? Can you easily recover the partial data?
2. Can you perform OR logic in searches? i.e. Where attribute is 'a' OR 'b'?
3. Where is the new count method documented?
4. Is it possible to add new attributes to an existing space? Add new subspaces? Remove subspaces? What is the storage/memory cost associated with subspaces?
5. Are there plans for grouping and aggregation of any sort? I've been searching for a while to find a good key/value or document store system that can provide very expressive searching in combination with grouping and aggregation to provide an analytic platform for storing documents that don't fit very well in a traditional SQL store due to complexity of the structure (nested lists, etc) or dynamic addition of attributes.
- rescrv 14y ago1. In the current release it's possible to completely shutdown the cluster. You cannot just cut power, but it's relatively painless to do otherwise. Checkout http://hyperdex.org/doc/06.faults/#shutting-down-and-restoring-a-cluster http://hyperdex.org/doc/06.faults/#shutting-down-and-restori... for more details. 2. Currently you cannot perform OR logic in searches. It'd be relatively easy to add though, so we'll probably do so in the future. It's possible to do two searches concurrently and combine the results. 3. This is an oversight on our part. We have to document it. In the Python bindings, you call it the same way as a regular search, but instead of getting a generator that yields objects, you simply get a number. 4. Currently, things are pretty static. We've got ideas for changing that, but just haven't pursued it yet. Each subspace replicates the data again. The memory cost of a subspace is nearly nothing (just a list of replicas). 5. I think that one-level group-by might be achievable, similar to our sorted_search primitive. There's a lot of research that people have done on this topic, and it's very interesting. That being said, the simple/straightforward approach would probably be what we'd take. Thanks for following the project!