B+ Tree versus Ternary Search Tree

Discussion in 'Java' started by Ramkumar Menon, Aug 16, 2005.

  1. 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 ?
    Ramkumar Menon, Aug 16, 2005
    #1
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. Matthew Louden
    Replies:
    1
    Views:
    6,863
    Scott M.
    Oct 11, 2003
  2. Ramkumar Menon

    B+ Tree versus Ternary Search Tree

    Ramkumar Menon, Aug 16, 2005, in forum: Java
    Replies:
    2
    Views:
    1,577
    Roedy Green
    Aug 16, 2005
  3. Ramkumar Menon

    B+ Tree versus Ternary Search Tree

    Ramkumar Menon, Aug 16, 2005, in forum: Java
    Replies:
    1
    Views:
    433
    Andrew Thompson
    Aug 16, 2005
  4. rasmus ekman

    ternary tree (ann)

    rasmus ekman, Feb 14, 2006, in forum: C++
    Replies:
    0
    Views:
    728
    rasmus ekman
    Feb 14, 2006
  5. Paul Butcher
    Replies:
    12
    Views:
    676
    Gary Wright
    Nov 28, 2007
Loading...

Share This Page