Add to ORKGWe present the design and evaluation of the query-routing protocol of the TerraDir distributed directory. TerraDir is a wide-area distributed directory designed for hierarchical namespaces, and provides a lookup service for mapping keys to objects. We introduce distributed lookup and caching algorithms that leverage the underlying data hierarchy. Our algorithms provide e#cient lookups while avoiding the load imbalances often associated with hierarchical systems. The TerraDir load balancing scheme also incorporates a node replication algorithm that provides configurable failure resilience with provably low overheads
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized...
We describe a load-balancing mechanism for assigning elements to servers in a distributed data struc...
none5In this paper we present the current achievement of our research activity in the WISDOM project...
The HD Tree is a novel data structure, which was recently proposed by Yunfeng Gu to support multi-di...
Next generation Digital Libraries (DLs) will offer an entire ensemble of systems and services design...
This paper presents a novel scalable end-to-end routing protocol (HDRA), which combines the characte...
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, het...
We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (...
We consider the problem of query optimization in distributed data stream systems where multiple cont...
In this paper, we discuss the relationship between mediator-based systems for service discovery in m...
Querying a PDMS means either flooding the network with messages to all peers or taking advantage of ...
We investigate query routing techniques in a clus-ter of databases for a query-dominant environment....
The peer-to-peer networking paradigm has emerged as an exciting and popular approach for interconnec...
Spatial databases are prominently used in Geographic Information System (GIS) applications. However,...
Query-load (forwarding and answering) balancing in structured overlays is one of the most critical a...
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized...
We describe a load-balancing mechanism for assigning elements to servers in a distributed data struc...
none5In this paper we present the current achievement of our research activity in the WISDOM project...
The HD Tree is a novel data structure, which was recently proposed by Yunfeng Gu to support multi-di...
Next generation Digital Libraries (DLs) will offer an entire ensemble of systems and services design...
This paper presents a novel scalable end-to-end routing protocol (HDRA), which combines the characte...
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, het...
We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (...
We consider the problem of query optimization in distributed data stream systems where multiple cont...
In this paper, we discuss the relationship between mediator-based systems for service discovery in m...
Querying a PDMS means either flooding the network with messages to all peers or taking advantage of ...
We investigate query routing techniques in a clus-ter of databases for a query-dominant environment....
The peer-to-peer networking paradigm has emerged as an exciting and popular approach for interconnec...
Spatial databases are prominently used in Geographic Information System (GIS) applications. However,...
Query-load (forwarding and answering) balancing in structured overlays is one of the most critical a...
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized...
We describe a load-balancing mechanism for assigning elements to servers in a distributed data struc...
none5In this paper we present the current achievement of our research activity in the WISDOM project...