SIGMOD 2018 Accepted Papers

Taro L. Saito
Database Journal Club
15 min readApr 30, 2018

--

Here is the list of accepted papers for SIGMOD 2018. I’ve attached links to PDFs to some of the papers of my interest if they are already available on the web.

Research Papers

  • Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing
    Yang Zhou (Peking University); Tong Yang (Peking University); Jie Jiang (Peking University); Bin Cui (Peking University); Minlan Yu (Harvard University); Xiaoming Li (Peking University); Steve Uhlig (Queen Mary University of London)
  • FastQRE: Fast Query Reverse Engineering
    Dmitri V. Kalashnikov (AT&T Labs Research); Laks V.S. Lakshmanan (University of British Columbia); Divesh Srivastava (AT&T Labs Research)
  • Submodularity of Distributed Join Computation
    Rundong Li (Northeastern University); Mirek Riedewald (Northeastern University); Xinyan Deng (Northeastern University)
  • Fonduer: Knowledge Base Construction from Richly Formatted Data
    Sen Wu (Stanford University); Luke Hsiao (Stanford University); Xiao Cheng (Stanford University); Braden Hancock (Stanford University); Theodoros Rekatsinas (University of Wisconsin-Madison); Philip Levis (Stanford University); Christopher Ré (Stanford University)
  • Maverick: Discovering Exceptional Facts from Knowledge Graphs
    Gensheng Zhang (Google Inc.); Damian Jimenez (The University of Texas at Arlington); Chengkai Li (The University of Texas at Arlington)
  • Improving Join Reorderability with Compensation Operators
    TaiNing Wang (National University of Singapore); Chee-Yong Chan (National University of Singapore)
  • Subjective Knowledge Base Construction Powered By Crowdsourcing and Knowledge Base
    Hao Xin (HKUST); Rui Meng (BNU-HKBU United International College); Lei Chen (HKUST)
  • Adaptive Optimization of Very Large Join Queries
    Thomas Neumann (Technische Universität München); Bernhard Radke (Technische Universität München)
  • Pipelined Query Processing in Coprocessor Environments
    Henning Funke (TU Dortmund University); Sebastian Breß (DFKI GmbH); Stefan Noll (TU Dortmund University); Volker Markl (Technische Universität Berlin); Jens Teubner (TU Dortmund University)
  • Efficient Top-K Query Processing on Massively Parallel Hardware
    Anil Shanbhag (Massachusetts Institute of Technology ); Holger Pirk (Imperial College London); Samuel Madden (Massachusetts Institute of Technology )
  • Skyline Community Search in Multi-valued Networks
    Rong-Hua Li (Beijing Institute of Technology); Lu Qin (University of Technology); Fanghua Ye (Sun Yat-Sen University); Jeffrey Xu Yu (Chinese University of Hong Kong); Xiaokui Xiao (National University of Singapore); Nong Xiao (Sun Yat-Sen University); Zibin Zheng (Sun Yat-Sen University)
  • Persistent Bloom Filter: Membership Testing for the Entire History
    Yanqing Peng (University of Utah); Jinwei Guo (Each China Normal University); Feifei Li (University of Utah); Weining Qian (East China Normal University); Aoying Zhou (East China Normal University)
  • Efficient Selection of Geospatial Data on Maps for Interactive and Visualized Exploration
    Tao Guo (SCSE, Nanyang Technological University); Kaiyu Feng (SCSE, Nanyang Technological University); Gao Cong (SCSE, Nanyang Technological University); Zhifeng Bao (RMIT University)
  • Random Sampling over Joins Revisited
    Zhuoyue Zhao (University of Utah); Robert Christensen (University of Utah); Feifei Li (University of Utah); Xiao Hu (Hong Kong University of Science and Technology); Ke Yi (Hong Kong University of Science and Technology)
  • AHEAD: Adaptable Data Hardening for On-the-Fly Hardware Error Detection during Database Query Processing
    Till Kolditz (Technische Universität Dresden); DIrk Habich (Technische Universität Dresden); Wolfgang Lehner (Technische Universität Dresden); Matthias Werner (Technische Universität Dresden); Stefan T.J. de Bruijn (NubiloSoft)
  • When Query Authentication Meets Fine-Grained Access Control: A Zero-Knowledge Approach
    Cheng Xu (Hong Kong Baptist University); Jianliang Xu (Hong Kong Baptist University); Haibo Hu (Hong Kong Polytechnic University); Man Ho Au (Hong Kong Polytechnic University)
  • On the Calculation of Optimality Ranges for Relational Query Execution Plans
    Florian Wolf (TU Ilmenau); Norman May (SAP SE); Paul R. Willems (SAP SE); Kai-Uwe Sattler (TU Ilmenau)
  • DITA: Distributed In-Memory Trajectory Analytics
    Zeyuan Shang (Tsinghua University); Guoliang Li (Tsinghua University); Zhifeng Bao (RMIT University)
  • Matrix Profile X: VALMOD — Scalable Discovery of Variable-Length Motifs in Data Series
    Michele Linardi (University Paris Descartes); Yan Zhu (University of California Riverside); Themistoklis Palpanas (Paris Descartes University); Eamonn Keogh (University of California Riverside)
  • The Cascading Analysts Algorithm
    Matthias Ruhl (Accompani Inc.); Mukund Sundararajan (Google Research); Qiqi Yan (Google Research)
  • Navigating the Data Lake with Datamaran: Automatically Extracting Structure from Log Datasets
    Yihan Gao (University of Illinois at Urbana-Champaign); Silu Huang (University of Illinois at Urbana-Champaign); Aditya Parameswaran (University of Illinois at Urbana-Champaign)
  • AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics
    Jinglin Peng (Simon Fraser University); Dongxiang Zhang (National University of Defense Technology & Simon Fraser University); Jiannan Wang (Simon Fraser University); Jian Pei (JD.com & Simon Fraser University)
  • Overlap Set Similarity Joins with Theoretical Guarantees
    Dong Deng (Massachusetts Institute of Technology); Yufei Tao (Chinese University of Hong Kong); Guoliang Li (Tsinghua University)
  • Online Processing Algorithms for Influence Maximization
    Jing Tang (Nanyang Technological University); Xueyan Tang (Nanyang Technological University); Xiaokui Xiao (National University of Singapore); Junsong Yuan (State University of New York at Buffalo)
  • A General and Efficient Querying Method for Learning to Hash
    Jinfeng Li (The Chinese University of Hong Kong); Xiao Yan (The Chinese University of Hong Kong); Jian Zhang (The Chinese University of Hong Kong); An Xu (The Chinese University of Hong Kong); James Cheng (The Chinese University of Hong Kong); Jie Liu (The Chinese University of Hong Kong); Kelvin Kai Wing Ng (The Chinese University of Hong Kong); Ti-chung Cheng (The Chinese University of Hong Kong)
  • Accelerating Machine Learning Inference with Probabilistic Predicates
    Yao Lu (Microsoft & University of Washington); Aakanksha Chowdhery (Microsoft & Princeton University); Srikanth Kandula (Microsoft); Surajit Chaudhuri (Microsoft)
  • Reactors: A Case for Predictable, Virtualized Actor Database Systems
    Vivek Shah (University of Copenhagen); Marcos Antonio Vaz Salles (University of Copenhagen)
  • Catching Numeric Inconsistencies in Graphs
    Wenfei Fan (University of Edinburgh & Beihang University); Xueli Liu (Harbin Institue of Technology); Ping Lu (Beihang University); Chao Tian (University of Edinburgh & Beihang University)
  • Practical and Secure Substring Search
    Florian Hahn (SAP SE); Nicolas Loza (SAP SE); Florian Kerschbaum (University of Waterloo)
  • Robust Entity Resolution using Random Graphs
    Sainyam Galhotra (University of Massachusetts, Amherst); Donatella Firmani (Roma Tre University); Barna Saha (University of Massachusetts, Amherst); Divesh Srivastava (AT&T Labs — Research)
  • Adaptive Energy-Control for In-Memory Database Systems
    Thomas Kissinger (TU Dresden); Dirk Habich (TU Dresden); Wolfgang Lehner (TU Dresden)
  • Big Data Linkage for Product Specification Pages
    Disheng Qiu (Università Roma Tre); Luciano Barbosa (Universidade Federal de Pernambuco); Valter Crescenzi (Università Roma Tre); Paolo Merialdo (Università Roma Tre); Divesh Srivastava (AT&T Labs — Research)
  • Incremental View Maintenance with Triple Lock Factorization Benefits
    Milos Nikolic (University of Oxford); Dan Olteanu (University of Oxford)
  • Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation
    Daniel Ting (Tableau Software)
  • Meta-Dataflows: Efficient Exploratory Dataflow Jobs
    Raul Castro Fernandez (Massachusetts Institute of Technology ); William Culhane (Imperial College London); Pijika Watcharapichat (Imperial College London); Matthias Weidlich (Humboldt-Universität zu Berlin); Victoria Lopez Morales (Imperial College London); Peter Pietzuch (Imperial College London)
  • Lightweight Cardinality Estimation in LSM-based Systems
    Ildar Absalyamov (University of California, Riverside); Michael J. Carey (University of California, Irvine); Vassilis J. Tsotras (University of California, Riverside)
  • A Rating-Ranking Method for Crowdsourced Top-k Computation
    Kaiyu Li (Tsinghua University); Xiaohang Zhang (Tsinghua University); Guoliang Li (Tsinghua University)
  • RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning
    Hwanjun Song (Korea Advanced Institute of Science and Technology ); Jae-Gil Lee (Korea Advanced Institute of Science and Technology )
  • Synthesizing Type-Detection Logic for Rich Semantic Data Types using Open-source Code
    Cong Yan (University of Washington); Yeye He (Microsoft Research)
  • Auto-Detect: Data-Driven Error Detection in Tables
    Zhipeng Huang (University of Hong Kong); Yeye He (Microsoft Research)
  • Distributed Lock Management with RDMA: Decentralization without Starvation
    Dong Young Yoon (University of Michigan); Mosharaf Chowdhury (University of Michigan); Barzan Mozafari (University of Michigan)
  • Automatically Leveraging MapReduce Frameworks for Data-Intensive Applications
    Maaz Bin Safeer Ahmad (University of Washington); Alvin Cheung (Computer Science & Engineering)
  • DimBoost: Boosting Gradient Boosting Decision Tree to Higher Dimensions
    Jiawei Jiang (Peking University & Tencent Inc); Bin Cui (Peking University); Ce Zhang (ETH Zürich); Fangcheng Fu (Peking University)
  • How to Architect a Query Compiler, Revisited
    Ruby Y. Tahboub (Purdue University); Gregory M. Essertel (Purdue University); Tiark Rompf (Purdue University)
  • SketchML: Accelerating Distributed Machine Learning with Data Sketches
    Jiawei Jiang (Peking University & Tencent Inc. ); Fangcheng Fu (Peking University); Tong Yang (Peking University); Bin Cui (Peking University)
  • Building a Bw-Tree Takes More Than Just Buzz Words
    Ziqi Wang (Carnegie Mellon University); Andrew Pavlo (Carnegie Mellon University); Hyeontaek Lim (Carnegie Mellon University); Viktor Leis (Technische Universität München); Huanchen Zhang (Carnegie Mellon University); Michael Kaminsky (Intel Labs); Dave Andersen (Carnegie Mellon University)
  • HOT: A Height Optimized Trie Index for Main-Memory Database Systems
    Robert Binna (University of Innsbruck); Eva Zangerle (University of Innsbruck); Martin Pichl (University of Innsbruck); Günther Specht (University of Innsbruck); Viktor Leis (Technische Universität München)
  • Managing Non-Volatile Memory in Database Systems
    Alexander van Renen (Technische Universität München); Viktor Leis (Technische Universität München); Alfons Kemper (Technische Universität München); Thomas Neumann (Technische Universität München); Takushi Hashida (Fujitsu Laboratories); Kazuichi Oe (Fujitsu Laboratories); Yoshiyasu Doi (Fujitsu Laboratories); Lilian Harada (Fujitsu Laboratories); Mitsuru Sato (Fujitsu Laboratories)
  • FASTER: A Concurrent Key-Value Store with In-Place Updates
    Badrish Chandramouli (Microsoft Research); Guna Prasaad (University of Washington); Donald Kossmann (Microsoft Research); Justin Levandoski (Microsoft Research); James Hunter (Microsoft Research); Mike Barnett (Microsoft Research)
  • The Data Interaction Game
    Ben McCamish (Oregon State University); Vahid Ghadakchi (Oregon State University); Arash Termehchy (Oregon State University); Behrouz Touri (University of California San Diego); Liang Huang (Oregon State University)
  • A Comparative Study of Secondary Indexing Techniques in LSM-based NoSQL Databases
    Mohiuddin Abdul Qader (University of California Riverside); Shiwen Cheng (University of California Riverside); Vagelis Hristidis (University of California Riverside)
  • Workload-Aware CPU Performance Scaling for Transactional Database Systems
    Mustafa Korkmaz (University of Waterloo); Martin Karsten (University of Waterloo); Kenneth Salem (University of Waterloo); Semih Salihoglu (University of Waterloo)
  • BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks
    Yinglong Song (Nanyang Technological University & Fudan University); Huey Eng Chua (Nanyang Technological University); Sourav S. Bhowmick (Nanyang Technological University); Byron Choi (Hong Kong Baptist University); Shuigeng Zhou (Fudan University)
  • Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality
    Min Xie (Hong Kong University of Science and Technology); Raymond Chi-Wing Wong (Hong Kong University of Science and Technology); Jian Li (Tsinghua University); Cheng Long (Queen’s University Belfast); Ashwin Lall (Denison University)
  • Finding Seeds and Relevant Tags Jointly: For Targeted Influence Maximization in Social Networks
    Xiangyu Ke (Nanyang Technological University); Arijit Khan (Nanyang Technological University); Gao Cong (Nanyang Technological University)
  • Accelerating Analytical Processing in MVCC using Fine-Granular High-Frequency Virtual Snapshotting
    Ankur Sharma (Saarland University); Felix Martin Schuhknecht (Saarland University); Jens Dittrich (Saarland University)
  • VerdictDB: Universalizing Approximate Query Processing
    Yongjoo Park (University of Michigan); Barzan Mozafari (University of Michigan); Joseph Sorenson (University of Michigan); Junhao Wang (University of Michigan)
  • Marginal Release Under Local Differential Privacy
    Graham Cormode (University Of Warwick); Tejas Kulkarni (University Of Warwick); Divesh Srivastava (AT&T Labs-Research)
  • Fine-grained Concept Linking using Neural Networks in Healthcare
    Jian Dai (National University of Singapore); Meihui Zhang (Beijing Institute of Technology); Gang Chen (Zhejiang University); Ju Fan (Renmin University of China); Kee Yuan Ngiam (National University Health System); Beng Chin Ooi (National University of Singapore)
  • Query-based Workload Forecasting for Self-Driving Database Management Systems
    Lin Ma (Carnegie Mellon University); Dana Van Aken (Carnegie Mellon University); Ahmed Hefny (Carnegie Mellon University); Gustavo Mezerhane (Carnegie Mellon University); Andrew Pavlo (Carnegie Mellon University); Geoffrey J. Gordon (Carnegie Mellon University)
  • The Case for Learned Index Structures
    Tim Kraska (Massachusetts Institute of Technology ); Alex Beutel (Google, Inc. ); Ed H. Chi (Google, Inc. ); Jeffrey Dean (Google, Inc. ); Neoklis Polyzotis (Google, Inc. )
  • Data Citation: Giving Credit Where Credit is Due
    Yinjun Wu (University of Pennsylvania); Abdussalam Alawini (University of Pennsylvania); Susan B. Davidson (University of Pennsylvania); Gianmaria Silvello (University of Padua)
  • An End-to-End Economic Method for Elastic Database Fragmentation, Replication, and Provisioning
    Ryan Marcus (Brandeis University); Olga Papaemmanouil (Brandeis University); Sofiya Semenova (Brandeis University); Solomon Garber (Brandeis University)
  • Column Sketches: A Scan Accelerator for Rapid and Robust Predicate Evaluation
    Brian Hentschel (Harvard University); Michael S. Kester (Harvard University); Stratos Idreos (Harvard University)
  • Top-k Sorting Under Partial Order Information
    Eyal Dushkin (Tel Aviv University); Tova Milo (Tel Aviv University)
  • The Data Calculator: Data Structure Design and Cost Synthesis from First Principles and Learned Cost Models
    Stratos Idreos (Harvard University); Kostas Zoumpatianos (Harvard University); Brian Hentschel (Harvard University); Michael S. Kester (Harvard University); Demi Guo (Harvard University)
  • Carousel: Low-Latency Transaction Processing for Globally-Distributed Data
    Xinan Yan (University of Waterloo); Linguan Yang (University of Waterloo); Hongbo Zhang (University of Waterloo); Xiayue Charles Lin (University of Waterloo); Bernard Wong (University of Waterloo); Kenneth Salem (University of Waterloo); Tim Brecht (University of Waterloo)
  • When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks
    Dian Ouyang (University of Technology Sydney); Lu Qin (University of Technology Sydney); Lijun Chang (University of Sydney); Xuemin Lin (University of New South Wales); Ying Zhang (University of Technology Sydney); Qing Zhu (Renmin University of China)
  • Bias in OLAP Queries: Detection, Explanation, and Removal
    Babak Salimi (University of Washington ); Johannes Gehrke (Microsoft ); Dan Suciu (University of Washington )
  • TurboGraph++: A Scalable and Fast Graph Analytics System
    Seongyun Ko (POSTECH); Wook-Shin Han (POSTECH)
  • Discovering Graph Functional Dependencies
    Wenfei Fan (University of Edinburgh & Beihang University); Chunming Hu (Beihang University); Xueli Liu (Harbin Institute of Technology); Ping Lu (Beihang University)
  • TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data
    Kyoungmin Kim (Pohang University of Science and Technology (POSTECH)); In Seo (Pohang University of Science and Technology (POSTECH)); Wook-Shin Han (Pohang University of Science and Technology (POSTECH)); Jeong-Hoon Lee (Pohang University of Science and Technology (POSTECH)); Sungpack Hong (Oracle Labs); Hassan Chafi (Oracle Labs); Hyungyu Shin (Pohang University of Science and Technology (POSTECH)); Geonhwa Jeong (Pohang University of Science and Technology (POSTECH))
  • Adaptive Asynchronous Parallelization of Graph Algorithms
    Wenfei Fan (University of Edinburgh & Beihang University); Ping Lu (Beihang University); Xiaojian Luo (7 Bridges Ltd.); Jingbo Xu (Beihang University & 7 Bridges Ltd.); Qiang Yin (Beihang University); Wenyuan Yu (Beihang University & 7 Bridges Ltd.); Ruiqi Xu (University of Edinburgh)
  • Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks
    Sibo Wang (University of Queensland); Yufei Tao (Chinese University of Hong Kong)
  • TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs
    Zhewei Wei (Renmin University of China); Xiaodong He (Renmin University of China); Xiaokui Xiao (National University of Singapore); Sibo Wang (University of Queensland); Shuo Shang (King Abdullah University of Science and Technology); Ji-Rong Wen (Renmin University of China)
  • Ektelo: A Framework for Defining Differentially-Private Computations
    Dan Zhang (University of Massachusetts Amherst); Ryan McKenna (University of Massachusetts Amherst); Ios Kotsogiannis (Duke University); Michael Hay (Colgate University); Ashwin Machanavajjhala (Duke University); Gerome Miklau (University of Massachusetts Amherst)
  • Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space
    Junhao Gan (University of Queensland); Yufei Tao (Chinese University of Hong Kong)
  • A Query Engine for Probabilistic Preferences
    Uzi Cohen (Technionn); Batya Kenig (Technion); Haoyue Ping (Drexel University ); Benny Kimelfeld (Technion); Julia Stoyanovich (Drexel University)
  • Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions
    Shuo Han (Peking University); Lei Zou (Peking University); Jeffrey Xu Yu (The Chinese University of Hong Kong)
  • Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search
    Yiqiu Wang (Rice University); Anshumali Shrivastava (Rice University); Jonathan Wang (Rice University); Junghee Ryu (Rice University)
  • Deep Learning for Entity Matching: A Design Space Exploration
    Sidharth Mudgal (University of Wisconsin-Madison); Han Li (University of Wisconsin-Madison); Theodoros Rekatsinas (University of Wisconsin-Madison); AnHai Doan (University of Wisconsin-Madison); Youngchoon Park (Johnson Controls); Ganesh Krishnan (@WalmartLabs); Rohit Deep (@WalmartLabs); Esteban Arcaute (Facebook); Vijay Raghavendra (@WalmartLabs)
  • Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging
    Niv Dayan (Harvard); Stratos Idreos (Harvard)
  • DPaxos: Managing Data Closer to Users for Low-Latency and Mobile Applications
    Faisal Nawab (University of California, Santa Cruz); Divyakant Agrawal (University of California, Santa Barbara); Amr El Abbadi (University of California, Santa Barbara)
  • Dynamic Pricing in Spatial Crowdsourcing: A Matching-Based Approach
    Yongxin Tong (Beihang University); Libin Wang (Beihang University); Zimu Zhou (ETH Zurich); Lei Chen (The Hong Kong University of Science and Technology); Bowen Du (Beihang University); Jieping Ye (Didi Chuxing Inc.)
  • Sketching Linear Classifiers over Data Streams
    Kai Sheng Tai (Stanford University); Vatsal Sharan (Stanford University); Peter Bailis (Stanford University); Gregory Valiant (Stanford University)
  • SuRF: Practical Range Query Filtering with Fast Succinct Tries
    Huanchen Zhang (Carnegie Mellon University); Hyeontaek Lim (Carnegie Mellon University); Viktor Leis (Technische Universität München); David G. Andersen (Carnegie Mellon University); Michael Kaminsky (Intel Labs); Kimberly Keeton (Hewlett Packard Labs); Andrew Pavlo (Carnegie Mellon University)
  • RushMon: Real-time Isolation Anomalies Monitoring
    Zechao Shang (The University of Chicago); Jeffrey Xu Yu (The Chinese University of Hong Kong); Aaron J. Elmore (The University of Chicago)
  • PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development
    Jia Zou (Rice University); R. Matthew Barnett (Rice University); Tania Lorido-Botran (Rice University); Shangyu Luo (Rice University); Carlos Monroy (Rice University); Sourav Sikdar (Rice University); Kia Teymourian (Rice University); Binhang Yuan (Rice University); Chris Jermaine (Rice University)
  • MISTIQUE: A System to Store and Query Model Intermediates for Model Diagnosis
    Manasi Vartak (Massachusetts Institute of Technology); Joana M. F. da Trindade (Massachusetts Institute of Technology); Samuel Madden (Massachusetts Institute of Technology); Matei Zaharia (Stanford University)
  • ZigZag: Supporting Similarity Queries on Vector Space Models
    Wenhai Li (Wuhan University); Lingfeng Deng (Wuhan University); Yang Li (Wuhan University); Chen Li (UC Irvine)

