[jira] Work started: (TS-87) Performance improvement: Avoid linear search in remap code

["Leif Hedstrom (JIRA)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/TS-87?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Work on TS-87 started by Leif Hedstrom.

> Performance improvement: Avoid linear search in remap code
> ----------------------------------------------------------
>
>                 Key: TS-87
>                 URL: https://issues.apache.org/jira/browse/TS-87
>             Project: Traffic Server
>          Issue Type: Improvement
>          Components: Core
>            Reporter: Manjesh Nilange
>            Assignee: Leif Hedstrom
>            Priority: Minor
>             Fix For: 2.0.0a
>
>         Attachments: trie.patch
>
>
> Currently, the remap code stores all the remap rules in a hash table keyed by the host field of the "from URL" of the rule. Entries with the same host field are chained in a linked list. When looking for a mapping, the code has to do a linear traversal of this list, based on the path of the incoming request to find a matching rule. This performance should be improved as overhead can be substantial in cases where there are hundreds of the entries for the same host.

-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.