Home > Research > Publications & Outputs > Ditto

Electronic data

Links

Text available via DOI:

View graph of relations

Ditto: Towards Decentralised Similarity Search for Web3 Services

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date6/09/2023
Host publication2023 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)
PublisherIEEE
Pages66-75
Number of pages10
ISBN (electronic)9798350335354
ISBN (print)9798350335361
<mark>Original language</mark>English

Publication series

Name2023 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)
PublisherIEEE

Abstract

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.