Scalable, Near-Zero Loss Disaster Recovery for Distributed Data Stores
|
2020 |
Alquraan, Ahmed |
VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning
|
2020 |
Lu, Kejing |
Guided Exploration of User Groups
|
2020 |
Seleznova, Mariia |
Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks
|
2020 |
Bian, Song |
Anytime Stochastic Routing with Hybrid Learning
|
2020 |
Pedersen, Simon Aagaard |
Understanding the Effect of Data Center Resource Disaggregation on Production DBMSs
|
2020 |
Zhang, Qizhen |
Approximate Denial Constraints
|
2020 |
Livshits, Ester |
Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series
|
2020 |
Boniol, Paul |
Capturing Associations in Graphs
|
2020 |
Fan, Wenfei |
A workload-adaptive mechanism for linear queries under local differential privacy
|
2020 |
McKenna, Ryan |
Adopting Worst-Case Optimal Joins in Relational Database Systems
|
2020 |
Freitag, Michael |
Baran: Effective Error Correction via a Unified Context Representation and Transfer Learning
|
2020 |
Mahdavi, Mohammad |
Knowledge Translation
|
2020 |
Bashardoost, Bahar Ghadiri |
Mining Top-k Pairs of Correlated Subgraphs in a Large Network
|
2020 |
Prateek, Arneish |
IDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search
|
2020 |
Gong, Long |
FireLedger: A High Throughput Blockchain Consensus Protocol
|
2020 |
Buchnik, Yehonatan |
Dynamic Interleaving of Content and Structure for Robust Indexing of Semi-Structured Hierarchical Data
|
2020 |
Wellenzohn, Kevin |
ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs
|
2020 |
Agarwal, Shubhangi |
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs
|
2020 |
Sun, Bintao |
Sharing Opportunities for OLTP Workloads in Different Isolation Levels
|
2020 |
Rehrmann, Robin |