When Data Management Systems Meet Approximate Hardware: Challenges and Opportunities
Summary: Proposes ApproxiDB, a DBMS co-design for hybrid approximate/precise hardware. Enables AQP without synopses or sampling, while developing hybrid execution to speed precise queries; surveys hardware/co-design challenges and sketches a research agenda. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Bingsheng He
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,832 | A Study of Sorting Algorithms on Approximate Memory | 2016 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 211 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00033981214 |
| 449 | Approximate Query Processing: Taming the TeraBytes! A Tutorial | 2001 | VLDB | 0.00022846068 |
| 563 | Tree Indexing on Solid State Drives | 2010 | VLDB | 0.00020031827 |
| 757 | Database Architecture Evolution: Mammals Flourished long before Dinosaurs became Extinct | 2009 | VLDB | 0.00017078358 |
| 2,451 | Write-limited sorts and joins for persistent memory | 2014 | VLDB | 8.7856313e-05 |
Previous
Page 1 / 1
Next