ProFID: Practical frequent item set discovery in peer-to-peer networks

Lecture Notes in Electrical Engineering

Volumn 62 LNEE, Issue , 2010, Pages 199-202

  Çem, Emrah ^a   Özkasap, Öznur ^a  

^a KOÇ UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PROTOCOLS; EXTENSIVE SIMULATIONS; FREQUENT ITEMS; FREQUENT ITEMSETS; UNSTRUCTURED P2P NETWORK;

CONVERGENCE OF NUMERICAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION SCIENCE;

PEER TO PEER NETWORKS;

EID: 78651542098     PISSN: 18761100     EISSN: 18761119     Source Type: Book Series    
DOI: 10.1007/978-90-481-9794-1_40     Document Type: Conference Paper

References (8)

1. Li, M., Lee, W.C.: Identifying Frequent Items in P2P Systems. ICDCS. (2008) 36-44
2. Manjhi, A., Shkapenyuk, V., Dhamdhere, K., Olston, C.: Finding (Recently) Frequent Items in Distributed Data Streams. ICDE. (2005) 767-778 (Pubitemid 41731200)
3. Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-Based Aggregation in Large Dynamic Network. ACM Ttrans. Comput. Syst. 23 (2005) 219-252
4. Lahiri, B., Tirthapura, S.: Computing Frequent Elements Using Gossip. SIROCCO. (2008) 119-130
5. Kempe, D., Dobra, A., Johannes., G.: Gossip-Based Computation of Aggregate Information. FOCS. (2003) 482-491
6. Çem, E., Özkasap, Ö.: ProFID: Practical Frequent Item Set Discovery in Peer-to-Peer Networks. Technical Report, Koç University, March 2010.
7. The Peersim simulator. http://peersim.sf.net.
8. Özkasap, Ö., Çaglar, M., Yazici, E. S., Küçükçifçi, S.: An analytical framework for self-organizing peer-to-peer anti-entropy algorithms. Perform. Eval. 67 (2010) 141-159