Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

An Effective Mobile Web Object Navigation Based on the Steiner Tree Approach

스타이너트리 기반의 효과적인 모바일 웹 오브젝트 네비게이션

  • 이우기 (인하대학교 산업공학과) ;
  • 송종수 (인하대학교 산업공학과) ;
  • 이정훈 (인하대학교 산업공학과)
  • Received : 2010.11.19
  • Accepted : 2011.01.24
  • Published : 2011.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

One of the fundamental roles of web object navigation is to support what the user wants precisely and efficiently from the enormous web database to the web browser. As long as the web search results are a set of individual lists, it is all right to display each and every web result for the web browser to display a web object one by one. However, in case the search results are a collection of multiple interrelated web objects, then there is a need to represent for a new mechanism for linked web objects at a time. We define a unit of web objects derived from a Steiner tree where the web objects include a set of specific keywords calculated by the weight from which the solutions are extracted. Even if a web object does not include all the keywords, then the related hypertext linked web objects are derived and displayed onto the mobile web browser with meta data in one shot. In this paper, it is applied for the mobile browser that the web contents can dynamically be displayed with Steiner trees until each renewal of the navigation request may be issued. In this paper, a new synchronized mobile browsing method is developed so that the navigating time can drastically be reduced and the web navigating efficiency can be dramatically enhanced without sacrificing memory consumption.

Keywords

References

  1. Akbarinia, R., E. Pacitti, and P. Valduriez, "Best Position Algorithms for Top-k Queries," VLDB, (2007), pp.495-506.
  2. Amer-Yahia, S., A. Doan, J.M. Kleinberg, N. Koudas, and M. Franklin, "Crowds, clouds, and algorithms : exploring the human side of 'big data' applications," SIGMOD, (2010), pp.1259-1260.
  3. Byrka, J., F. Grandoni, T. Rothvob, and L. Sanita, "An improved LP-based approximation for steiner tree," STOC, (2010), pp.583-592.
  4. Consoli, S., K. Darby-Dowman, N. Mladenovic, and J.A. Moreno-Perez, "Variable neighbourhood search for the minimum labelling Steiner tree problem," Annals OR, Vol. 172, No.1(2009), pp.71-96. https://doi.org/10.1007/s10479-008-0507-y
  5. Fagin, R., A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," PODS, (2001), pp.102-113.
  6. Fagin, R., "Combining Fuzzy Information from Multiple Systems," PODS, (1996), pp.216-226.
  7. Glover, E.J., D.M. Pennock, S. Lawrence, and R. Krovetz, "Inferring Hierarchical Descriptions," Proc. CIKM, (2002), pp.507-514.
  8. Gouveia, L. and J. Telhada, "The multiweighted Steiner tree problem : A reformulation by intersection," Computers and OR, Vol.35, No.11(2008), pp.3599-3611. https://doi.org/10.1016/j.cor.2007.03.003
  9. Gouveia, L., P. Moura, and A. Sousa, "Prize collecting Steiner trees with node degree dependent costs," Computers and OR, Vol.38, No.1(2011), pp.234-245. https://doi.org/10.1016/j.cor.2010.04.016
  10. Guoliang, L., O.C. Beng, F. Jianhua, W. Jianyong, and Z. Lizhu, "EASE : an effective 3- in-1 keyword search method for unstructured, semi-structured and structured data," In Proc. SIGMOD, (2008), pp.903-914.
  11. Gupta, A. and A. Kumar, "A constant-factor approximation for stochastic Steiner forest. STOC," (2009), pp.659-668.
  12. Hammami, M.Y. Chahir, and L. Chen, "Web-Guard : A Web Filtering Engine Combining Textual, Structural, and Visual Content-Based Analysis," IEEE TKDE, Vol.18, No.2 (2006), pp.272-284.
  13. Kasneci, G., M. Ramanath, M. Sozio, F. M. Suchanek, and G. Weikum, "STAR : Steiner-Tree Approximation in Relationship Graphs," In Proc. ICDE, (2009), pp.868-879.
  14. Kleinberg, J.M., A. Slivkins, and T. Wexler, "Triangulation and embedding using small sets of beacons," J. ACM, Vol.56, No.6(2009).
  15. Kleinberg, J.M. and S. Lawrence, "The Structure of the Web," Science, Vol.294 (2001), p.1849. https://doi.org/10.1126/science.1067014
  16. Lee, W., K.S. Carson, J. Leung, J.H. Lee, "Mobile Web Navigation in Digital Ecosystems Using Rooted Directed Trees," IEEE TIE, 2011(in-print).
  17. Lee, W.J., J.-H. Lee, Y. Kim, C.K-S. Leung, "AnchorWoman : top-k structured mobile web search engine," CIKM, (2009), pp.2089-2090.
  18. Lee, W., J. Song, J. Baek, and J. Lee., "Steiner Tree based Effective Mobile Web Search," Proc. KORMS Conference, 2010.
  19. Li, W., K. Candan, Q. Vu, and D. Agrawal, "Retrieving and Organizing Web Pages by Information Unit," In Proc. WWW, (2001), pp.230-244.
  20. Maserrat, H. and J. Pei, "Neighbor query friendly compression of social networks," KDD, (2010), pp.533-542.
  21. Pandurangan, G., P. Raghavan, and E. Upfal, "Using PageRank to Characterize web Structure," Proc. COCOON, (2002), pp.330-339.
  22. Pinto, L.L. and G. Laporte, "An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions," European Journal of Operational Research, Vol.207, No.1(2010), pp.45-49. https://doi.org/10.1016/j.ejor.2010.03.027
  23. Rothlauf, F., "On Optimal Solutions for the Optimal Communication Spanning Tree Problem," Operations Research, Vol.57, No.2 (2009), pp.413-425. https://doi.org/10.1287/opre.1080.0592
  24. Whittaker, G., R. Confesor Jr., S.M. Griffith, R. Fare, S. Grosskopf, J.J. Steiner, G.W. Mueller-Warrant, and G.M. Banowetz "A hybrid genetic algorithm for multiobjective problems with activity analysis-based local search," European Journal of Operational Research, Vol.193, No.1(2009), pp.195-203. https://doi.org/10.1016/j.ejor.2007.10.050