Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over Peer-to-Peer networks. A major limitation of DHTs is that they only support exact-match queries. In order to offer range queries over a DHT it is necessary to build additional indexing structures. Prefix-based indexes, such as Prefix Hash Tree (PHT), are interesting approaches for building distributed indexes on top of DHTs. Nevertheless, the lookup operation of these indexes usually generates a high amount of unnecessary traffic overhead which degrades system performance by increasing response time. In this paper, we propose a novel distributed cache system called Tabu Prefix Table (TPT-C), aiming at improving the performance of the Pref...
Range query processing is an essential role inmany P2P applications including databaseindexing, dist...
In this paper we define a Distributed Arbitrary Segment Tree (DAST), a distributed tree-like structu...
The state-of-the-art techniques for processing multi-term queries in P2P environments are query floo...
Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications o...
International audienceDistributed Hash Tables (DHTs) provide the substrate to build large scale dist...
International audienceDistributed Hash Tables (DHTs) provide the substrate to build scalable and eff...
Distributed Hash Table [1] (DHT) is a method to store and lookup data across distributed nodes. It p...
Range query, which is defined as to find all the keys in a certain range over the underlying P2P net...
Abstract: "In recent years, Distributed Hash Tables (DHTs) have been proposed as a fundamental build...
Interest in distributed storage is fueled by demand for reliability and resilience combined with ubi...
This paper describes the design and implementation of DAST, a Distributed Arbitrary Segment Tree str...
Peer-to-peer (P2P) systems provide a robust, scalable and decentralized way to share and publish dat...
Abstract. Range queries, retrieving all keys within a given range, is an important add-on for Distri...
This paper defines and evaluates a hierarchical distributed data structure, distributed digest trie,...
Recent Peer-to-Peer (P2P) systems such as Tapestry, Chord or CAN act primarily as a Distributed Hash...
Range query processing is an essential role inmany P2P applications including databaseindexing, dist...
In this paper we define a Distributed Arbitrary Segment Tree (DAST), a distributed tree-like structu...
The state-of-the-art techniques for processing multi-term queries in P2P environments are query floo...
Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications o...
International audienceDistributed Hash Tables (DHTs) provide the substrate to build large scale dist...
International audienceDistributed Hash Tables (DHTs) provide the substrate to build scalable and eff...
Distributed Hash Table [1] (DHT) is a method to store and lookup data across distributed nodes. It p...
Range query, which is defined as to find all the keys in a certain range over the underlying P2P net...
Abstract: "In recent years, Distributed Hash Tables (DHTs) have been proposed as a fundamental build...
Interest in distributed storage is fueled by demand for reliability and resilience combined with ubi...
This paper describes the design and implementation of DAST, a Distributed Arbitrary Segment Tree str...
Peer-to-peer (P2P) systems provide a robust, scalable and decentralized way to share and publish dat...
Abstract. Range queries, retrieving all keys within a given range, is an important add-on for Distri...
This paper defines and evaluates a hierarchical distributed data structure, distributed digest trie,...
Recent Peer-to-Peer (P2P) systems such as Tapestry, Chord or CAN act primarily as a Distributed Hash...
Range query processing is an essential role inmany P2P applications including databaseindexing, dist...
In this paper we define a Distributed Arbitrary Segment Tree (DAST), a distributed tree-like structu...
The state-of-the-art techniques for processing multi-term queries in P2P environments are query floo...