Database Paper Browser

Back to papers

Fast Manhattan Sketches in Data Streams

Summary: First 1-pass turnstile streaming algorithm for approximating l1 (Manhattan) distance with O*(ε^{-2}) space and O*(1) update time. Improves prior trade-offs (previously Ω(ε^{-3}) space or Ω(ε^{-2}) update) and is optimal up to polylog factors. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1511
Venue
PODS
Year
2010
Pagerank
6.9711051e-05
Overall Rank
3,557 | 75.28%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
398 Mergeable Summaries 2012 PODS 0.00024383201
10,620 Federated Data Distribution Shift Estimation 2025 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers