Hi togehter,
we'd like to make complex search requests to the database. Normal use (written in Scala using the Java Bindings) is like this:
val search = new HashMap[String, AnyRef]()
search.put("attrx", "bar")
search.put("attry", "foo")
client.search("space", search)Thats already very great. Then one can use somehting like GreaterEqual(...) or other
Predicates.
With the Regex one could implement a OR-query, but I haven't found any documentation, how mighty the Regexes are in Hyperdex.
Is there any documentation? In particular about what's the hyperdex-regex-syntax.
It would be nice if it's possible to efficient do searches like this:
val search = new HashMap[String, AnyRef]()
search.put("attrx", new Regex("bar|baz")) // using java regex syntax
search.put("attry", "foo")
client.search("space", search)Or are there any other solutions, which use the efficiency of the database itself?
Are there other mechanisms?
Other interesting questions: What's the worst/avg/best case of hyperdex-searches? Is a search query only within a defined subspace efficient? How many dimensions are efficient achievable in a subspace and how many overhead procudes a subspace?
Thank you a lot!
Regards,
Sven