title: Good algorithm for managing configuration trees with wildcards?
body: <p>I am searching for a good algorithm for managing configuration variables in form of tree with wildcards (x.y.z, x.<em>.z, x.</em>.* etc.). </p>
  
  <p>Is there something with search time better than O(N)? (insert / delete time are not so important).</p>
  
  <p>Currently I have a flat list (pairs key=>value), and I search all matching values, then sort them by importance (basically, more wildcards => less important) and choose one with best score. </p>