Incremental web ranking on P2P networks
Web ranking is one of the most important components of web search services which becomes an important activity these days. In order to compute the web ranking, the web-link graph structure is to be processed to analyze the importance of the linkage. The time and space complexity for web ranking can...
Saved in:
Main Authors: | Sumalee Sangamuang, Juggapong Natwichai, Pruet Boonma |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=79957544660&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49886 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
A P2P-based incremental web ranking algorithm
by: Sumalee Sangamuang, et al.
Published: (2018) -
An algorithm for min-cut density-balanced partitioning in P2P web ranking
by: Sumalee Sangamuang, et al.
Published: (2018) -
Incremental web ranking on P2P networks
by: Sangamuang S., et al.
Published: (2014) -
IDBP: A distributed min-cut density-balanced algorithm for incremental web-pages ranking
by: Sumalee Sangamuang, et al.
Published: (2020) -
An algorithm for min-cut density-balanced partitioning in P2P web ranking
by: Sumalee Sangamuang, et al.
Published: (2018)