Departmental Papers (CIS)

Date of this Version


Document Type

Conference Paper


Copyright 2009 IEEE. Reprinted from:
Mengmeng Liu; Taylor, N.E.; Wenchao Zhou; Ives, Z.G.; Boon Thau Loo, "Recursive Computation of Regions and Connectivity in Networks," Data Engineering, 2009. ICDE '09. IEEE 25th International Conference on , vol., no., pp.1108-1119, March 29 2009-April 2 2009 URL:

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to By choosing to view this document, you agree to all provisions of the copyright laws protecting it.


In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples include, sensor networks that execute queries about reachable nodes or contiguous regions, declarative networks that maintain information about shortest paths and reachable endpoints, and distributed and peer-to-peer stream systems that detect associations (e.g., transitive relationships) among data at the distributed sources. In each case, the fundamental operation is to maintain a view over dynamic network state. This view is typically distributed, recursive, and may contain aggregation, e.g., describing transitive connectivity, shortest paths, least costly paths, or region membership. Surprisingly, solutions to computing such views are often domain-specific, expensive, and incomplete. In this paper, we recast the problem as one of incremental recursive view maintenance in the presence of distributed streams of updates to tuples: new stream data becomes insert operations and tuple expirations become deletions. We develop a set of techniques that maintain compact information about tuple derivability or data provenance. We complement this with techniques to reduce communication: aggregate selections to prune irrelevant aggregation tuples, provenance-aware operators that can determine when tuples are no longer derivable and remove them from their state, and shipping operators that greatly reduce the tuple and provenance information being propagated while still maintaining correct answers. We validate our work in a distributed setting with sensor and network router queries, showing significant gains in communication overhead without sacrificing performance.


query processing, sensor fusion, data associations, data management, data provenance, declarative networks, distributed acquisition, distributed systems, incremental recursive view maintenance, network routing, peer-to-peer stream systems, recursive computation, sensor networks



Date Posted: 30 September 2009