DBScholar

Back to papers

Relational Transducers for Declarative Networking

Summary: Defines relational transducers as a model for eventually-consistent distributed querying and formalizes coordination-freeness. Shows coordination-free (and syntactic “oblivious”) transducers exactly characterize monotone queries, while non-coordination-free networks are strictly more expressive. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1557
Venue
PODS
Year
2011
Pagerank
0.0001020106
Overall Rank
1,623 | 88.87%
DOI
10.1145/1989284.1989321

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ameloot_pods11,
        address = {New York, NY, USA},
        series = {{PODS} '11},
        title = {{Relational Transducers for Declarative Networking}},
        url = {https://dl.acm.org/doi/10.1145/1989284.1989321},
        doi = {10.1145/1989284.1989321},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ameloot, Tom J. and Neven, Frank and Van den Bussche, Jan},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,159 Relational Transducers for Electronic Commerce 1998 PODS 0.00011898742
2,125 Verification of Communicating Data-Driven Web Services 2006 PODS 9.1334411e-05
3,331 Datalog Redux: Experience and Conjecture 2010 PODS 7.5135835e-05
Previous Page 1 / 1 Next

Semantically Similar Papers