The use of decentralized systems has the potential to offer secure and efficient collaboration without intermediaries, and in the absence or fault of a central server. However, searching for content in a decentralized system is still an issue, especially when real-time information needs to be retrieved (e.g. emergency situations). We propose a keyword-based decentralized lookup scheme, based on the International Standard Content Code (ISCC), which enables the unique identification of digital content without the need for a centralized registry or authority. Our approach exploits a hypercube Distributed Hash Table (DHT) for storing and retrieving shared resources and compares different approaches to index contents within it. Results show that the use of ISCC, as the basis for creating identifiers, enables more efficient content placement and retrieval, which could pave the way for novel decentralized solutions that surmount the presence of centralized servers for content lookup.
Keyword-based multimedia data lookup in decentralized systems / Fazzini, E; Zichichi, M; Ferretti, S; D'Angelo, G. - ELETTRONICO. - (2023), pp. 161-166. (Intervento presentato al convegno 8th International Conference on Information and Communication Technologies for Disaster Management (ICT-DM) tenutosi a Cosenza (Italy) nel 13-15 September 2023) [10.1109/ICT-DM58371.2023.10286930].
Keyword-based multimedia data lookup in decentralized systems
Zichichi, M;Ferretti, S;D'Angelo, G
2023
Abstract
The use of decentralized systems has the potential to offer secure and efficient collaboration without intermediaries, and in the absence or fault of a central server. However, searching for content in a decentralized system is still an issue, especially when real-time information needs to be retrieved (e.g. emergency situations). We propose a keyword-based decentralized lookup scheme, based on the International Standard Content Code (ISCC), which enables the unique identification of digital content without the need for a centralized registry or authority. Our approach exploits a hypercube Distributed Hash Table (DHT) for storing and retrieving shared resources and compares different approaches to index contents within it. Results show that the use of ISCC, as the basis for creating identifiers, enables more efficient content placement and retrieval, which could pave the way for novel decentralized solutions that surmount the presence of centralized servers for content lookup.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.