The Complexity of Social Coordination
Summary: Extends entangled queries for data-driven coordination by dropping uniqueness, while keeping efficient evaluation for safe queries. If all users share the same attribute set, unsafe queries admit an efficient solution; experiments show feasibility across diverse coordination workloads. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Konstantinos Mamouras
- 2. Sigal Oren
- 3. Lior Seeman
- 4. Lucja Kot
- 5. Johannes Gehrke
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,129 | Scalable Social Coordination with Group Constraints using Enmeshed Queries | 2013 | CIDR | 4.8228141e-05 |
| 12,064 | Mobility and Social Networking: A Data Management Perspective | 2013 | VLDB | 4.1945683e-05 |
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 |
|---|---|---|---|---|
| 45 | Sagas | 1987 | SIGMOD | 0.00071800944 |
| 3,530 | Entangled Queries: Enabling Declarative Data-Driven Coordination | 2011 | SIGMOD | 7.0046072e-05 |
| 8,550 | Entangled Transactions | 2011 | VLDB | 4.4937074e-05 |
Previous
Page 1 / 1
Next