메뉴 건너뛰기




Volumn , Issue , 2006, Pages 702-708

Proof: A DHT-based peer-to-peer search engine

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; QUERY LANGUAGES; WEB SERVICES; WEBSITES;

EID: 42549093012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI.2006.137     Document Type: Conference Paper
Times cited : (20)

References (19)
  • 1
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 3
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual Web search engine
    • S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
    • (1998) Computer Networks and ISDN Systems , vol.30 , Issue.1-7 , pp. 107-117
    • Brin, S.1    Page, L.2
  • 8
    • 25844450270 scopus 로고    scopus 로고
    • Efficient and scalable query routing for unstructured peer-to-peer networks
    • March
    • A. Kumar, J. Xu, and E. Zegura. Efficient and scalable query routing for unstructured peer-to-peer networks. In INFOCOM 2005, pages 1162-1173, March 2005.
    • (2005) INFOCOM 2005 , pp. 1162-1173
    • Kumar, A.1    Xu, J.2    Zegura, E.3
  • 10
    • 42549107913 scopus 로고    scopus 로고
    • N. I. of Standards and Technology. Secure hash standard. FIPS 180-1 Standard in U.S. Department of Commerce/NIST, April 1995.
    • N. I. of Standards and Technology. Secure hash standard. FIPS 180-1 Standard in U.S. Department of Commerce/NIST, April 1995.
  • 15
    • 11444261982 scopus 로고    scopus 로고
    • pSearch: Information retrieval in structured overlays
    • October
    • C. Tang, Z. Xu, and M. Mahalingam. pSearch: Information retrieval in structured overlays. In ACM HotNets-I, October 2002.
    • (2002) ACM HotNets-I
    • Tang, C.1    Xu, Z.2    Mahalingam, M.3
  • 16
    • 0000681228 scopus 로고    scopus 로고
    • A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
    • San Francisco, CA, USA, Morgan Kaufmann Publishers Inc
    • R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases, pages 194-205, San Francisco, CA, USA, 1998. Morgan Kaufmann Publishers Inc.
    • (1998) VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases , pp. 194-205
    • Weber, R.1    Schek, H.-J.2    Blott, S.3
  • 19
    • 39049156961 scopus 로고    scopus 로고
    • Performance of full text search in structured and unstructured peer-to-peer systems
    • April
    • Y. Yang, R. Dunlap, M. Rexroad, and B. F. Cooper. Performance of full text search in structured and unstructured peer-to-peer systems. In INFOCOM 2006, April 2006.
    • (2006) INFOCOM 2006
    • Yang, Y.1    Dunlap, R.2    Rexroad, M.3    Cooper, B.F.4


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