Database Paper Browser

Back to papers

Scalable Social Coordination with Group Constraints using Enmeshed Queries

Summary: Enmeshed queries: continuous declarative intents to coordinate unknown users by specifying who/what/when plus group-composition constraints (e.g., group size), generalizing beyond entangled queries and pub-sub. Offline matching NP-hard; propose scalable heuristics that reach ~86% of optimal at ~40µs/query and scale to millions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
188
Venue
CIDR
Year
2013
Pagerank
4.8228141e-05
Overall Rank
7,129 | 50.41%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,531 Quantum Databases 2013 CIDR 5.0246096e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank Cited Paper Year Venue Pagerank
41 NiagaraCQ: A Scalable Continuous Query System for Internet Databases 2000 SIGMOD 0.00073964959
373 Continuous Queries over Append-Only Databases 1992 SIGMOD 0.00025341527
3,530 Entangled Queries: Enabling Declarative Data-Driven Coordination 2011 SIGMOD 7.0046072e-05
5,391 Scalable Ranked Publish/Subscribe 2008 VLDB 5.533552e-05
5,582 Efficiently Evaluating Complex Boolean Expressions 2010 SIGMOD 5.4241353e-05
7,170 Publish/Subscribe on the Web at Extreme Speed 2000 VLDB 4.8119372e-05
7,555 The Complexity of Social Coordination 2012 VLDB 4.7123501e-05
Previous Page 1 / 1 Next

Semantically Similar Papers