메뉴 건너뛰기




Volumn 24, Issue 4, 2012, Pages 692-706

Optimizing bloom filter settings in peer-to-peer multikeyword searching

Author keywords

Bloom filter; DHT; multikeyword search; P2P

Indexed keywords

BLOOM FILTERS; DHT; FALSE POSITIVE RATES; INVERTED LIST; MATHEMATICAL PROOF; MULTIKEYWORD SEARCH; OPTIMAL SETTING; P2P; PEER TO PEER; QUERY LOGS; STATISTICAL INFORMATION; TEST COLLECTION;

EID: 84862804197     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2011.14     Document Type: Article
Times cited : (20)

References (33)
  • 4
    • 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," Comm. ACM, vol. 13, no. 7, pp. 422-426, 1971.
    • (1971) Comm. ACM , vol.13 , Issue.7 , pp. 422-426
    • B.H. Bloom1
  • 6
    • 33845351881 scopus 로고    scopus 로고
    • Efficient query evaluation on large textual collections in a peer-to-peer environment
    • J. Zhang and T. Suel, "Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment," Proc. IEEE Int'l Conf. Peer-to-Peer Computing (P2P), 2005.
    • (2005) Proc. IEEE Int'l Conf. Peer-to-Peer Computing (P2P)
    • Zhang, J.1    Suel, T.2
  • 10
    • 3142728016 scopus 로고    scopus 로고
    • Efficient semantic-based content search in p2p network
    • July
    • H.T. Shen, Y.F. Shu, and B. Yu, "Efficient Semantic-Based Content Search in P2P Network," IEEE Trans. Knowledge and Data Eng., vol. 16, no. 7, pp. 813-826, July 2004.
    • (2004) IEEE Trans. Knowledge and Data Eng. , vol.16 , Issue.7 , pp. 813-826
    • H.T. Shen1    Y.F. Shu2    Yu, B.3
  • 11
    • 0041472305 scopus 로고    scopus 로고
    • Efficient content location using interest-based locality in peer-to-peer systems
    • K. Sripanidkulchai, B. Maggs, and H. Zhang, "Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems," Proc. IEEE INFOCOM, 2003.
    • (2003) Proc. IEEE INFOCOM
    • Sripanidkulchai, K.1    Maggs, B.2    Zhang, H.3
  • 16
    • 8844253324 scopus 로고    scopus 로고
    • Understanding inverse document frequency: On theoretical arguments for IDF
    • DOI 10.1108/00220410410560582
    • S. Robertson, "Understanding Inverse Document Frequency: On Theoretical Arguments for Idf," J. Documentation, vol. 60, pp. 503-520, 2004. (Pubitemid 39538229)
    • (2004) Journal of Documentation , vol.60 , Issue.5 , pp. 503-520
    • Robertson, S.1
  • 23
    • 70450232823 scopus 로고    scopus 로고
    • Network applications of bloom filters: A survey
    • A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Math., vol. 1, no. 4, pp. 484-509, 2005.
    • (2005) Internet Math. , vol.1 , Issue.4 , pp. 484-509
    • Broder, A.1    Mitzenmacher, M.2
  • 26
    • 0020828424 scopus 로고
    • Probabilistic counting algorithms for data base applications
    • P. Flajolet and G.N. Martin, "Probabilistic Counting Algorithms for Data Base Applications," J. Computer and System Sciences, vol. 31, pp. 182-209, 1985.
    • (1985) J. Computer and System Sciences , vol.31 , pp. 182-209
    • Flajolet, P.1    Martin, G.N.2
  • 28
    • 84862818360 scopus 로고    scopus 로고
    • Limewire
    • Limewire, http://www.limewire.com, 2010.
    • (2010)
  • 30
    • 84862785663 scopus 로고    scopus 로고
    • Brite
    • Brite, http://www.cs.bu.edu/brite/, 2010.
    • (2010)
  • 32
    • 36949017938 scopus 로고    scopus 로고
    • Can internet video-on-demand be profitable?
    • C. Huang, J. Li, and W. Ross, "Can Internet Video-on-Demand Be Profitable?," Proc. ACM SIGCOMM, 2007.
    • (2007) Proc. ACM SIGCOMM
    • Huang, C.1    Li, J.2    Ross, W.3


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