Complex queries in DHT-based peer-to-peer networks
From MaRDI portal
Recommendations
- Enabling dynamic querying over distributed hash tables
- Efficient semantic search on DHT overlays
- G-Grid: A class of scalable and self-organizing data structures for multi-dimensional querying and content routing in P2P networks
- Enhanced lookup queries for large-scale distributed data structures
- P2P data management
Cited in
(14)- Probabilistic quorums for dynamic systems
- A Computing Resource Discovery Mechanism over a P2P Tree Topology
- Enhanced lookup queries for large-scale distributed data structures
- Squid: enabling search in DHT-based systems
- P2P metadata search layers
- A potential approach of internet worm propagation based on P2P
- A potential approach of internet worm propagation based on P2P
- A potential approach of internet worm propagation based on P2P
- A potential approach of internet worm propagation based on P2P
- A potential approach of internet worm propagation based on P2P
- A potential approach of internet worm propagation based on P2P
- Enabling dynamic querying over distributed hash tables
- On character-based index schemes for complex wildcard search in peer-to-peer networks
- Ciss: an efficient object clustering framework for dht-based peer-to-peer applications
This page was built for publication: Complex queries in DHT-based peer-to-peer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709169)