会议专题

An Algorithm for URL Routing Based on Trie Structure

  In this paper, a new algorithm based on trie structure is applied to URL routing systems like web MVC system and enterprise service bus, where the routing rules not stored as a table containing regular expressions but a trie.As a result, the table traversing in routing process is replaced by a depth-first searching for trie.Because the static pattern segments are stored as a hash table, the time complexity of matching static pattern are O(1), so that the whole time taken in routing process is reduced.The experiment shows that,compared to ASP.NET routing module which use the route table, the routing module with this algorithm have excellent performance when there are plenty of routing rules in system.It just cost about 10% time of the ASP.NET routing module.

URL routing system trie structure service bus

Yijun Zhang Lizhen Xu

Southeast University

国际会议

The 12th Web Information System and Application Conference第十二届全国Web信息系统及其应用学术会议(WISA2015)、全国第十次语义Web 与本体论学术研讨会(SWON2015)、全国第九次电子政务技术及应用学术研讨会(EGTA2015)

济南

英文

157-160

2015-09-11(万方平台首次上网日期,不代表论文的发表时间)