메뉴 건너뛰기




Volumn 3379 LNCS, Issue , 2005, Pages 138-151

Towards a common framework for peer-to-peer web retrieval

Author keywords

Distributed system; Information retrieval; Link analysis; Peer to peer computing; Search engine

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; SEARCH ENGINES;

EID: 36849076726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-31842-2_15     Document Type: Article
Times cited : (1)

References (45)
  • 1
    • 36849041982 scopus 로고    scopus 로고
    • Gnutella protocol development website, http://rfc-gnutella.sourceforge. net/, visited on 27th of Oct. 2004.
    • Gnutella protocol development website, http://rfc-gnutella.sourceforge. net/, visited on 27th of Oct. 2004.
  • 2
    • 36849078033 scopus 로고    scopus 로고
    • How big are the search engines? http://searchenginewatch.com/sereport/ article.php/2165301, visited on 26th of Oct. 2004.
    • How big are the search engines? http://searchenginewatch.com/sereport/ article.php/2165301, visited on 26th of Oct. 2004.
  • 3
    • 36849013430 scopus 로고    scopus 로고
    • How many pages estimated on the internet? http://www.webmasterworld.com/ forum10/5219-2-10.htm, visited on 26th of Oct. 2004.
    • How many pages estimated on the internet? http://www.webmasterworld.com/ forum10/5219-2-10.htm, visited on 26th of Oct. 2004.
  • 4
    • 36849055442 scopus 로고    scopus 로고
    • Kazaa. http://www.kazza.com/, visited on 27th of Oct. 2004.
    • Kazaa. http://www.kazza.com/, visited on 27th of Oct. 2004.
  • 5
    • 36849095457 scopus 로고    scopus 로고
    • How much information, 2000. http://www.sims.berkeley.edu/research/ projects/how-much-info/internet.html, visited on 26th of Oct. 2004.
    • How much information, 2000. http://www.sims.berkeley.edu/research/ projects/how-much-info/internet.html, visited on 26th of Oct. 2004.
  • 9
    • 27944498948 scopus 로고    scopus 로고
    • Self-similar layered hidden Markov models
    • Jafar Adibi and Wei-Min Shen. Self-similar layered hidden Markov models. Lecture Notes in Computer Science, 2168:1-15, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2168 , pp. 1-15
    • Adibi, J.1    Shen, W.2
  • 19
    • 4544292699 scopus 로고    scopus 로고
    • A keyword-set search system for peer-to-peer networks. Master's thesis, Department of Electrical Engineering and Computer Science
    • May
    • Omprakash D Gnawali. A keyword-set search system for peer-to-peer networks. Master's thesis, Department of Electrical Engineering and Computer Science, MIT, May 2002.
    • (2002) MIT
    • Gnawali, O.D.1
  • 20
    • 0004255482 scopus 로고    scopus 로고
    • Efficient computation of pageRank
    • Technical Report 1999-31, Stanford University, September
    • Taher Haveliwala. Efficient computation of pageRank. Technical Report 1999-31, Stanford University, September 1999.
    • (1999)
    • Haveliwala, T.1
  • 22
    • 17444363858 scopus 로고    scopus 로고
    • Adaptive methods for the computation of pagerank
    • Technical report
    • Sepandar Kamvar, Taher Haveliwala, and Gene Golub. Adaptive methods for the computation of pagerank. Technical report, 2003.
    • (2003)
    • Kamvar, S.1    Haveliwala, T.2    Golub, G.3
  • 23
    • 17444376867 scopus 로고    scopus 로고
    • Exploiting the block structure of the web for computing pagerank
    • Technical report, Stanford University, March 2003. Submitted on 4th of March
    • Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Exploiting the block structure of the web for computing pagerank. Technical report, Stanford University, March 2003. Submitted on 4th of March 2003.
    • (2003)
    • Kamvar, S.D.1    Haveliwala, T.H.2    Manning, C.D.3    Golub, G.H.4
  • 28
    • 0003780986 scopus 로고    scopus 로고
    • The pagerank citation ranking: Bringing order to the web
    • Technical report, Stanford University, January
    • Larry Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University, January 1998.
    • (1998)
    • Page, L.1    Brin, S.2    Motwani, R.3    Winograd, T.4
  • 29
    • 0842266368 scopus 로고    scopus 로고
    • A scalable content addressable network
    • Technical Report TR-00-010, Berkeley, CA
    • Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content addressable network. Technical Report TR-00-010, Berkeley, CA, 2000.
    • (2000)
    • Ratnasamy, S.1    Francis, P.2    Handley, M.3    Karp, R.4    Shenker, S.5
  • 39
    • 27944455566 scopus 로고    scopus 로고
    • Using a layered markov model for decentralized web ranking
    • Technical Report IC/2004/70, Swiss Federal Institute of Technology, Lausanne, Switzerland, Auguest
    • Jie Wu and Karl Aberer. Using a layered markov model for decentralized web ranking. Technical Report IC/2004/70, Swiss Federal Institute of Technology, Lausanne, Switzerland, Auguest 2004.
    • (2004)
    • Wu, J.1    Aberer, K.2
  • 41
    • 27944510107 scopus 로고    scopus 로고
    • Using siterank in p2p information retrieval
    • Technical Report IC/2004/31, Swiss Federal Institute of Technology, Lausanne, Switzerland, March
    • Jie Wu and Karl Aberer. Using siterank in p2p information retrieval. Technical Report IC/2004/31, Swiss Federal Institute of Technology, Lausanne, Switzerland, March 2004.
    • (2004)
    • Wu, J.1    Aberer, K.2
  • 42
    • 27944476032 scopus 로고    scopus 로고
    • Using a layered markov model for distributed web rank computation
    • Columbus, Ohio, U.S.A, June
    • Jie Wu and Karl Aberer. Using a layered markov model for distributed web rank computation. In Submitted to ICDCS 2005, Columbus, Ohio, U.S.A., June 2005.
    • (2005) Submitted to ICDCS 2005
    • Wu, J.1    Aberer, K.2
  • 45
    • 36849040965 scopus 로고    scopus 로고
    • B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.
    • B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.