| A Survey of Spatial Crowdsourcing |
6 |
| Optimal Bloom Filters and Adaptive Merging for LSM-Trees |
4 |
| Dependencies for Graphs |
3 |
| Building Efficient Query Engines in a High-Level Language |
3 |
| Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries |
2 |
| Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection |
2 |
| Practical Private Range Search in Depth |
2 |
| Output-Optimal Massively Parallel Algorithms for Similarity Joins |
2 |
| Parallelizing Sequential Graph Computations |
1 |
| Verification of Hierarchical Artifact Systems |
1 |
| From a Comprehensive Experimental Survey to a Cost-based Selection Strategy for Lightweight Integer Compression Algorithms |
1 |
| K-Regret Queries Using Multiplicative Utility Functions |
1 |
| Wander Join and XDB: Online Aggregation via Random Walks |
1 |
| TriAL: A Navigational Algebra for RDF Triplestores |
1 |
| On the Expressive Power of Query Languages for Matrices |
1 |
| Dynamic Complexity under Definable Changes |
1 |
| Distributed Joins and Data Placement for Minimal Network Traffic |
1 |
| Expressive Languages for Querying the Semantic Web |
0 |
| Design and Evaluation of an RDMA-aware Data Shuffling Operator for Parallel Database Systems |
0 |
| Dichotomies for Evaluating Simple Regular Path Queries |
0 |
| General Temporally Biased Sampling Schemes for Online Model Management |
0 |
| ChronicleDB: A High-Performance Event Store |
0 |
| Bounded Query Rewriting Using Views |
0 |
| Estimating the Impact of Unknown Unknowns on Aggregate Query Results |
0 |
| A Relational Framework for Classifier Engineering |
0 |
| Historic Moments Discovery in Sequence Data |
0 |
| Representations and Optimizations for Embedded Parallel Dataflow Languages |
0 |
| Scalable Analytics on Fast Data |
0 |
| Lightweight Monitoring of Distributed Streams |
0 |
| Answering FO plus MOD Queries under Updates on Bounded Degree Databases |
0 |
| Learning From Query-Answers: A Scalable Approach to Belief Updating and Parameter Learning |
0 |
| MacroBase: Prioritizing Attention in Fast Data |
0 |
| Inferring Insertion Times and Optimizing Error Penalties in Time-decaying Bloom Filters |
0 |
| A Unified Framework for Frequent Sequence Mining with Subsequence Constraints |
0 |
| Interactive Mapping Specification with Exemplar Tuples |
0 |
