Intelligent query processing in P2P networks: semantic issues and routing algorithms

AL Nicolini1, CM Lorenzetti1, AG Maguitman1 and CI Chesñevar1

  1. Institute for Computer Science and Engineering (ICIC), Universidad Nacional del Sur - CONICET
    Bahı́a Blanca, Argentina
    {aln, cml, agm, cic}@cs.uns.edu.ar

Abstract

P2P networks have become a commonly used way of disseminating content on the Internet. In this context, constructing efficient and distributed P2P routing algorithms for complex environments that include a huge number of distributed nodes with different computing and network capabilities is a major challenge. In the last years, query routing algorithms have evolved by taking into account different features (provenance, nodes’ history, topic similarity, etc.). Such features are usually stored in auxiliary data structures (tables, matrices, etc.), which provide an extra knowledge engineering layer on top of the network, resulting in an added semantic value for specifying algorithms for efficient query routing. This article examines the main existing algorithms for query routing in unstructured P2P networks in which semantic aspects play a major role. A general comparative analysis is included, associated with a taxonomy of P2P networks based on their degree of decentralization and the different approaches adopted to exploit the available semantic aspects.

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS180411002N

Publication information

Volume 16, Issue 2 (June 2019)
Year of Publication: 2019
ISSN: 1820-0214 (Print) 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

DownloadAvailable in PDF
Portable Document Format

How to cite

Nicolini, A., Lorenzetti, C., Maguitman, A., Chesñevar, C.: Intelligent query processing in P2P networks: semantic issues and routing algorithms. Computer Science and Information Systems, Vol. 16, No. 2, 409-442. (2019), https://doi.org/10.2298/CSIS180411002N