Peer-to-peer systems for prefix search

DOI10.1145/872035.872053zbMATH Open1321.68060OpenAlexW2141226832MaRDI QIDQ2943751FDOQ2943751

Christian Scheideler, Baruch Awerbuch

Publication date: 4 September 2015

Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/872035.872053

Recommendations

• scientific article; zbMATH DE number 1931792
• Survey of research towards robust peer-to-peer networks: search methods
• SFES: a scalable, fault-tolerant, efficient search scheme in a peer-to-peer network
• scientific article; zbMATH DE number 2001215
• scientific article; zbMATH DE number 1949666

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)

Cited In (7)

• Survey of research towards robust peer-to-peer networks: search methods
• On character-based index schemes for complex wildcard search in peer-to-peer networks
• Title not available (Why is that?)
• SFES: a scalable, fault-tolerant, efficient search scheme in a peer-to-peer network
• Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
• Simulation-based analysis and developments of peer to peer systems.
• SKIP ⁺

This page was built for publication: Peer-to-peer systems for prefix search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943751)