Indexing Associated Knowledge Flow on the Web

Abstract:

The Associated Knowledge Flow (AKF) on the Web is an ordered sequence of Web pages that have associated relation. The associated relation from page A to page B indicates that users who have browsed page A is likely to also browse page B. The motivation of this paper is to index the AKFs on the Web and provide users AKFs instead of discrete resources. We build a scalable P2P-based Web resource-sharing system and design two kinds of ID spaces (hash ID space and semantic ID space) on it to index resources and facilitate AKF discovery. Theoretical analysis and simulations show that such a system can achieve logarithmic performance and cost.

• Periodical: Advanced Engineering Forum (Volume 1)
• Pages: 305-309
• DOI: https://doi.org/10.4028/www.scientific.net/AEF.1.305
• Online since: September 2011
• Authors: Xue Chen, Fang Tao, Wu Chao
• Keywords: Associated Knowledge Flow, P2P, Web

References

[1] X. D. Song, Y. Chi, K. Hino, B.L. Tseng, Information flow modeling based on diffusion rate for prediction and ranking, World Wide Web Conf., pp.191-200, (2008).

DOI: 10.1145/1242572.1242599

[2] X. F. Luo, Z. Xu, J. Yu, F. F. Liu, Discovery of associated topics for the intelligent browsing, IEEE Conf. on Ubi-Media Computing, pp.119-125, (2008).

DOI: 10.1109/umedia.2008.4570876

[3] X. Chen, X.F. Luo, S.X. Zhang and Z. Xu, Analysis and Modeling of the Semantically Associated Network on the Web, Concurrency and Computation: Practice and Experience, vol. 22, no. 7, pp.767-787, (2010).

[4] H. Zhuge, X Chen, X. P. Sun, E.L. Yao, HRing: a structured P2P overlay based on Harmonic Series, IEEE TPDS, vol. 19, no. 2, pp.145-158, (2008).

DOI: 10.1109/tpds.2007.70725

[5] Y.W. Zhu, H.H. Wang, Y.M. Hu, Integrating semantics-based access mechanism with P2P file systems, IEEE P2P Computing, pp.118-125, (2003).

DOI: 10.1109/ptp.2003.1231511

[6] H. V. Jagadish, B. C. Ooi and Q. H. Vu, BATON: A Balanced Tree Structure for Peer-to-Peer Networks, Proc. Proc. 31th Int'l Conf. on Very Large Data Bases (VLDB), pp.661-672, (2005).

[7] W. Pugh, Skip Lists: A Probabilistic Alternative to Balanced Trees, Communications of the ACM, vol. 33, no. 6, pp.668-676, (1990).

DOI: 10.1145/78973.78977

[8] N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer and A. Wolman, SkipNet: a Scalable Overlay Network with Practical Locality Properties, Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS), pp.113-126, (2003).

[9] J. Aspnes and G. Shah, Skip Graphs, Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.384-393, (2003).

[10] J. Kleinberg, the Small-World Phenomenon: an Algorithmic Perspective, Proc. 32nd ACM Symposium on Theory of Computing (STOC), pp.163-170, (2000).