R
Ramkumar Menon
Hi All,
Was looking out for some benchmarking for B+ Trees vis-a-vis Ternary
Search Trees.
a) For structured search
For instance, user needs to search for some entity. He does so by
giving a set of name-value pairs.
e.g. the search key would be something like propertyName1=value1 or
propertyName2=value2 or propertyName=value3 .....
The "or" can be replaced by "and" too.
The values could be wildcard characters.
b) For unstructured search
User gives only a value. The search implementation figures out the
entity based on the value specified.
For instance, user might give a customerId, or a displayName, or a
owningEntity that may or may not be unique across all entities. In that
case, all matching entities/any one of the matching entities cd be
returned.
In both these cases, which one should I choose to use ?
Was looking out for some benchmarking for B+ Trees vis-a-vis Ternary
Search Trees.
a) For structured search
For instance, user needs to search for some entity. He does so by
giving a set of name-value pairs.
e.g. the search key would be something like propertyName1=value1 or
propertyName2=value2 or propertyName=value3 .....
The "or" can be replaced by "and" too.
The values could be wildcard characters.
b) For unstructured search
User gives only a value. The search implementation figures out the
entity based on the value specified.
For instance, user might give a customerId, or a displayName, or a
owningEntity that may or may not be unique across all entities. In that
case, all matching entities/any one of the matching entities cd be
returned.
In both these cases, which one should I choose to use ?