DBScholar

Back to papers

The Price of Validity in Dynamic Networks

Summary: Defines single-site validity as a correctness condition for best-effort aggregates in dynamic, self-administered networks. Proposes a class of algorithms that guarantee validity and shows, with real and synthetic experiments, the price of validity. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3607
Venue
SIGMOD
Year
2004
Pagerank
6.755994e-05
Overall Rank
4,332 | 70.28%
DOI
10.1145/1007568.1007627

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bawa_sigmod04,
        title = {{The Price of Validity in Dynamic Networks}},
        author = {Bawa, Mayank and Gionis, Aristides and Garcia-Molina, Hector and Motwani, Rajeev},
        series = {{SIGMOD} '04},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1007568.1007627},
        url = {https://dl.acm.org/doi/10.1145/1007568.1007627},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
9 Online Aggregation 1997 SIGMOD 0.00077458002
765 Query Processing for Sensor Networks 2003 CIDR 0.00014217472
3,059 Epidemic Algorithms in Replicated Databases (Extended Abstract) 1997 PODS 7.8063437e-05
3,397 Querying in highly mobile distributed environments 1992 VLDB 7.4470198e-05
Previous Page 1 / 1 Next

Semantically Similar Papers