Accepted author manuscript, 778 KB, PDF document
Available under license: CC BY: Creative Commons Attribution 4.0 International License
Final published version
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - Ditto
T2 - Towards Decentralised Similarity Search for Web3 Services
AU - Keizer, Navin
AU - Ascigil, Onur
AU - Król, Michał
AU - Pavlou, George
PY - 2023/9/6
Y1 - 2023/9/6
N2 - 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.
AB - 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.
KW - Decentralised Search Engine
KW - Decentralised Web
KW - Locality Sensitive Hashing
KW - Similarity Search
U2 - 10.1109/DAPPS57946.2023.00018
DO - 10.1109/DAPPS57946.2023.00018
M3 - Conference contribution/Paper
SN - 9798350335361
T3 - 2023 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)
SP - 66
EP - 75
BT - 2023 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)
PB - IEEE
ER -