HTU : An Efficient Hash-Trie Data Structure for URL matching for Programmable Web Resources

The world-wide-web is growing at an alarming rate. The number of websites and web-resources available on the internet is growing following the axioms of Moore-law. Such enormous growth is due to the addition of static website content and a large number of dynamic web-resources. A significant portion of it is the addition of REST based web-services which allows creating programmable web-resources that can be added, modified and removed using the ubiquitous HTTP protocol. As a result, the current generation of web-servers not only has to provide access to static resources but also of dynamic nature. We propose a new data structure that can be embedded in HTTP servers. The data structure is optimized to handle REST based services. It reads REST based service declarations, organizes the various methods in an optimized way for faster access and scale to support thousands of concurrent users.