Governing Decentralized Complex Queries Through a DAO

Zichichi, Mirko; Serena, Luca; Ferretti, Stefano; D’Angelo, Gabriele

doi:10.1145/3462203.3475910

Cited by 10 publications

(7 citation statements)

References 14 publications

(11 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The architecture is based on IOTA DLT to save the locations of possible road hazards and search for those locations using a hypercube-shaped DHT in which the ID of the transitions containing the information are stored. In [5], the focus is more on organizing a Decentralized Autonomous Organization for incentives users via a reward-based mechanism to keep alive their nodes, but with the same architecture as in the previously mentioned article using a DFS instead of a DLT to store the contents referenced by the CIDs saved in the DHT nodes. A similar approach to the topic addressed by this thesis can be found in [22].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Keyword-Based Multimedia Data Lookup in Decentralized Systems

Fazzini,

Zichichi,

Ferretti

et al. 2023

2023 International Conference on Information and Communication Technologies for Disaster Management (ICT-DM)

View full text Add to dashboard Cite

SommarioI sistemi decentralizzati hanno permesso agli utenti di condividere informazioni senza la presenza di un intermediario centralizzato che possiede la sovranità sui dati scambiati, rischi di sicurezza e la possibilità di colli di bottiglia. Tuttavia, sono rari i sistemi pratici per il recupero delle informazioni salvate su di essi che non includano una componente centralizzata. In questo lavoro di tesi viene presentato lo sviluppo di un'applicazione il cui scopo è quello di consentire agli utenti di caricare immagini in un'architettura totalmente decentralizzata, grazie ai Decentralized File Storage e alla successiva ricerca e recupero di tali oggetti attraverso una Distributed Hash Table (DHT) in cui sono memorizzati i necessari Content IDentifiers (CID).L'obiettivo principale è stato quello di trovare una migliore allocazione delle immagini all'interno del DHT attraverso l'uso dell'International Standard Content Code (ISCC), ovvero uno standard ISO che, attraverso funzioni hash contentdriven, locality-sensitive e similarity-preserving, assegna i CID IPFS delle immagini ai nodi del DHT in modo efficiente, per ridurre il pi ù possibile i salti tra i nodi e recuperare immagini coerenti con la query eseguita. Verranno, poi, analizzati i risultati ottenuti dall'allocazione dei CID delle immagini nei nodi mettendo a confronto ISCC e hash crittografico SHA-256, per verificare se ISCC rappresenti meglio la somiglianza tra le immagini allocando le immagini simili in nodi vicini tra loro.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In figure 3.1, taken from the article [5], it is possible to see the system architecture in which IPFS implements the DFS network as the first layer, where files are stored and shared between nodes, and the keyword associated to the files are the IDs of the DHT peers, in the second layer.…”

Section: Chaptermentioning

confidence: 99%

Keyword-Based Multimedia Data Lookup in Decentralized Systems

Fazzini,

Zichichi,

Ferretti

et al. 2023

2023 International Conference on Information and Communication Technologies for Disaster Management (ICT-DM)

View full text Add to dashboard Cite

show abstract

“…Despite the significant progress of decentralisation in recent years, one of the main challenges remains unsolved: realising decentralised search engines. Previous attempts to create decentralised search engines do not support both keyword and similarity search [14]- [18], do not provide result integrity [14]- [16], [18], are not completely decentralised [19], [20], are bound to a specific underlying technology [14]- [18], or require a global view of the network making them difficult to deploy in practice. We analyse existing search systems in Section VI-A.…”

Section: Introductionmentioning

confidence: 99%

Ditto: Towards Decentralised Similarity Search for Web3 Services

Keizer,

Ascigil,

Król

et al. 2023

2023 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)

View full text Add to dashboard Cite

