The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Declarative networking: language, execution and optimization
Abstract
The networking and distributed systems communities have recently explored a variety of new network architectures, both for application-level overlay networks, and as prototypes for a next-generation Internet architecture. In this context, we have investigated declarative networking: the use of a distributed recursive query engine as a powerful vehicle for accelerating innovation in network architectures [23, 24, 33]. Declarative networking represents a significant new application area for database research on recursive query processing. In this paper, we address fundamental database issues in this domain. First, we motivate and formally define the Network Datalog (NDlog) language for declarative network specifications. Second, we introduce and prove correct relaxed versions of the traditional semi-naïve query evaluation technique, to overcome fundamental problems of the traditional technique in an asynchronous distributed setting. Third, we consider the dynamics of network state, and formalize the iheventual consistencyl. of our programs even when bursts of updates can arrive in the midst of query execution. Fourth, we present a number of query optimization opportunities that arise in the declarative networking context, including applications of traditional techniques as well as new optimizations. Last, we present evaluation results of the above ideas implemented in our P2 declarative networking system, running on 100 machines over the Emulab network testbed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Self-citationDynamic Source Routing in Ad Hoc Wireless Networks
Johnson, D. B., & Maltz, D. A. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_5 · Cited by 8,518
Computer Networks: A Systems Approach
Peterson, L., & Davie, B. S. (1996) · Cited by 954
Overcoming the Internet impasse through virtualization
Anderson, T., Peterson, L., Shenker, S., & Turner, J. (2005) · Computer · doi:10.1109/mc.2005.136 · Cited by 922
A new routing protocol for the reconfigurable wireless networks
Haas, Z. J. (2002) · IEEE International Conference on Universal Personal Communications (ICUPC) · doi:10.1109/icupc.1997.627227 · Cited by 695
Maintaining views incrementally
Gupta, A., Mumick, I. S., & Subrahmanian, V. S. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170066 · Cited by 654
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
Whaley, J., & Lam, M. S. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996859 · Cited by 582
Encapsulation of parallelism in the Volcano query processing system
Graefe, G. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98720 · Cited by 340
Stonebraker, M. R. (1988) · Cited by 309
Implementing declarative overlays
Loo, B. T., Condie, T., Hellerstein, J. M., Maniatis, P., Roscoe, T., & Stoica, I. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095818 · Cited by 292
Self-citation
Cited by
Naiad: a timely dataflow system
Murray, D. G., McSherry, F., Isaacs, R., Isard, M., Barham, P., & Abadi, M. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522738 · Cited by 656
Towards Enabling Trusted Artificial Intelligence via Blockchain
Sarpatwar, K., Vaculin, R., Min, H., Su, G., Heath, T., Ganapavarapu, G., & Dillenberger, D. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17277-0_8 · Cited by 50
Integrating verification and repair into the control plane
Gember-Jacobson, A., Raiciu, C., & Vanbever, L. (2017) · Proceedings of the 16th ACM Workshop on Hot Topics in Networks · doi:10.1145/3152434.3152439 · Cited by 7
Metadata
- Authors
- Loo, B. T., Condie, T., Garofalakis, M., Gay, D. E., Hellerstein, J. M., Maniatis, P., Ramakrishnan, R., Roscoe, T., & Stoica, I.
- Venue
- Proceedings of the 2006 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2006-06-27
- Pages
- 97-108
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2136575791
- Cited by
- 268
- References
- 18
- FWCI
- 14.92
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Declarative networking: language, execution and optimization. https://app.cochat.ai/papers/10.1145/1142473.1142485
- The paper
- Loo, B. T., Condie, T., Garofalakis, M., Gay, D. E., Hellerstein, J. M., Maniatis, P., Ramakrishnan, R., Roscoe, T., & Stoica, I. (2006). Declarative networking: language, execution and optimization. Proceedings of the 2006 ACM SIGMOD international conference on Management of data. https://doi.org/10.1145/1142473.1142485
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.