Industrial Papers

  • Amazon Aurora: On Avoiding Distributed Consensus for I/Os, Commits, and Membership Changes
    Alexandre Verbitski (Amazon Web Services); Anurag Gupta (Amazon Web Services); Debanjan Saha (Amazon Web Services); James Corey (Amazon Web Services); Kamal Gupta (Amazon Web Services); Murali Brahmadesam (Amazon Web Services); Raman Mittal (Amazon Web Services); Sailesh Krishnamurthy (Amazon Web Services); Sandor Maurice (Amazon Web Services); Tengiz Kharatishvilli (Amazon Web Services); Xiaofeng Bao (Amazon Web Services)
  • Eon Mode: Bringing the Vertica Columnar Database to the Cloud
    Ben Vandiver (Vertica); Shreya Prasad (Vertica); Pratibha Rana (Vertica); Eden Zik (Vertica); Amin Saeidi (Vertica); Pratyush Parimal (Vertica); Styliani Pantela (Vertica); Jaimin Dave (Vertica)
  • P-Store: An Elastic Database System with Predictive Provisioning
    Rebecca Taft (Massachusetts Institute of Technology ); Nosayba El-Sayed (Qatar Computing Research Institute — HBKU); Marco Serafini (Qatar Computing Research Institute — HBKU); Yu Lu (University of Illinois Urbana-Champaign); Ashraf Aboulnaga (Qatar Computing Research Institute — HBKU); Michael Stonebraker (Massachusetts Institute of Technology ); Ricardo Mayerhofer (B2W Digital); Francisco Andrade (B2W Digital)
  • Survivability of Cloud Databases — Factors and Prediction
    Jose Picado (Oregon State University); Willis Lang (Microsoft Gray Systems Lab); Edward C. Thayer (Microsoft)
  • Rapid Adoption of Cloud Data Warehouse Technology Using Datometry Hyper-Q
    Lyublena Antova (Datometry); Derrick Bryant (Datometry); Tuan Cao (Datometry); Michael Duller (Datometry); Mohamed A. Soliman (Datometry); Florian M. Waas (Datometry)
  • A Graph Database for a Virtualized Network Infrastructure
    Pramod Jamkhedkar (AT&T Labs — Research); Theodore Johnson (AT&T Labs — Research); Yaron Kanza (AT&T Labs — Research); Aman Shaikh (AT&T Labs — Research); N. K. Shankaranarayanan (AT&T Labs — Research); Vladislav Shkapenyuk (AT&T Labs — Research)
  • G-CORE: A Core for Future Graph Query Languages
    Renzo Angles (Universidad de Talca); Marcelo Arenas (Pontificia Universidad Catolica de Chile); Pablo Barcelo (Universidad de Chile); Peter Boncz (CWI, Amsterdam); George Fletcher (Technische Universiteit Eindhoven); Claudio Gutierrez (Universidad de Chile); Tobias Lindaaker (Neo4j); Marcus Paradies (DLR); Stefan Plantikow (Neo4j); Juan Sequeda (Capsenta); Oskar van Rest (Oracle); Hannes Voigt (Technische Universitat Dresden)
  • RAPID: In-Memory Analytical Query Processing Engine with Extreme Performance per Watt
    Cagri Balkesen (Oracle Labs); Nitin Kunal (Oracle Labs); Georgios Giannikis (Oracle Labs); Pit Fender (Oracle Labs); Seema Sundara (Oracle Labs); Felix Schmidt (Oracle Labs); Jarod Wen (Oracle Labs); Sandeep Agrawal (Oracle Labs); Arun Raghavan (Oracle Labs); Venkatanathan Varadarajan (Oracle Labs); Anand Viswanathan (Oracle Labs); Balakrishnan Chandrasekaran (Oracle Labs); Sam Idicula (Oracle Labs); Nipun Agarwal (Oracle Labs); Eric Sedlar (Oracle Labs)
  • Computation Reuse in Analytics Job Service at Microsoft
    Alekh Jindal (Microsoft); Shi Qiao (Microsoft); Hiren Patel (Microsoft); Zhicheng Yin (Microsoft); Jieming Di (Microsoft); Malay Bag (Microsoft); Marc Friedman (Microsoft); Yifung Lin (Microsoft); Konstantinos Karanasos (Microsoft); Sriram Rao (Microsoft)
  • Cypher: An Evolving Query Language for Property Graphs
    Nadime Francis (Université Paris-Est); Alastair Green (Neo4j); Paolo Guagliardo (University of Edinburgh); Leonid Libkin (University of Edinburgh); Tobias Lindaaker (Neo4j); Victor Marsault (University of Edinburgh); Stefan Plantikow (Neo4j); Mats Rydberg (Neo4j); Petra Selmer (Neo4j); Andrés Taylor (Neo4j)
  • BIPie: Fast Selection and Aggregation on Encoded Data using Operator Specialization
    Michal Nowakiewicz (MemSQL); Eric Boutin (MemSQL); Eric Hanson (MemSQL); Robert Walzer (MemSQL); Akash Katipally (MemSQL)
  • TcpRT: Instrument and Diagnostic Analysis System for Service Quality of Cloud Databases at Massive Scale in Real-time
    Wei Cao (Alibaba Group); Yusong Gao (Alibaba Group); Bingchen Lin (Alibaba Group); Xiaojie Feng (Alibaba Group); Yu Xie (Alibaba Group); Xiao Lou (Alibaba Group); Peng Wang (Alibaba Group)
  • Columnstore and B+ tree — Are Hybrid Physical Designs Important?
    Adam Dziedzic (University of Chicago); Jingjing Wang (University of Washington); Sudipto Das (Microsoft Research); Bolin Ding (Microsoft Research); Vivek R. Narasayya (Microsoft Research); Manoj Syamala (Microsoft Research)
  • Pinot: Realtime OLAP for 530 Million Users
    Jean-François Im (Linkedin Corp.); Kishore Gopalakrishna (Linkedin Corp.); Subbu Subramaniam (Linkedin Corp.); Mayank Shrivastava (Linkedin Corp.); Adwait Tumbde (Linkedin Corp.); Xiaotian Jiang (Linkedin Corp.); Jennifer Dai (Linkedin Corp.); Seunghyun Lee (Linkedin Corp.); Neha Pawar (Linkedin Corp.); Jialiang Li (Linkedin Corp.); Ravi Aringunram (Linkedin Corp.)
  • Apache Calcite: A Foundational Framework for Optimized Query Processing Over Heterogeneous Data Sources
    Edmon Begoli (Oak Ridge National Laboratory (ORNL)); Jesús Camacho-Rodríguez (Hortonworks Inc.); Julian Hyde (Hortonworks Inc.); Michael J. Mior (University of Waterloo); Daniel Lemire (University of Quebec (TELUQ))
  • Robust, Scalable, Real-Time Event Time Series Aggregation at Twitter
    Peilin Yang (Twitter Inc.); Srikanth Thiagarajan (Twitter Inc.); Jimmy Lin (University of Waterloo)
  • Structured Streaming: A Declarative API for Real-Time Applications in Apache Spark
    Michael Armbrust (Databricks Inc.); Tathagata Das (Databricks Inc.); Joseph Torres (Databricks Inc.); Burak Yavuz (Databricks Inc.); Shixiong Zhu (Databricks Inc.); Reynold Xin (Databricks Inc.); Ali Ghodsi (Databricks Inc. ); Ion Stoica (Databricks Inc. ); Matei Zaharia (Databricks & Stanford); Mashaal Musleh (University of Minnesota); Mohamed F. Mokbel (Qatar Computing Research Institute, HBKU)

--

--

Taro L. Saito
Database Journal Club

Ph.D., researcher and software engineer, pursuing database technologies for everyone http://xerial.org/leo