The Web has become an integral part of life, and over the past decade, it has become increasingly centralised, leading to a number of challenges such as censorship and control, particularly in search engines. Recently, the paradigm of the decentralised Web (DWeb), or Web3, has emerged, which aims to provide decentralised alternatives to current systems with decentralised control, transparency, and openness.In this paper we introduce Ditto, a decentralised search mechanism for DWeb content, based on similarity search. Ditto uses locality sensitive hashing (LSH) to extract similarity signatures and records from content, which are stored on a decentralised index on top of a distributed hash table (DHT). Ditto uniquely supports numerous underlying content networks and types, and supports various use-cases, including keyword-search. Our evaluation shows that our system is feasible and that our search quality, delay, and overhead are comparable to those currently accepted by users of DWeb and search systems.

show abstract

“…Benefits often cited of DLTs, indeed, include the enabling of secure transactions between untrusted parties through consensus mechanisms, high availability, and the ability to automate and enforce processes through smart contracts [6]. Besides the financial use case, DLTs and DFS provide some properties such as data integrity, authenticity, confidentiality and auditability, which are used to An early version of this work appeared in [1]. This paper is an extensively revised and extended version where more than 50% is new material.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.…”

mentioning

confidence: 99%

“… An early version of this work appeared in [1]. This paper is an extensively revised and extended version where more than 50% is new material. …”

mentioning

confidence: 99%

Complex queries over decentralised systems for geodata retrieval

et al. 2022

Self Cite

View full text Add to dashboard Cite

Decentralised systems have been proved to be quite effective to allow for trusted and accountable data sharing, without the need to resort to a centralised party that collects all the information. While complete decentralisation provides important advantages in terms of data sovereignty, absence of bottlenecks and reliability, it also adds some issues concerned with efficient data lookup and the possibility to implement complex queries without reintroducing centralised components. In this paper, we describe a system that copes with these issues, thanks to a multi-layer lookup scheme based on Distributed Hash Tables that allows for multiple keyword-based searches. The service of peer nodes participating in this discovery service is controlled and rewarded for their contribution. Moreover, the governance of this process is completely automated through the use of smart contracts, thus building a Decentralised Autonomous Organization (DAO). Finally, we present a use case where road hazards are collected in order to test the goodness of our system for geodata retrieval. Then, we show results from a performance evaluation that confirm the viability of the proposal. | INTRODUCTIONThe digitalisation process, which has been ongoing over the last decades, has seen data management and data delivery become crucial issues. The transformation brought about by digital technologies has data at its core and it had a significant impact on economies and societies around the world. The ability to easily get hold of data has the potential to create several new services based on data and new markets where more and more users are consumers and providers at the same time. However, obtaining large amounts of data that is not from a dubious (or false) origin is often a challenge. In order to cope with the increasingly higher number of content that is demanded through the Web, multiple solutions for efficient use of the Internet have been designed. In particular, thanks to the decentralisation of content storage and delivery, it is possible to avoid the single point of failure, while reducing the workload at data centres and allowing a distribution of data that remains 'closer' to the original data producer. Decentralisation also fosters the creation of open systems, where participants can freely join the system and then contribute to its functioning.Recently, Distributed Ledger Technologies (DLTs) and a realm of decentralised systems, for example, Decentralised File Storages (DFS), have emerged as Peer-to-Peer (P2P) technologies capable of offering interesting features related to data validation and trustfulness [2,3]. DLTs have gained popularity with the advent of cryptocurrencies, which allow users to trade crypto-assets without any central entity being involved, ensuring transparency and data integrity. By creating a common, decentralised and trustless infrastructure, it will be possible for data consumers and providers to interact and collaborate in P2P interactions [4,5]. Benefits often cited of DLTs, indeed, include the enabling of ...

show abstract

Governing Decentralized Complex Queries Through a DAO

Cited by 10 publications

References 14 publications

Keyword-Based Multimedia Data Lookup in Decentralized Systems

Keyword-Based Multimedia Data Lookup in Decentralized Systems

Ditto: Towards Decentralised Similarity Search for Web3 Services

Complex queries over decentralised systems for geodata retrieval

Contact Info

Product

Resources

About