Clustering using Hypergraph for P2P Query Routing - Simulation and Evaluation

Anis Ismail, Mohammad Hajjar, Mohamed Quafafou, Nicolas Durand, Mazen El Sayed

Abstract

Peer-to-peer overlay networks offer a flexible architecture for decentralized data sharing. In P2P schema-based systems, each peer is a database management system in itself, ex-posing its own schema. In such a case, the main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. The usability of these systems depends on efficient and effective routing of content-based queries is an emerging problem in P2P networks. This work was attended to motivate the use of mining algorithms in the P2P context to improve the efficiency of such methods. Our proposed method combines clustering and hypergraphs. We use ECCLAT to build approximate clustering and discovering meaningful clusters with slight overlapping. We use the algorithm MTMINER to extract all minimal transversals of a hypergraph (clusters) for query routing. The set of clusters improves the robustness in queries routing mechanism and scalability in P2P Network. Our experimental results prove that our method generates impressive levels of performance and scalability with respect to important criteria such as response time, precision and recall.

References

  1. Aberer, K., 2001. P-grid: A self-organizing access structure for p2p information systems. In CoopIS, pages 179-194.
  2. Aberer, K., Cudre-Mauroux, P., Hauswirth, M. and Pelt, T. V., 2004. Gridvine: Building internet-scale semantic overlay networks. In International Semantic Web Conference, pages 107-121.
  3. Akbarinia, R. and Martins, V., Data management in the appa p2p system, 2006, In Int. Workshop on HighPerformance Data Management in Grid Environments (HPDGRID).
  4. Bhaduri, K., Wolf, Giannella, R. C. and Kargupta, H., 2008, Distributed Decision Tree Induction in Peer-toPeer Systems. In Statistical Analysis and Data Mining Journal, volume 1, pages 85-103.
  5. Castano, S. and Montanelli, S., 2005. Semantic selfformation of communities of peers. In Proceedings of the ESWC Workshop on Ontologies in Peer-to-Peer Communities, pages 137-151.
  6. Cohen, E., Fiat, A. and Kaplan, H., 2003. Associative search in peer to peer networks: Harnessing latent semantics.
  7. Crespo, A. and Garcia-Molina, H., Routing indices for peer-to-peer systems, 2002. Distributed Computing Systems, International Conference on, pages 0-23.
  8. Cuenca-Acuna, F. M., Peery, C., Martin, R. P. and Nguyen, T. D., 2003. Planetp: Using gossiping to build content addressable peer-to-peer information sharing communities. HPDC, 236-249.
  9. Datta, S., Giannella, C. and Kargupta, H., 2006. K-means clustering over a large, dynamic network. In J. Ghosh, D. Lambert, D. B. Skillicorn, and J. Srivastava, editors, SDM. SIAM.
  10. Durand, N. and Cremilleux, B., 2002. ECCLAT: a New Approach of Clusters Discovery in Categorical Data. In 22nd Int. Conf. on Knowledge Based Systems and Applied Artificial Intelligence (ES'02), pages 177-190, Cambridge, UK.
  11. Durand, N., Cremilleux, B. and Suzuki, E., 2006, Visualizing Transactional Data with Multiple Clusterings for Knowledge Discovery. In Proc. 16th Symposium on Methodologies for Intelligent Systems (ISMIS'06), pages 47-57,.
  12. Faye, D., Nachouki, G. and Valduriez, P., 2007. Semantic query routing in senpeer, a p2p data management system. In NBiS, pages 365-374,.
  13. Hebert, C., Bretto, A. and Cremilleux, B., 2007. A data mining formalization to improve hypergraph transversal computation. Fundamenta Informatica, IOS Press, 80(4), pages 415-433.
  14. Ismail, A., Quafafou, M., Durand, N., Nachouki, G., Hajjar, M., 2010. Queries Mining for Efficient Routing in P2P Communities, International Journal of Database Management Systems (IJDMS), vol. 2, No. 1, pages 9-28.
  15. Tong, X., Zhang, D. and Yang, Z., 2005. Efficient content location based on interest-cluster in peer-to-peer system. E-Business Engineering, IEEE International Conference on, pages 324-331.
  16. Ratnasamy, S., Francis, P., Handley, M., Karp, R. and Schenker, S., 2001, A scalable content-addressable network. In SIGCOMM 7801, volume 31, pages 161- 172.
Download


Paper Citation


in Harvard Style

Ismail A., Hajjar M., Quafafou M., Durand N. and El Sayed M. (2013). Clustering using Hypergraph for P2P Query Routing - Simulation and Evaluation . In Proceedings of the 15th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-8565-59-4, pages 247-254. DOI: 10.5220/0004452302470254


in Bibtex Style

@conference{iceis13,
author={Anis Ismail and Mohammad Hajjar and Mohamed Quafafou and Nicolas Durand and Mazen El Sayed},
title={Clustering using Hypergraph for P2P Query Routing - Simulation and Evaluation},
booktitle={Proceedings of the 15th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2013},
pages={247-254},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004452302470254},
isbn={978-989-8565-59-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 15th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - Clustering using Hypergraph for P2P Query Routing - Simulation and Evaluation
SN - 978-989-8565-59-4
AU - Ismail A.
AU - Hajjar M.
AU - Quafafou M.
AU - Durand N.
AU - El Sayed M.
PY - 2013
SP - 247
EP - 254
DO - 10.5220/0004452302470254