Departmental Papers (CIS)

Date of this Version

June 2004

Document Type

Technical Report

Comments

University of California, Berkeley Department of Electrical Engineering and Computer Sciences Technical Report No. CSD-04-1332 Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. (Department of Electrical Engineering and Computer Sciences, University of California, Berkeley)

NOTE: At the time of publication, author Boon Thau Loo was affiliated with the University of California at Berkeley. Currently (March 2007), he is a faculty member in the Department of Computer and Information Science at the University of Pennsylvania.

Abstract

This paper describes a distributed infrastructure for querying network graphs with recursive queries. We argue that recursive queries have great practical value as a declarative interface to multi-hop networks. To query these networks in a distributed fashion, we describe the processing of recursive queries using PIER, a P2P relational query processor that utilizes distributed hash tables (DHTs). We focus on studying a set of commonly used recursive queries based on the transitive closure query. We demonstrate that different query processing techniques will lead to tradeoffs in latency, work sharing and communication overheads. Our experimental results also show that selecting the best execution strategy based on the query workload and graph topology can lead to significant reduction in communication overhead and latency.

Share

COinS
 

Date Posted: 08 March 2007