440 citations · 1.9k across the 40 of their papers we have counts for
Showing 2013 · cs.DBShow all
2 papers · 2 filters
cs.DB2013
Learning and Verifying Quantified Boolean Queries by Example
Azza Abouzied, Dana Angluin, Christos Papadimitriou +2
To help a user specify and verify quantified queries --- a class of database queries known to be very challenging for all but the most expert users --- one can question the user on…
cs.DB2013★ 10 cited
Highly Available Transactions: Virtues and Limitations (Extended Version)
Peter Bailis, Aaron Davidson, Alan Fekete +3
To minimize network latency and remain online during server failures and network partitions, many modern distributed data storage systems eschew transactional functionality, which…