Scalable, efficient range queries for grid information services

Andrzejak, Artur; Xu, Zhou

doi:10.1109/ptp.2002.1046310

Cited by 204 publications

(191 citation statements)

References 9 publications

Supporting

Mentioning

186

Contrasting

Unclassified

Order By: Relevance

“…Other protocols use locality preserving hash functions, like the Hilbert space-filling curve, to allow DHT to support range queries. For example, in (Andrzejak and Xu, 2002) the authors propose an extension of the Chord protocol to support range and multi-attribute queries, by using a uniform locality preserving hash function to map items in the Chord key space. in (Ganesan et al, 2004) two methods are proposed.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Peer-to-peer systems for discovering resources in a dynamic grid

2007

View full text Add to dashboard Cite

The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutions are extensions of P2P DHT-based networks. We believe that these systems are not flexible enough in case the indexed data are very dynamic, i.e., the values of the resource attributes change very frequently over time. This is a common case for some data managed by typical Grid systems, like CPU loads, queue occupation, etc. Moreover, since common requests for Grid resources may be expressed as multi-attribute range queries, we think that the DHTbased P2P solutions that have been proposed so far with the aim of supporting such type of queries can suffer from poor flexibility and efficiency.In this paper we thus present a couple of P2P systems. Both the systems are based on Routing Indexes, used to efficiently route queries and update messages in the presence of highly variable data. The first system needs the adoption of a tree-shaped overlay network. The second one, which is an evolution of the first, is based on a two-level hierarchical network topology, where tree topologies must only be maintained at the lower level of the hierarchy, i.e., within the various node groups making up the network. The main goal of the second organization is to achieve a simpler maintenance of the overall P2P graph topology, by preserving the good properties of the tree-shaped topology.We discuss the results of extensive simulation tests aimed at assessing the performance and scalability of the proposed approaches, by also studying how the network topologies affect the propagation of query and update messages.

show abstract

Section: Related Workmentioning

confidence: 99%

“…These systems only allow exact queries to be expressed, while one of the common way to retrieve data on Grids is through multi-attribute range queries. Some authors have thus proposed extensions to the cited algorithms in order to adapt these DHT systems to the Grid needs (Cai et al, 2003;Andrzejak and Xu, 2002;Bharambe et al, 2004).…”

Section: Introductionmentioning

confidence: 99%

Peer-to-peer systems for discovering resources in a dynamic grid

2007

View full text Add to dashboard Cite

show abstract

“…Several approaches, based on space filling curves, such as Squid [15] or [17] support multidimensional range queries. [1] maps one-dimensional data space to d-dimensional Cartesian space by using the inverse Hilbert mapping. Built on top of multiple DHTs, SWORD [11] is an information service aiming at discovering computing resources on the grid by answering multi-attribute range queries.…”

Section: Related Workmentioning

confidence: 99%

A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems

Caron

Desprez

Fourdrignier³

et al. 2006

High Performance Computing - HiPC 2006

View full text Add to dashboard Cite

Abstract. Facing the limits of traditional tools of resource management within computational grids (related to scale, dynamicity, etc. of the platforms newly considered), new approaches, based on peer-to-peer technologies are emerging. The resource discovery and in particular the service discovery is concerned by this evolution. Among the solutions, a promising one is the indexing of resources using trie structures and more particularly prefix trees. The major advantages of trie-structured approaches is the capability to support search queries on ranges of values with a latency growing logarithmically in the number of nodes in the trie. Those techniques are easy to extend to multicriteria searches. One drawback of using tries is its inherent poor robustness in a dynamic environment, where nodes join and leave the network, leading to the split of the tree into a forest, which results in the impossibility to route requests. Within most recent approaches, the fault-tolerance is a prevention mechanism, often replication-based. The replication can be costly in term of resources required. In this paper, we propose a faulttolerance protocol that reconnects subtrees a posteriori, after crashes, to have again a connected graph and then reorder the nodes to rebuild a consistent tree.

show abstract

“…For instance, a user may want to discover all the computational resources whose CPU utilisation is less than 50% (expressed as a range query), find out the total load of a subset of computational resources or query about the free storage space on a subset of storage resources (aggregation queries summing up the corresponding attribute over a group or resources). Structured P2P systems have been proposed as an efficient routing platform for the provision of grid information services [9,10]. This paper seeks to augment the expressiveness of the query language for structured P2P systems through provision of support for order-based queries (range queries and prefix queries) and aggregation queries, given their importance for many applications.…”

Section: Introductionmentioning

confidence: 99%

“…the extension of DHT capabilities to support order-based and aggregation queries. DHT-based solutions can be classified into those which modify the DHT [9,6,12,13] and those which leave it unchanged [14,15]. The former group adapts the DHT so that complex queries can be performed.…”

Section: Introductionmentioning

confidence: 99%