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

DSouza, Igneta and Singh, Prashant and Dewan, Hrishikesh and Hansdah, RC (2018) HTU : An Efficient Hash-Trie Data Structure for URL matching for Programmable Web Resources. In: 2018 IEEE 11th Conference On Service-Oriented Computing And Applications (SOCA), NOV 19-22, 2018, Paris, FRANCE, pp. 233-238.

PDF Con_Ser-Ori_Com_App_233-238_2018.pdf - Published Version Restricted to Registered users only Download (230kB) | Request a copy

Abstract

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.

Item Type:	Conference Proceedings
Series.:	IEEE International Conference on Service-Oriented Computing and Applications
Publisher:	IEEE
Additional Information:	11th IEEE International Conference on Service-Oriented Computing and Applications (SOCA), Paris, FRANCE, NOV 19-22, 2018
Keywords:	URL Matching; Regular Expressions; HTTP; Load Balancing
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	11 Mar 2019 10:33
Last Modified:	11 Mar 2019 10:33
URI:	http://eprints.iisc.ac.in/id/eprint/61958

Actions (login required)

View Item