22:24Abhinandan Nath, Duke University, Subtrajectory Clustering: Models and Algorithms
Advanced
A 22-minute video from Sigmod 2018: “Abhinandan Nath, Duke University, Subtrajectory Clustering: Models and Algorithms”.
Sigmod 2018
310 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
22:24
21:35Alin Deutsch, UC San Diego, The Chase Revisited
Advanced
A 22-minute video from Sigmod 2018: “Alin Deutsch, UC San Diego, The Chase Revisited”.
23:50Amir Jafari, Sharif Univ. of Tech, Improvements on the k-Center Problem for Uncertain Data
Advanced
A 24-minute video from Sigmod 2018: “Amir Jafari, Sharif Univ. of Tech, Improvements on the k-Center Problem for Uncertain Data”.
23:08Andreas Pieris, University of Edinburgh, Containment for Rule-Based Ontology-Mediated Queries
Advanced
A 23-minute video from Sigmod 2018: “Andreas Pieris, University of Edinburgh, Containment for Rule-Based Ontology-Mediated Queries”.
20:01Ankur Sharma, Saarland Univ., Accelerating Analytical Processing in MVCC using Fine-Grained
Advanced
A 20-minute video from Sigmod 2018: “Ankur Sharma, Saarland Univ., Accelerating Analytical Processing in MVCC using Fine-Grained”.
25:37Antoine Amarilli, Telecom ParisTech, When Can We Answer Queries Using Result-Bounded Data
Advanced
A 26-minute video from Sigmod 2018: “Antoine Amarilli, Telecom ParisTech, When Can We Answer Queries Using Result-Bounded Data”.
20:50Badrich Chandramouli, Microsoft Research, FASTER: A Concurrent Key-Value Store with In-Place Updates
Advanced
A 21-minute video from Sigmod 2018: “Badrich Chandramouli, Microsoft Research, FASTER: A Concurrent Key-Value Store with In-Place Updates”.
21:04Ben McCamish, Oregon State University, The Data Interaction Game
Advanced
A 21-minute video from Sigmod 2018: “Ben McCamish, Oregon State University, The Data Interaction Game”.
21:26Brian Hentschel, Harvard Univ., Column Sketches: A Scan Accelerator for Rapid and Robust Predicate
Advanced
A 21-minute video from Sigmod 2018: “Brian Hentschel, Harvard Univ., Column Sketches: A Scan Accelerator for Rapid and Robust Predicate”.
8:21Chen Li, UC Irvine, ZigZag: Supporting Similarity Queries on Vector Space Models
Advanced
A 8-minute video from Sigmod 2018: “Chen Li, UC Irvine, ZigZag: Supporting Similarity Queries on Vector Space Models”.
27:39Chengkai Li, UTA, Maverick: Discovering Exceptional Facts from Knowledge Graphs
Advanced
A 28-minute video from Sigmod 2018: “Chengkai Li, UTA, Maverick: Discovering Exceptional Facts from Knowledge Graphs”.
23:54Choo Tian, Beihang University, Catching Numeric Inconsistencies in Graphs
Advanced
A 24-minute video from Sigmod 2018: “Choo Tian, Beihang University, Catching Numeric Inconsistencies in Graphs”.
27:06Cristian Riveros, Catholic Univ. Chile, Constant Delay Algorithms for Regular Document Scanners
Advanced
A 27-minute video from Sigmod 2018: “Cristian Riveros, Catholic Univ. Chile, Constant Delay Algorithms for Regular Document Scanners”.
17:57Dmitri Kalashnikov, AT&T Labs Research, FastQRE: Fast Query Reverse Engineering
Advanced
A 18-minute video from Sigmod 2018: “Dmitri Kalashnikov, AT&T Labs Research, FastQRE: Fast Query Reverse Engineering”.
10:49Dran Ouyang, UTS, Skyline Community Search in Multi-Valued Networks
Advanced
A 11-minute video from Sigmod 2018: “Dran Ouyang, UTS, Skyline Community Search in Multi-Valued Networks”.
16:32Erdem Sariyuce, University of Buffalo, Fast Hierarchy Construction for Dense Subgraphs
Advanced
A 17-minute video from Sigmod 2018: “Erdem Sariyuce, University of Buffalo, Fast Hierarchy Construction for Dense Subgraphs”.
22:44Ester Livshits, Technion, Computing Optimal Repairs for Functional Dependencies
Advanced
A 23-minute video from Sigmod 2018: “Ester Livshits, Technion, Computing Optimal Repairs for Functional Dependencies”.
11:41Eyal Dushkin, Tel Aviv University, Top-k Sorting Under Partial Order Information
Advanced
A 12-minute video from Sigmod 2018: “Eyal Dushkin, Tel Aviv University, Top-k Sorting Under Partial Order Information”.
12:50Guoliang Li, Tsinghua University, Overlap Set Similarity with Theoretical Guarantees
Advanced
A 13-minute video from Sigmod 2018: “Guoliang Li, Tsinghua University, Overlap Set Similarity with Theoretical Guarantees”.
7:42Hao Xin, HKUST, Subjective Knowledge Base Construction Powered by Crowdsourcing and Knowledge Base
Advanced
A 8-minute video from Sigmod 2018: “Hao Xin, HKUST, Subjective Knowledge Base Construction Powered by Crowdsourcing and Knowledge Base”.
19:51Huanch Zhang, CMU, SuRF: Practical Range Query Filtering with Fast Succinct Tries
Advanced
A 20-minute video from Sigmod 2018: “Huanch Zhang, CMU, SuRF: Practical Range Query Filtering with Fast Succinct Tries”.
34:06Hung Ngo, LogicBox, Worst-case Optimal Join Algorithms: Techniques, Results and Open Problems
Advanced
A 34-minute video from Sigmod 2018: “Hung Ngo, LogicBox, Worst-case Optimal Join Algorithms: Techniques, Results and Open Problems”.
17:33IIdar Absalyamov, UC Riverside, Lightweight Cardinality Estimation in LSM-based Systems
Advanced
A 18-minute video from Sigmod 2018: “IIdar Absalyamov, UC Riverside, Lightweight Cardinality Estimation in LSM-based Systems”.
25:54Jef Wijsen, Universite de Mons, Consistent Query Answering for Primary Keys and Conjunctive Queries
Advanced
A 26-minute video from Sigmod 2018: “Jef Wijsen, Universite de Mons, Consistent Query Answering for Primary Keys and Conjunctive Queries”.
8:31Jiawei Jiang, Peking Univ., DimBoost: Boosting Gradient Boosting Decision Tree to Higher Dimensions
Advanced
A 9-minute video from Sigmod 2018: “Jiawei Jiang, Peking Univ., DimBoost: Boosting Gradient Boosting Decision Tree to Higher Dimensions”.
14:46Jiecao Chen, Indiana University, Distinct Sampling on Streaming Data with Near-Duplicates
Advanced
A 15-minute video from Sigmod 2018: “Jiecao Chen, Indiana University, Distinct Sampling on Streaming Data with Near-Duplicates”.
24:01Jinya Lin, Univ. of Hong Kong, Optimal Differentially Private Algorithms for k-Means Clustering
Advanced
A 24-minute video from Sigmod 2018: “Jinya Lin, Univ. of Hong Kong, Optimal Differentially Private Algorithms for k-Means Clustering”.
20:51Junhao Gan, Univ. of Queensland, Fast Euclidean OPTICS with Bounded Precision in Low Dimensional
Advanced
A 21-minute video from Sigmod 2018: “Junhao Gan, Univ. of Queensland, Fast Euclidean OPTICS with Bounded Precision in Low Dimensional”.
10:03Kaiyu Li, Tsinghua University, A Rating-Ranking Method for Crowdsourced Top-k Computation
Advanced
A 10-minute video from Sigmod 2018: “Kaiyu Li, Tsinghua University, A Rating-Ranking Method for Crowdsourced Top-k Computation”.
24:35Kun Qian, IBM, Active Learning of GAV Schema Mappings
Advanced
A 25-minute video from Sigmod 2018: “Kun Qian, IBM, Active Learning of GAV Schema Mappings”.
23:29Leonid Libkin, Univ. of Edinburgh, Certain Answers Meet Zero-One Laws
Advanced
A 23-minute video from Sigmod 2018: “Leonid Libkin, Univ. of Edinburgh, Certain Answers Meet Zero-One Laws”.
20:03Linguan Yang, Univ. of Waterloo, Carousel: Low-latency Transaction Processing
Advanced
A 20-minute video from Sigmod 2018: “Linguan Yang, Univ. of Waterloo, Carousel: Low-latency Transaction Processing”.
24:40Martin AuMuler, BARC & IT University of Copenhagen, Distance-Sensitive Hashing
Advanced
A 25-minute video from Sigmod 2018: “Martin AuMuler, BARC & IT University of Copenhagen, Distance-Sensitive Hashing”.
26:03Martin Grohe, RWTH Aachen: First-Order Query Evaluation with Cardinality Conditions
Advanced
A 26-minute video from Sigmod 2018: “Martin Grohe, RWTH Aachen: First-Order Query Evaluation with Cardinality Conditions”.
24:06Maximilian Schleich, University of Oxford, In-Database Learning with Sparse Tensors
Advanced
A 24-minute video from Sigmod 2018: “Maximilian Schleich, University of Oxford, In-Database Learning with Sparse Tensors”.
26:09Miguel Romero, Oxford University, The Tractability Frontier of Well-designed SPARQL Queries
Advanced
A 26-minute video from Sigmod 2018: “Miguel Romero, Oxford University, The Tractability Frontier of Well-designed SPARQL Queries”.