26:03
Martin Grohe, RWTH Aachen: First-Order Query Evaluation with Cardinality Conditions
57:10
Tutorial: Privacy at Scale: Local Differential Privacy in Practice, Part 2
35:22
Tutorial: Privacy at Scale: Local Differential Privacy in Practice, Part 2
22:37
Ruby Tahboub, Purdue University, How to Architect a Query Compiler
20:56
Muhiuddin Abdul Qader, UC Riverside, A Comparative Study of Secondary Indexing Techniques
21:08
Niv Dayan, Harvard University, Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value
01:19:12
Pedro Domingos, University of Washington, Machine Learning for Data Management
01:28:08
Tutorial: Privacy at Scale: Local Differential Privacy in Practice
25:37
Antoine Amarilli, Telecom ParisTech, When Can We Answer Queries Using Result-Bounded Data
23:08
Andreas Pieris, University of Edinburgh, Containment for Rule-Based Ontology-Mediated Queries
26:09
Miguel Romero, Oxford University, The Tractability Frontier of Well-designed SPARQL Queries
28:43
Shaleen Deep, University of Wisconsin, Compressed Representations of Conjunctive Query Results
16:08
Robert Binna, University of Innsbruck, HOT: A Height Optimized Trie Index for Main-Memory DBMS
21:01
Stratos Idreos, Harvard University, The Data Calculator: Data Structure Design and Cost Synthesis
21:55
Tim Kraska, MIT, The Case for Learned Index Structures
19:49
Ziqi Wang, Carnegie-Mellon University, Building a Bw-Tree Takes More Than Just Buzz Words
27:06
Cristian Riveros, Catholic Univ. Chile, Constant Delay Algorithms for Regular Document Scanners
26:13
Yufei Tao, Chinese University of Hong Kong, Entity Matching with Active Monotone Classification
25:43
Samuel McCauley, BARC and IT University of Copenhagen, Set Similarity Search for Skewed Data
22:24
Abhinandan Nath, Duke University, Subtrajectory Clustering: Models and Algorithms
24:40
Martin AuMuler, BARC & IT University of Copenhagen, Distance-Sensitive Hashing
21:35
Alin Deutsch, UC San Diego, The Chase Revisited
44:21
Phokion Kolaitis, UC Santa Cruz, Reflections on Schema Mappings, Data Exchange, and Metadata
34:06
Hung Ngo, LogicBox, Worst-case Optimal Join Algorithms: Techniques, Results and Open Problems
24:59
Pierre Bourhis, CNRS, Explanations and Transparency in Collaborative Workflows
25:24
Qin Zhang, Indiana University, Distributed Statistical Estimation of Matrix Products
23:50
Amir Jafari, Sharif Univ. of Tech, Improvements on the k-Center Problem for Uncertain Data
24:01
Jinya Lin, Univ. of Hong Kong, Optimal Differentially Private Algorithms for k-Means Clustering
20:01
Ankur Sharma, Saarland Univ., Accelerating Analytical Processing in MVCC using Fine-Grained
20:50
Badrich Chandramouli, Microsoft Research, FASTER: A Concurrent Key-Value Store with In-Place Updates
22:44
Ester Livshits, Technion, Computing Optimal Repairs for Functional Dependencies
25:54
Jef Wijsen, Universite de Mons, Consistent Query Answering for Primary Keys and Conjunctive Queries
23:29
Leonid Libkin, Univ. of Edinburgh, Certain Answers Meet Zero-One Laws
20:03
Linguan Yang, Univ. of Waterloo, Carousel: Low-latency Transaction Processing
09:52
Mustafa Korkmaz, Univ. of Waterloo, Workload-aware CPU Performance Scaling for Transactional
21:01
Vivek Shah, Univ of Copenhagen, Reactors: A Case for Predictable, Virtualized Actor Database Systems
27:39
Chengkai Li, UTA, Maverick: Discovering Exceptional Facts from Knowledge Graphs
07:42
Hao Xin, HKUST, Subjective Knowledge Base Construction Powered by Crowdsourcing and Knowledge Base
01:37:23
Tutorial: Algorithmic Aspects of Parallel Query Processing
08:31
Jiawei Jiang, Peking Univ., DimBoost: Boosting Gradient Boosting Decision Tree to Higher Dimensions
20:51
Junhao Gan, Univ. of Queensland, Fast Euclidean OPTICS with Bounded Precision in Low Dimensional
21:04
Ben McCamish, Oregon State University, The Data Interaction Game
17:57
Dmitri Kalashnikov, AT&T Labs Research, FastQRE: Fast Query Reverse Engineering
19:51
Huanch Zhang, CMU, SuRF: Practical Range Query Filtering with Fast Succinct Tries
11:14
Milos Nikolic, University of Oxford, Incremental View Maintenance with Triple Lock Factorization
21:26
Brian Hentschel, Harvard Univ., Column Sketches: A Scan Accelerator for Rapid and Robust Predicate
11:41
Eyal Dushkin, Tel Aviv University, Top-k Sorting Under Partial Order Information
17:33
IIdar Absalyamov, UC Riverside, Lightweight Cardinality Estimation in LSM-based Systems
10:03
Kaiyu Li, Tsinghua University, A Rating-Ranking Method for Crowdsourced Top-k Computation
21:56
Sourav Bhowmick, NTU, BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries
08:22
Xiaokui Xiao, NUS, Online Processing Algorithms for Influence Maximization
20:43
Xie Min, HKUST, Efficient k-Regret Query Algorithm with Restriction-free Bound
08:21
Chen Li, UC Irvine, ZigZag: Supporting Similarity Queries on Vector Space Models
12:50
Guoliang Li, Tsinghua University, Overlap Set Similarity with Theoretical Guarantees
14:46
Jiecao Chen, Indiana University, Distinct Sampling on Streaming Data with Near-Duplicates
24:35
Kun Qian, IBM, Active Learning of GAV Schema Mappings
24:06
Maximilian Schleich, University of Oxford, In-Database Learning with Sparse Tensors
10:49
Dran Ouyang, UTS, Skyline Community Search in Multi-Valued Networks
23:54
Choo Tian, Beihang University, Catching Numeric Inconsistencies in Graphs
16:32
Erdem Sariyuce, University of Buffalo, Fast Hierarchy Construction for Dense Subgraphs
X
About
Tags