Communications of the ACM - Scratch Programming for All
On-the-fly progress detection in iterative stream queries
Proceedings of the VLDB Endowment
Efficient querying and maintenance of network provenance at internet-scale
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Towards a data-centric view of cloud security
CloudDB '10 Proceedings of the second international workshop on Cloud data management
Datalog and emerging applications: an interactive tutorial
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Maintaining distributed logic programs incrementally
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Declarative automated cloud resource orchestration
Proceedings of the 2nd ACM Symposium on Cloud Computing
Recent advances in declarative networking
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Maintaining distributed logic programs incrementally
Computer Languages, Systems and Structures
Cologne: a declarative distributed constraint optimization platform
Proceedings of the VLDB Endowment
Efficient optimization and processing for distributed monitoring and control applications
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
REX: recursive, delta-based data-centric computation
Proceedings of the VLDB Endowment
Declarative secure distributed information systems
Computer Languages, Systems and Structures
FSR: formal analysis and implementation toolkit for safe interdomain routing
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.