fragmenting steiner tree browsers based on ajax
The proliferation of Web content and web based services urges the need for a browser that effectively and efficiently returns the information desired by a user. As long as the web search results are a set of individual lists, it is appropriate to display top-k result as an individual list of each and every web page by the web browser. However, in case the search result is a collection of multiple interrelated web pages, there is a need for a new display mechanism for fragmented web pages at a time. In this paper, we present a novel approach to design and develop a new kind of Fragmented Web browser that displays a Steiner tree as the unit of search result. The Steiner tree web pages that include a set of specific keywords are calculated by the weight from which the solutions are extracted. Additionally, even if a web page does not include all the keywords, the related web pages linked by the hypertext links are derived and displayed onto the fragmented web browser. In order to reach our goal, we design the web browser using AJAX technology as the code enables division of web pages synchronously, which has not been possible by applying the traditional methods. In this paper, we invented a new synchronized browser division method with which the searching time can drastically be reduced and the web searching efficiency can be dramatically enhanced without sacrificing memory consumption. We have experimented with a real-life data set to present the proof of concept of our work.
steiner tree browser ajax top-k results keyword search