Proceedings
SIGMOD 2016 papers can be accessed here.
Conference Program: SIGMOD Sessions
This page describes the complete SIGMOD Conference program.
- Keynote Talk
- Research Sessions
- Demos
- Posters
- Tutorials
- Award Talks
- Careers in Industry Panel
- Business Meeting
The SIGMOD 2016 program is also available at http://confer.csail.mit.edu/sigmod2016/schedule. Confer is a conference program management tool with a crowd-sourcing component that automatically groups papers into sessions to maximize the number of papers each attendee likes that he or she will get to see.
SIGMOD Keynote
Building Machine Learning Systems that Understand
Tuesday 8:30-10:00
Location: Grand Ballroom
Jeff Dean
RESEARCH SESSIONS
Session 1: Scalable Analytics and Machine Learning
Tuesday 10:30-12:15
Bayview
Session Chair: Sihem Amer-Yahia (CNRS/LIG)
- Learning Linear Regression Models over Factorized Joins
Dan Olteanu; Maximilian Schleich; Radu Ciucanu - To Join or Not to Join? Thinking Twice about Joins before Feature Selection
Arun Kumar; Jeffrey Naughton; Jignesh Patel; Xiaojin Zhu - Real-time Video Recommendation Exploration
Yanxiang Huang; Bin Cui; Jie Jiang; Kunqiang Hong; Wenyu Zhang; Yiran Xie - Towards Globally Optimal Crowdsourcing Quality Management: The Uniform Worker Setting
Akash Das Sarma; Aditya Parameswaran; Jennifer Widom - Building the Enterprise Fabric for Big Data with Vertica and Spark Integration
Jeff LeFevre; Rui Liu; Edward Ma; Malu Castellanos; Cornelio Inigo; Lupita Paz; Meichun Hsu - Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms
Xin Huang; Wei Lu; Laks Lakshmanan - Efficient and Progressive Group Steiner Tree Search
Rong-Hua LI; Lu Qin; Jeffrey Xu Yu; Rui Mao
Session 2: Privacy and Security
Tuesday 10:30-12:15
Grand Ballroom C
Session Chair: Gerome Miklau (UMass Amherst)
- Publishing Attributed Social Graphs with Formal Privacy Guarantees
Zachary Jorgensen; Ting Yu; Graham Cormode - Publishing Graph Degree Distribution with Node Differential Privacy
Wei-Yen Day; Ninghui Li; Min Lyu - Principled evaluation of differentially private algorithms using DPBench
Michael Hay; Ashwin Machanavajjhala; Gerome Miklau; Yan Chen; Dan Zhang - PrivTree: A Differentially Private Algorithm for Hierarchical Decompositions
Jun Zhang; Xiaokui Xiao; Xing Xie - Adaptive Indexing over Encrypted Numeric Data
Panagiotis Karras; Artyom Nikitin; Muhammad Saad; Rudrika Bhatt; Denis Antyukhov; Stratos Idreos - Practical Private Range Search Revisited
Ioannis Demertzis; Stavros Papadopoulos; Odysseas Papapetrou; Antonios Deligiannakis; Minos Garofalakis - Privacy Preserving Subgraph Matching on Large Graphs in Cloud
Zhao Chang; Lei Zou; Feifei Li
Session 3: Logical and Physical Database Design
Tuesday 10:30-12:15
Seacliffs
Session Chair: Carsten Binnig (Brown University)
- The Snowflake Elastic Data Warehouse
Benoit Dageville; Thierry Cruanes; Marcin Zukowski; Vadim Antonov; Artin Avanes; Jon Bock; Jonathan Claybaugh; Daniel Engovatov; Martin Hentschel; Jiansheng Huang; Allison Lee; Ashish Motivala; Abdul Munir; Steven Pelley; Peter Povinec; Greg Rahn; Spyridon Triantafyllis; Philipp Unterbrunner - Closing the Functional and Performance Gap between SQL and NoSQL
Zhen Hua Liu; Beda Hammerschmidt; doug. Mcmahon; ying Lu; hui Chang - Have Your Data and Query It Too: From Key-Value Caching to Big Data Management
Dipti Borkar; Ravi Mayurum; Gerald Sangudi; Michael Carey - Ambry: LinkedIn's Scalable Geo-Distributed Object Store
Shadi Abdollahian Noghabi; Sriram Subramanian; Priyesh Narayanan; Sivabalan Narayanan; Gopalakrishna Holla; Mammad Zadeh; Tianwei Li; Indranil Gupta; Roy Campbell - SQL Schema Design: Foundations, Normal Forms, and Normalization
Henning Koehler; Sebastian Link - SQLShare: Results from a Multi-Year SQL-as-a-Service Experiment
Shrainik Jain; Bill Howe; Dominik Moritz; Ed Lazowska; Dan Halperin - Automatic Generation of Normalized Relational Schemas from Nested Key-Value Data
Daniel Abadi; Michael DiScala
Session 4: New Storage and Network Architectures
Tuesday 1:30-3:00
Bayview
Session Chair: Daniel Abadi (Yale)
- Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation
Harald Lang; Tobias Muehlbauer; Florian Funke; Peter Boncz; Thomas Neumann; Alfons Kemper - GeckoFTL: Scalable Flash Translation Techniques For Very Large Flash Devices
Niv Dayan; Philippe Bonnet; Stratos Idreos - SHARE Interface in Flash Storage for Relational and NoSQL Databases
Gihwan Oh; Chiyoung Seo; Ravi Mayuram; Yang-Suk Kee; Sang-Won Lee - Accelerating Relational Databases by Leveraging Remote Memory and RDMA
Feng Li; Sudipto Das; Manoj Syamala; Vivek Narasayya - FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory
Ismail Oukid; Johan Lasperas; Anisoara Nica; Thomas Willhalm; Wolfgang Lehner - Micro-architectural Analysis of In-memory OLTP
Utku Sirin; Pinar Tozun; Danica Porobic; Anastasia Ailamaki
Session 5: Graphs 1: Infrastructure and Processing on Modern Hardware
Tuesday 1:30-3:00
Grand Ballroom C
Session Chair: Tyson Condie (UCLA)
- iBFS: Concurrent Breadth-First Search on GPUs
Hang Liu; Howie Huang; Yang Hu - Tornado: A System for Real-Time Iterative Analysis over Evolving Data
Xiaogang Shi; Bin Cui; Yingxia Shao; Yunhai Tong - EmptyHeaded: A Relational Engine for Graph Processing
Christopher Aberger; Susan Tu; Kunle Olukotun; Christopher Re - GTS: A Fast and Scalable Graph Processing Method based on Streaming Topology to GPUs
Min-Soo Kim; Kyu-Hyeon An; Himchan Park; Hyunseok Seo; Jinwook Kim - Graph Analytics Through Fine-Grained Parallelism
Zechao Shang; Feifei Li; Jeffrey Xu Yu; Zhiwei Zhang; Hong Cheng - Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing
Zhigang Wang; Yu Gu; Yubin Bao; Ge Yu; Jeffrey Xu Yu
Session 6: Streaming 1: Systems and Outlier Detection
Tuesday 1:30-3:00
Seacliffs
Session Chair: Alvin Cheung (University of Washington)
- Scalable Pattern Sharing on Event Streams
Medhabi Ray; Chuan Lei; Elke Rundensteiner - How to win a hot dog eating contest
Milos Nikolic; Christoph Koch; Mohammad Dashti - Sharing-Aware Outlier Analytics over High-Volume Data Streams
Lei Cao; Jiayuan Wang; Elke Rundensteiner - THEMIS: Fairness in Federated Stream Processing under Overload
Evangelia Kalyvianaki; Marco Fiscato; Theodoros Salonidis; Peter Pietzuch - SABER: Window-Based Hybrid Stream Processing for Heterogeneous Architectures
Alexandros Koliousis; Matthias Weidlich; Raul Castro Fernandez; Paolo Costa; Alexander Wolf; Peter Pietzuch - Range Thresholding on Streams
Miao Qiao; Junhao Gan; Yufei Tao
Session 7: Approximate Query Processing
Wednesday 8:30-10:00
Bayview
Session Chair: Amol Deshpande (University of Maryland)
- An Effective Syntax for Bounded Relational Queries
Yang Cao; Wenfei Fan - Wander Join: Online Aggregation via Random Walks
Feifei Li; Bin Wu; Ke Yi; Zhuoyue Zhao - Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters
Srikanth Kandula; Anil Shanbhag; Aleksandar Vitorovic; Matt Olma; Robert Grandl; Surajit Chaudhuri; Bolin Ding - A Study of Sorting Algorithms on Approximate Memory
Bingsheng He; Shunning Jiang; Shuang Chen; Xueyan Tang - Distributed Wavelet Thresholding for Maximum Error Metrics
Ioannis Mytilinis; Dimitrios Tsoumakos; Necarios Koziris - Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee
Bolin Ding; Silu Huang; Surajit Chaudhuri; Kaushik Chakrabarti; Chi Wang
Session 8: Networks and the Web
Wednesday 8:30-10:00
Grand Ballroom C
Session Chair: Aditya Parameswaran (University of Illinois)
- Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks
Hung Nguyen; My Thai; Thang Dinh - Spheres of Influence for More Effective Viral Marketing
Yasir Mehmood; Francesco Bonchi; David Garcia-Soriano - Continuous Influence Maximization: What Discounts Should We Offer to Social Network Users?
Yu Yang; Xiangbo Mao; Jian Pei; Xiaofei He - Holistic Influence Maximization: Combining Scalability and Efficiency with Opinion-Aware Models
Sainyam Galhotra; Akhil Arora; Shourya Roy - Potential and Pitfalls of Domain-Specific Information Extraction at Web Scale
Astrid Rheinländer; Mario Lehmann; Anja Kunkel; Jürg Meier; Ulf Leser - Robust and Noise Resistant Wrapper Induction
Tim Furche; Jinsong Guo; Sebastian Maneth; Christian Schallhart
Session 9: Data Discovery and Extraction
Wednesday 8:30-10:00
Seacliffs
Session Chair: Paolo Papotti (Arizona State University)
- Goods: Organizing Google's Datasets
Sudip Roy; Neoklis Polyzotis; Natasha Noy; Steven Whang; Christopher Olston; Alon Halevy; Flip Korn - Multi-Source Uncertain Entity Resolution at Yad Vashem
Tomer Sagi; Avigdor Gal; Omer Barkol; Ruth Bergman; Alexander Avram - A Hybrid Approach to Functional Dependency Discovery
Thorsten Papenbrock; Felix Naumann - Ontological Pathfinding: Mining First-Order Knowledge from Large Knowledge Bases
Yang Chen; Sean Goldberg; Daisy Zhe Wang; Soumitra Siddharth Johri - Extracting Databases from Dark Data with DeepDive
Ce Zhang; Jaeho Shin; Christopher Re; Michael Cafarella; Feng Niu - Estimating the Impact of Unknown Unknowns on Aggregate Query Results
Yeounoh Chung; Tim Kraska; Carsten Binnig; Michael Lind Mortensen
Session 10: Data Integration / Cleaning
Wednesday 10:30-12:15
Bayview
Session Chair: Alexandra Meliou (University of Massachusetts, Amherst)
- Constraint-Variance Tolerant Data Repairing
Shaoxu Song; Han Zhu; Jianmin Wang - Interactive and Deterministic Data Cleaning
Jian He; Enzo Veltri; Donatello Santoro; Guoliang Li; Gianni Mecca; Paolo Papotti; Nan Tang - Sequential Data Cleaning: A Statistical Approach
Aoqian Zhang; Shaoxu Song; Jianmin Wang - Learning-Based Cleansing for Indoor RFID Data
Asif iqbal Baba; Manfred Jaeger; Hua Lu; Torben Bach Pedersen; Wei-Shinn Ku; Xike Xie - PrivateClean: Data Cleaning and Differential Privacy
Sanjay Krishnan; Jiannan Wang; Tim Kraska; Ken Goldberg; Michael Franklin - RDFind: Scalable Conditional Inclusion Dependency Discovery in RDF Datasets
Sebastian Kruse; Anja Jentzsch; Thorsten Papenbrock; Zoi Kaoudi; Jorge Quiané-Ruiz; Felix Naumann - Cost-Effective Crowdsourced Entity Resolution: A Partial-Order Approach
Chengliang Chai; Guoliang Li; Jian Li; Dong Deng; Jianhua Feng
Session 11: Spatio / Temporal Databases
Wednesday 10:30-12:15
Grand Ballroom C
Session Chair: Daisy Zhe Wang (University of Florida)
- Topic Exploration in Spatio-Temporal Document Collections
Kaiqi Zhao; Lisi Chen; Gao Cong - ParTime: Parallel Temporal Aggregation
Markus Pilman; Florian Kühl; Martin Kaufmann; Donald Kossmann; Damien Profeta - Data Polygamy: The Many-Many Relationships among Urban Spatio-Temporal Data Sets
Fernando Chirigati; Harish Doraiswamy; Theodoros Damoulas; Juliana Freire - Distributed Evaluation of Top-k Temporal Joins
Julien Pilourdault; Sihem Amer-Yahia; Vincent Leroy - AT-GIS: Highly Parallel Spatial Query Processing with Associative Transducers
Peter Ogden; Peter Pietzuch; David Thomas - Towards Best Region Search for Data Exploration
Kaiyu Feng; Gao Cong; Sourav S Bhowmick; Wen-Chih Peng; Chunyan Miao - Simba: Efficient In-Memory Spatial Analytics
Dong Xie; Feifei Li; Bin Yao; Gefei Li; Liang Zhou; Minyi Guo
Session 12: Distributed Data Processing
Wednesday 1:30-3:00
Bayview
Session Chair: Peter Bailis (Stanford University)
- Realtime Data Processing at Facebook
Guoqiang Jerry Chen; Janet L. Wiener; Shridhar Iyer; Anshul Jaiswal; Ran Lei Nikhil Simha; Wei Wang; Kevin Wilfong; Tim Williamson; Serhat Yilmaz - SparkR: Scaling R Programs with Spark
Shivaram Venkataraman; Zongheng Yang; Davies Liu; Eric Liang; Hossein Falaki; Xiangrui Meng; Reynold Xin; Ali Ghodsi; Michael Franklin; Ion Stoica; Matei Zaharia - VectorH: taking SQL-on-Hadoop to the next level
Andrei Costea; Adrian Ionescu; Bogdan Raducanu; Michal Switakowski; Cristian Barca; Juliusz Sompolski; Alicja Luszczak; Michal Szafranski; Giel De Nijs; Peter Boncz - Adaptive Logging: Optimizing Logging and Recovery Costs in Distributed In-memory Databases
Chang Yao; Divyakant Agrawal; Gang Chen; Beng Chin Ooi; Sai Wu - Big Data Analytics with Datalog Queries on Spark
Alexander Shkapsky; Mohan Yang; Matteo Interlandi; Hsuan Chiu; Tyson Condie; Carlo Zaniolo - An Efficient MapReduce Cube Algorithm for Varied Data Distributions
Eyal Altshuler; Tova Milo
Session 13: Graphs 2: Subgraph-based Optimization Techniques
Wednesday 1:30-3:00
Grand Ballroom C
Session Chair: Feifei Li (University of Utah)
- Diversified Top-k Subgraph Querying in a Large Graph
Yang Zhengwei; Ada Wai-Chee Fu; Ruifeng Liu - Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
Mohamed Hassan; Walid Aref; Ahmed Aly - Efficient Subgraph Matching by Postponing Cartesian Products
Fei Bi; Lijun Chang; Xuemin Lin; Lu Qin; Wenjie Zhang - Adding Counting Quantifiers to Graph Patterns
Wenfei Fan; YINGHUI WU; Jingbo Xu - DualSim: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine
Hyeonji Kim; JuneYoung Lee; Sourav S Bhowmick; Wook-Shin Han; Jeong Hoon Lee; Seongyun Ko; Moath Jarrah - Distributed Set Reachability
Sairam Gurajada; Martin Theobald
Session 14: Main Memory Analytics
Wednesday 1:30-3:00
Seacliffs
Session Chair: Holger Pirk (MIT)
- Fast Multi-column Sorting in Main-Memory Column-Stores
Wenjian Xu; Ziqiang Feng; Eric Lo - Elastic Pipelining In an In-Memory Database Cluster
Li Wang; Zhou Minqi; Zhenjie Zhang; Yin Yang; Aoying Zhou - Page As You Go: Piecewise Columnar Access In SAP HANA
Reza Sherkat; Colin Florendo; Mihnea Andrei; Anil Goel; Anisoara Nica; Peter Bumbulis; Ivan Schreter; Guenter Radestock; Christian Bensberg; Daniel Booss; Heiko Gerwens - Hybrid Garbage Collection for Multi-Version Concurrency Control in SAP HANA
Juchang Lee; Hyungyu Shin; Chang Gyoo Park; Seongyun Ko; Yongjae Chuh; Jaeyun Noh; Wolfgang Stephan; Wook-Shin Han - Bridging the Archipelago between Row-Stores and Column-Stores for Hybrid Workloads
Joy Arulraj; Andy Pavlo; Prashanth Menon - UpBit: Scalable In-Memory Updatable Bitmap Indexing
Manos Athanassoulis; Zheng Yan; Stratos Idreos
Session 15: Interactive Analytics
Thursday 10:30-12:00
Grand Ballroom A
Session Chair: Eugene Wu (Columbia University)
- FluxQuery: An Execution Framework for Highly Interactive Query Workloads
Roee Ebenstein; Niranjan Kamat; Arnab Nandi - iOLAP: Managing Uncertainty for Efficient Incremental OLAP
Kai Zeng; Sameer Agarwal; Ion Stoica - Dynamic Prefetching of Data Tiles for Interactive Visualization
Leilani Battle; Michael Stonebraker; Remco Chang - Expressive Query Construction through Direct Manipulation of Nested Relational Results
Eirik Bakke; David Karger - Shasta: Interactive Reporting At Scale
Gokul Nath Babu Manoharan; Stephan Ellner; Karl Schnaitter; Sridatta Chegu; Alejandro Estrella Balderrama; Stephan Gudmundson; Apurv Gupta; Ben Handy; Bart Samwel; Chad Whipkey; Larysa Aharkava; Himani Apte; Nitin Gangahar; Jun Xu; Shivakumar Venkataraman; Divyakant Agrawal; Jeffrey D. Ullman - Datometry Hyper-Q: Bridging the Gap Between Real-Time and Historical Analytics
Lyublena Antova; Rhonda Baldwin; Derrick Bryant; Tuan Cao; Michael Duller; John Eshleman; Zhongxian Gu; Entong Shen; Mohamed Soliman; F. Michael Waas
Session 16: Streaming 2: Sketches
Thursday 10:30-12:00
Grand Ballroom BC
Session Chair: Amelie Marian (Rutgers University)
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams
Anshumali Shrivastava; Christian Konig; Mikhail Bilenko - Streaming Algorithms for Robust Distinct Elements
Di Chen; Qin Zhang - Augmented Sketch: Faster and More Accurate Stream Processing
Pratanu Roy; Arijit Khan; Gustavo Alonso - Matrix Sketching Over Sliding Windows
Zhewei Wei; Xuancheng Liu; Feifei Li; Shuo Shang; Xiaoyong Du; Ji-Rong Wen - Graph Stream Summarization
Nan Tang; Qing Chen; Prasenjit Mitra - Scalable Approximate Query Tracking over Highly Distributed Data Streams
Nikos Giatrakos; Antonios Deligiannakis; Minos Garofalakis
Session 17: Transaction Processing
Thursday 10:30-12:00
Seacliffs
Session Chair: Justin Levandoski (Microsoft Research)
- A Hybrid B+-Tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms
Amirhesam Shahvarani; Hans-Arno Jacobsen - Low-Overhead Asynchronous Checkpointing in Main-Memory Database Systems
Kun Ren; Thaddeus Diamond; Daniel Abadi; Alexander Thomson - T-Part: Partitioning of Transactions for Forward-Pushing in Deterministic Database Systems
Shan-Hung Wu; Tsai-Yu Feng; Meng-Kai Liao; Shao-Kan Pi; Yu-Shan Lin - Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes
Huanchen Zhang; David Andersen; Andy Pavlo; Michael Kaminsky; Lin Ma; Rui Shen - Design Principles for Scaling Multi-core OLTP Under High Contention
Kun Ren; Jose Faleiro; Daniel Abadi - DBSherlock: A Performance Diagnostic Tool for Transactional Databases
Dong Young Yoon; Ning Niu; Barzan Mozafari
Session 18: Transactions and Consistency
Thursday 1:30-3:00
Grand Ballroom A
Session Chair: Andy Pavlo (CMU)
- TARDiS: A Branch-and-Merge Approach To Weak Consistency
Natacha Crooks; Youer Pu; Nancy Estrada; Trinabh Gupta; Lorenzo Alvisi; Allen Clement - TicToc: Time Traveling Optimistic Concurrency Control
Xiangyao Yu; Andy Pavlo; Daniel Sanchez; Srinivas Devadas - Scaling Multicore Databases via Constrained Parallel Execution
Zhaoguo Wang; Yang Cui; Han Yi; Shuai Mu; haibo Chen; Jinyang Li - Towards a Non-2PC Transaction Management in Distributed Database Systems
Qian Lin; Pengfei Chang; Gang Chen; Beng Chin Ooi; Kian-Lee Tan; Zhengkui Wang - ERMIA: Fast memory-optimized database system for heterogeneous workloads
Kangnyeon Kim; Tianzheng Wang; Ryan Johnson; Ippokratis Pandis - Transaction Healing: Scaling Optimistic Concurrency Control on Multicores
Yingjun Wu; Chee Yong Chan; Kian-Lee Tan
Session 19: Query Optimization
Thursday 1:30-3:00
Grand Ballroom BC
Session Chair: Stratos Idreos (Harvard University)
- Enabling Incremental Query Re-Optimization
Mengmeng Liu; Zachary Ives; Boon Loo - Sampling-Based Query Re-Optimization
Wentao Wu; Jeffrey Naughton; Harneet Singh - A Fast Randomized Algorithm for Multi-Objective Query Optimization
Immanuel Trummer; Christoph Koch - Operator and Query Progress Estimation in Microsoft SQL Server Live Query Statistics
Kukjin Lee; Christian Konig; Vivek Narasayya; Bolin Ding; Surajit Chaudhuri; Brent Ellwein; Alexey Eksarevskiy; Manbeen Kohli; Praneeta Prakash; Jacob Wyant; Jiexing Li; Rimma Nehme; Jeffrey Naughton - Optimization of Nested Queries using the NF2 Algebra
Jürgen Hölsch; Michael Grossniklaus; Marc Scholl - Extracting Equivalent SQL From Imperative Code in Database Applications
Venkatesh Emani; Karthik Ramachandra; S. Sudarshan; Subhro Bhattacharya
Session 20: Graphs 3: Potpourri
Thursday 1:30-3:00
Seacliffs
Session Chair: Bill Howe (University of Washington)
- Generating Preview Tables for Entity Graphs
Ning Yan; Sona Hasani; Abolfazl Asudeh; Chengkai Li - Speedup Graph Processing by Graph Ordering
Hao Wei; Jeffrey Xu Yu; Can LU; Xuemin Lin - ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks
Ali Hadian; Sadegh Nobari; Behrouz Minaei-Bidgoli; Qiang Qu - Functional Dependencies for Graphs
Wenfei Fan; Yinghui Wu; Jingbo Xu - SLING: A Near-Optimal Index Structure for SimRank
Boyu Tian; Xiaokui Xiao - Query Planning for Evaluating SPARQL Property Paths
Nikolay Yakovets; Parke Godfrey; Jarek Gryz
Session 21: Hardware Acceleration and Query Compilation
Thursday 3:30-5:00
Grand Ballroom A
Session Chair: Thomas Neumann (TU Munich)
- Robust Query Processing in Co-Processor-accelerated Databases
Sebastian Breß; Henning Funke; Jens Teubner - How to Architect a Query Compiler
Amir Shaikhha; Yannis Klonatos; lionel Parreaux; Lewis Brown; Mohammad Dashti; Christoph Koch - Automated Demand-driven Resource Scaling in Relational Database-as-a-Service
Sudipto Das; Feng Li; Vivek Narasayya; Christian Konig - GPL: A GPU-based Pipelined Query Processing Engine
Jiong He; Paul Johns; Bingsheng He - Towards a Hybrid Design for Fast Query Processing in DB2 with BLU Acceleration Using Graphical Processing Units
Sina Meraji; Berni Schiefer; Lan Pham; Lee Chu; Peter Kokosielis; Adam Storm; Wayne Young; Chang Ge; Geoffrey Ng; Kajan Kanagaratnam - An Experimental Comparison of Thirteen Relational Equi-Joins in Main Memory
Stefan Schuh; Jens Dittrich; Xiao Chen
Session 22: Nearest Neighbors and Similarity Search
Thursday 3:30-5:00
Grand Ballroom BC
Session Chair: Kyriakos Mouratidis (Singapore Management University)
- Top-k Relevant Semantic Place Retrieval on Spatial RDF Data
Jieming Shi; Dingming Wu; Nikos Mamoulis - Local Similarity Search for Unstructured Text
Pei Wang; Chuan Xiao; Jianbin Qin; Wei Wang; Xiaoyang Zhang; Yoshiharu Ishikawa - Similarity Join over Array Data
Weijie Zhao; Florin Rusu; Bin Dong; John Wu - LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index
Yuxin Zheng; Qi Guo; Anthony Tung; Sai Wu - Set-based Similarity Search for Time Series
Jinglin Peng; Hongzhi Wang; Jianzhong Li; Hong Gao - Range-based Obstructed Nearest Neighbor Queries
Huaijie Zhu; Xiaochun Yang; bin wang; Wang-Chien Lee
DEMOS SESSIONS
Session 1
Tuesday 3:30-5:00
Garden Room
- 1 - PerNav: A Route Summarization Framework for Personalized Navigation
- 2 - Exploring Privacy-Accuracy Tradeoffs using DPComp
- 3 - Constance: An Intelligent Data Lake System
- 4 - Energy Elasticity on Heterogeneous Hardware using Adaptive Resource Reconfiguration LIVE
- 5 - Web-based Benchmarks for Forecasting Systems - The ECAST Platform
- 6 - REACT: Context-Sensitive Recommendations for Data Analysis
- 7 - QUEPA: QUerying and Exploring a Polystore by Augmentation
- 8 - Making the Case for Query-by-Voice with EchoQuery
- 9 - FERARI: A Prototype for Complex Event Processing over Streaming Multi-cloud Platforms
- 10 - Emma in Action: Declarative Dataflows for Scalable Data Analysis
- 11 - CLAMS: Bringing Quality to Data Lakes
- 12 - The CloudMdsQL Multistore System
- 13 - ReproZip: Computational Reproducibility With Ease
- 14 - PerfEnforce Demonstration: Data Analytics with Performance Guarantees
- 15 - DB-Risk: The Game of Global Database Placement
- 16 - Efficient Query Processing on Many-core Architectures: A Case Study with Intel Xeon Phi Processor
- 17 - What Makes a Good Physical plan? — Experiencing Hardware-Conscious Query Optimization with Candomble
- 18 - RxSpatial: Reactive Spatial Library for Real-Time Location Tracking and Processing
- 19 - High-Performance Geospatial Analytics in HyPerSpace
- 20 - Wander Join: Online Aggregation for Joins
- 21 - Rheem: Enabling Multi-Platform Task Execution
Session 2
Wednesday 3:30-5:00
Garden Room
- 1 - Ontology-Based Integration of Streaming and Static Relational Data with Optique
- 2 - CoDAR: Revealing the Generalized Procedure & Recommending Algorithms of Community Detection
- 3 - QFix: Demonstrating error diagnosis in query histories
- 4 - Constance: An Intelligent Data Lake System
- 5 - Web-based Benchmarks for Forecasting Systems - The ECAST Platform
- 6 - Energy Elasticity on Heterogeneous Hardware using Adaptive Resource Reconfiguration LIVE
- 7 - CLAMS: Bringing Quality to Data Lakes
- 8 - QUEPA: QUerying and Exploring a Polystore by Augmentation
- 9 - FERARI: A Prototype for Complex Event Processing over Streaming Multi-cloud Platforms
- 10 - BART in Action: Error Generation and Empirical Evaluations of Data-Cleaning Systems
- 11 - Quegel: A General-Purpose System for Querying Big Graphs
- 13 - The CloudMdsQL Multistore System
- 14 - PerfEnforce Demonstration: Data Analytics with Performance Guarantees
- 15 - SourceSight: Enabling Effective Source Selection
- 16 - Interactive Search and Exploration of Waveform Data with Searchlight
- 17 - DB-Risk: The Game of Global Database Placement
- 18 - Wildfire: Concurrent Blazing Data Ingest and Analytics
- 19 - SnappyData: Streaming, Transactions, and Interactive Analytics in a Single Cluster
- 20 - ActiveClean: Interactive Data Cleaning For Modern Machine Learning
- 21 - Rheem: Enabling Multi-Platform Task Execution
Session 3
Thursday 3:30-5:00
Garden Room
- 1 - PerNav: A Route Summarization Framework for Personalized Navigation
- 2 - Ontology-Based Integration of Streaming and Static Relational Data with Optique
- 3 - CoDAR: Revealing the Generalized Procedure & Recommending Algorithms of Community Detection
- 4 - Exploring Privacy-Accuracy Tradeoffs using DPComp
- 5 - QFix: Demonstrating error diagnosis in query histories
- 6 - REACT: Context-Sensitive Recommendations for Data Analysis
- 7 - Making the Case for Query-by-Voice with EchoQuery
- 8 - Emma in Action: Declarative Dataflows for Scalable Data Analysis
- 9 - BART in Action: Error Generation and Empirical Evaluations of Data-Cleaning Systems
- 10 - Quegel: A General-Purpose System for Querying Big Graphs
- 11 - ReproZip: Computational Reproducibility With Ease
- 12 - SourceSight: Enabling Effective Source Selection
- 13 - Interactive Search and Exploration of Waveform Data with Searchlight
- 14 - Wildfire: Concurrent Blazing Data Ingest and Analytics
- 15 - Efficient Query Processing on Many-core Architectures: A Case Study with Intel Xeon Phi Processor
- 16 - SnappyData: Streaming, Transactions, and Interactive Analytics in a Single Cluster
- 17 - ActiveClean: Interactive Data Cleaning For Modern Machine Learning
- 18 - What Makes a Good Physical plan? — Experiencing Hardware-Conscious Query Optimization with Candomble
- 19 - RxSpatial: Reactive Spatial Library for Real-Time Location Tracking and Processing
- 20 - High-Performance Geospatial Analytics in HyPerSpace
- 21 - Wander Join: Online Aggregation for Joins
POSTER SESSIONS
Session 1
Tuesday 3:30-5:00
Grand Ballroom A
- 1 - Learning Linear Regression Models over Factorized Joins
- 2 - To Join or Not to Join? Thinking Twice about Joins before Feature Selection
- 3 - Real-time Video Recommendation Exploration
- 4 - Towards Globally Optimal Crowdsourcing Quality Management
- 5 - Building the Enterprise Fabric for Big Data with Vertica and Spark Integration
- 6 - Probabilistic Truss Decomposition: Concepts and Algorithms
- 7 - Efficient and Progressive Group Steiner Tree Search
- 8 - Publishing Attributed Social Graphs with Formal Privacy Guarantees
- 9 - Publishing Graph Degree Distribution with Node Differential Privacy
- 10 - Principled evaluation of differentially private algorithms using DPBench
- 11 - PrivTree: A Differentially Private Algorithm for Hierarchical Decompositions
- 12 - Adaptive Indexing over Encrypted Data
- 13 - Practical Private Range Search Revisited
- 14 - Privacy Preserving Subgraph Matching on Large Graphs in Cloud
- 15 - The Snowflake Elastic Data Warehouse
- 16 - Closing the Schema and Performance Gap between SQL and NoSQL
- 17 - Have Your Data and Query It Too: From Key-Value Caching to Big Data Management
- 18 - Ambry: LinkedIn's Scalable Geo-Distributed Object Store
- 19 - SQL Schema Design
- 20 - TableShare: Results from a Multi-Year SQL-as-a-Service Experiment
- 21 - Automatic Generation of Normalized Relational Schemas from Key-Value Data
- 22 - Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation
- 23 - GeckoFTL: Scalable Flash Translation Techniques For Very Large Flash Devices
- 24 - SHARE Interface in Flash Storage for Databases
- 25 - Accelerating Relational Databases by Leveraging Remote Memory and RDMA
- 26 - FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory
- 27 - Micro-architectural Analysis of In-memory OLTP
- 28 - iBFS: Concurrent Breadth-First Graph Traversal on GPUs
- 29 - Tornado: A System for Real-Time Iterative Analysis over Evolving Data
- 30 - System-X: A Relational Engine for Graph Processing
- 31 - GTS: A Fast and Scalable Graph Processing Method based on Streaming Topology to GPUs
- 32 - Graph Analytics Through Fine-Grained Parallelism
- 33 - Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing
- 34 - Scalable Pattern Sharing over Event Streams
- 35 - How to win a hot dog eating contest
- 36 - Sharing-Aware Outlier Analytics over High-Volume Data Streams
- 37 - THEMIS: Fairness in Federated Stream Processing under Overload
- 38 - SABER: Window-Based Hybrid Stream Processing for Heterogeneous Architectures
- 39 - Range Thresholding on Streams
- 40 - Bridging the Archipelago between Row-Stores and Column-Stores for Hybrid Workloads
- 41 - An Effective Syntax for Bounded Relational Queries
- 42 - Wander Join: Online Aggregation via Random Walks
- 43 - Lazily Approximating Complex AdHoc Queries in Big Data Clusters
- 44 - A Study of Sorting Algorithms on Approximate Memory
- 45 - Distributed Wavelet Thresholding for Maximum Error Metrics
- 46 - Sample + Seek: Approximating Aggregates with Distribution Precision Guarantee
- 47 - Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks
- 48 - Spheres of Influence for More Effective Viral Marketing
- 49 - Continuous Influence Maximization: What Discounts Should We Offer to Social Network Users?
- 50 - Holistic Influence Maximization: Combining Scalability and Efficiency with Opinion-Aware Models
- 51 - Potential and Pitfalls of Domain-Specific Information Extraction at Web Scale
- 52 - Robust and Noise Resistant Wrapper Induction
- 53 - Goods: Organizing Google's Datasets
- 54 - Multi-Source Uncertain Entity Resolution at Yad Vashem: Transforming Holocaust Victim Reports into People
- 55 - A Hybrid Approach to Functional Dependency Discovery
- 56 - Ontological Pathfinding: Mining First-Order Knowledge from Large Knowledge Bases
- 57 - Extracting Databases from Dark Data with DeepDive
- 58 - Estimating the Impact of Unknown Unknowns on Aggregate Query Results
- 59 - Constraint-Variance Tolerant Data Repairing
- 60 - Interactive and Deterministic Data Cleaning
- 61 - Sequential Data Cleaning: A Statistical Approach
- 62 - Learning-Aided Cleansing for Indoor RFID Data
- 63 - PrivateClean: Data Cleaning and Differential Privacy
- 64 - RDFind: Scalable Conditional Inclusion Dependency Discovery in RDF Datasets
- 65 - Cost-Effective Crowdsourced Entity Resolution: A Partial-Order Approach
- 66 - Topic Exploration in Spatio-Temporal Document Collections
- 67 - ParTime: Parallel Temporal Aggregation
- 68 - Data Polygamy: The Many-Many Relationships among Urban Spatio-Temporal Data Sets
- 69 - Distributed Top-k Temporal Joins
- 70 - AT-GIS: Highly Parallel Spatial Query Processing with Associative Transducers
- 71 - Towards Best Region Search with Submodular Monotone Aggregate Function
- 72 - Simba: Efficient In-Memory Spatial Analytics
- 73 - Realtime Data Processing at Facebook
- 74 - SparkR: Scaling R Programs with Spark
- UG-A - CodeOntology: a Java semantic database
- UG-B - Constructing Join Histograms from Histograms with q-error Guarantees
- UG-C - Vectorizing an In Situ Query Engine
- UG-D - M3: Scaling Up Machine Learning via Memory Mapping
- UG-E - Minimizing Average Regret Ratio in Database
- UG-F - Graph Summarization for Geo-correlated Trends Detection in Social Networks
- UG-G - K-means Split Revisited: Well-grounded Approach and Experimental Evaluation
- UG-H - Research Contribution as a Measure of Influence
- UG-I - Adaptive Denormalization
- UG-J - Adaptive Data Skipping in Main-Memory Systems
- UG-K - Exploring Visualization of Data Transforms
- UG-L - Searching Web Data using MinHash LSH
- P1 - Minimization of Tree Pattern Queries
- P2 - Incremental View Maintenance For Collection Programming
- P3 - Aggregations over Generalized Hypertree Decompositions
- P4 - Bounded Query Rewriting Using Views
- P5 - Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable
- P6 - Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins
- P7 - On the Complexity of Inner Product Similarity Join
- P8 - Verification of Hierarchical Artifact Systems
- P9 - Recency-Bounded Verification of Dynamic Database-Driven Systems
- P10 - Making SQL Queries Correct on Incomplete Databases: A Feasibility Study
- P11 - Designing a Query Language for RDF: Marrying Open and Closed Worlds
- P12 - Towards Tight Bounds for the Streaming Set Cover Problem
- P13 - An Optimal Algorithm for Heavy Hitters in Insertion Streams and Related Problems
- P14 - Better Algorithms for Counting Triangles in Data Streams
- P15 - Locating a Small Cluster Privately
Session 2
Wednesday 3:30-5:00
Grand Ballroom A
- 75 - VectorH: taking SQL-on-Hadoop to the next level
- 76 - Adaptive Logging: Optimizing Logging and Recovery Costs in Distributed In-memory Databases
- 77 - Big Data Analytics with Datalog Queries on Spark
- 78 - An Efficient MapReduce Cube Algorithm for Varied Data Distributions
- 79 - Diversified Subgraph Querying in a Large Graph
- 80 - Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
- 81 - Efficient Subgraph Matching by Postponing Cartesian Products
- 82 - Adding Counting Quantifiers to Graph Patterns
- 83 - DualSim: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine
- 84 - Distributed Set Reachability
- 85 - Fast Multi-column Sorting in Main-Memory Column-Stores
- 86 - Elastic Pipelining In an In-Memory Database Cluster
- 87 - Page As You Go: Piecewise Columnar Access In SAP HANA
- 88 - Hybrid Garbage Collection for Multi-Version Concurrency Control in SAP HANA
- 89 - Bridging the Archipelago between Row-Stores and Column-Stores for Hybrid Workloads
- 90 - UpBit: Scalable In-Memory Updatable Bitmap Indexing
- 91 - FluxQuery: An Execution Framework for Highly Interactive Query Workloads
- 92 - iOLAP: Incremental OLAP for Interactive Analysis on Big Data
- 93 - Dynamic Prefetching of Data Tiles for Interactive Visualization
- 94 - Expressive Query Construction through Direct Manipulation of Nested Relational Results
- 95 - Shasta: Interactive Reporting At Scale
- 96 - Datometry Hyper-Q: Bridging the Gap Between Real Time and Historical Analytics
- 97 - Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams
- 98 - Streaming Algorithms for Robust Distinct Elements
- 99 - Augmented Sketch: Faster and More Accurate Stream Processing
- 100 - Matrix Sketching Over Sliding Windows
- 101 - Graph Stream Summarization: From Big Bang to Big Crunch
- 102 - Scalable Approximate Query Tracking over Highly Distributed Data Streams
- 103 - A Hybrid B+-Tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms
- 104 - Low-Overhead Asynchronous Checkpointing in Main-Memory Database Systems
- 105 - T-Part: Partitioning of Transactions for Onward-Pushing in Deterministic Database Systems
- 106 - Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes
- 107 - Scaling Multi-core OLTP Under High Contention
- 108 - DBSherlock: A Performance Diagnostic Tool for Transactional Databases
- 109 - TARDiS: Making Sense of Weak Consistency
- 110 - TicToc: Time-Traveling Optimistic Concurrency Control
- 111 - Unleashing Parallelism in Multi-core Databases via Dependency Tracking
- 112 - Towards a Non-2PC Transaction Management in Distributed Database Systems
- 113 - ERMIA: Fast memory-optimized database system for heterogeneous workloads
- 114 - Transaction Healing: Scaling Optimistic Concurrency Control on Multicores
- 115 - Enabling Incremental Query Re-Optimization
- 116 - Sampling-Based Query Re-Optimization
- 117 - A Fast Randomized Algorithm for Multi-Objective Query Optimization
- 118 - Operator and Query Progress Estimation in Microsoft SQL Server Live Query Statistics
- 119 - Optimization of Nested Queries using the NF2 Algebra
- 120 - Extracting Equivalent SQL From Imperative Code in Database Applications
- 121 - Generating Preview Tables for Entity Graphs
- 122 - Speedup Graph Processing by Graph Ordering
- 123 - ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks
- 124 - Functional Dependencies for Graphs
- 125 - SLING: A Near-Optimal Index Structure for SimRank
- 126 - Query Planning for Evaluating SPARQL Property Paths
- 127 - Robust Query Processing in Co-Processor-accelerated Databases
- 128 - How to Architect a Query Compiler
- 129 - Automated Demand-driven Resource Scaling in Relational Database-as-a-Service
- 130 - GPL: A GPU-based Pipelined Query Processing Engine
- 131 - Towards a Hybrid Design for Fast Query Processing in DB2 with BLU Acceleration
- 132 - An Experimental Comparison of Thirteen Relational Equi-Joins in Main Memory
- 133 - Top-k Relevant Semantic Place Retrieval on Spatial RDF Data
- 134 - Local Similarity Search for Unstructured Text
- 135 - Similarity Join over Array Data
- 136 - LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index
- 137 - Set-based Similarity Search for Time Series
- 138 - Range-based Obstructed Nearest Neighbor Queries
- 139 - Data Cleaning: Overview and Emerging Challenges
- 140 - Big Graph Analytics Systems
- 141 - Microblogs Data Management Systems: Querying, Analysis, and Visualization
- 142 - Design Tradeoffs of Data Access Methods
- 143 - The Challenges of Global-scale Data Management
- 144 - Provenance: On and Behind the Screens
- 145 - Querying Geo-Textual Data: Spatial Keyword Queries and Beyond
- 146 - Introduction to Spark 2.0 for Database Researchers
- 147 - Automatic Entity Recognition and Typing in Massive Text Data
- 148 - Semistructured Models, Queries and Algebras in the Big Data Era
- TODS-A - Workload-Driven Antijoin Cardinality Estimation
- TODS-B - Reducing Layered Database Applications to their Essence through Vertical Integration
- TODS-C - BEVA: An Efficient Query Processing Algorithm for Error Tolerant Autocompletion
- TODS-D - Synchronization of Queries and Views Upon Schema Evolutions: A Survey
- TODS-E - The Exact Complexity of the First-Order Logic Definability Problem
- PROG-A - SIGMOD Programming Contest Finalist/Peking University
- PROG-B - SIGMOD Programming Contest Finalist/University of Engineering and Technology – Vietnam National University
- PROG-C - SIGMOD Programming Contest Finalist/The University of Tokyo
- PROG-D - SIGMOD Programming Contest Finalist/National and Kapodistrian University of Athens
- PROG-E - SIGMOD Programming Contest Finalist/Technische Universitat Munchen
- P16 - FAQ: Questions Asked Frequently
- P17 - Shortest Paths and Distances with Differential Privacy
- P18 - Schema validation via streaming circuits
- P19 - Variability in data streams
- P20 - Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors
- P21 - Efficient Top-k Indexing via General Reductions
- P22 - Anti-Persistence on Persistent Storage: History-Independent Sparse Arrays and Dictionaries
- P23 - Counting Answers to Existential Positive Queries: A Complexity Classification
- P24 - Worst-case Optimal Algorithms for Conjunctive Queries with Functional Dependencies
- P25 - Semantic Acyclicity Under Constraints
- P26 - Tractable Lineages on Treelike Instances: Limits and Extensions
- P27 - Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures
- P28 - Space Lower Bounds for Itemset Frequency Sketches
- P29 - Are Few Bins Enough: Testing Histogram Distributions
- P30 - Range-Max Queries on Uncertain Data
- P31 - Fast Algorithms for Parsing Sequences of Parentheses with Few Errors
TUTORIAL SESSIONS
Tutorial 1
Sunday 8:30-12:00
Location: Seacliff D
- Data Cleaning: Overview and Emerging Challenges
Xu Chu; Ihab F. Ilyas; Sanjay Krishnan; Jiannan Wang
Tutorial 2
Sunday 13:30-17:00
Location: Seacliff D
- Big Graph Analytics Systems
Da Yan; Yingyi Bu; Yuanyuan Tian; Amol Deshpande; James Cheng
Tutorial 3
Monday 10:30-12:00
Location: Seacliff C
- Microblogs Data Management Systems: Querying, Analysis, and Visualization
Mohamed F. Mokbel; Amr Magdy
Tutorial 4
Monday 15:30-17:00
Location: Seacliff C
- Design Tradeoffs of Data Access Methods
Manos Athanassoulis; Stratos Idreos
Tutorial 5
Friday 8:30-12:00
Location: Bayview A
- The Challenges of Global-scale Data Management
Faisal Nawab; Divyakant Agrawal; Amr El Abbadi
Tutorial 6
Friday 8:30-10:00
Location: Bayview B
- Provenance: On and Behind the Screens
Melanie Herschel; Marcel Hlawatsch
Tutorial 7
Friday 10:30-12:00
Location: Bayview B
- Querying Geo-Textual Data: Spatial Keyword Queries and Beyond
Gao Cong; Christian S. Jensen
Tutorial 8
Friday 13:30-17:00
Location: Bayview A
- Introduction to Spark 2.0 for Database Researchers
Michael Armbrust; Doug Bateman; Reynold Xin; Matei Zaharia
Tutorial 9
Friday 13:30-15:00
Location: Bayview B
- Automatic Entity Recognition and Typing in Massive Text Data
Xiang Ren; Ahmed El-Kishky; Heng Ji; Jiawei Han
Tutorial 10
Friday 15:30-17:00
Location: Bayview B
- Semistructured Models, Queries and Algebras in the Big Data Era
Yannis Papakonstantinou
Award Talks
Thursday 8:30-10:00
Location: Grand Ballroom A
8:30 Award Announcements
- Undergraduate Awards
- Programming Contest Award
- Best Demonstration Award
- SIGMOD Best Paper Award
- PODS Best Paper Award
- PODS Test of Time Award
- PODS Student Paper Award
- SIGMOD Systems Award
- Contributions Award
9:00 Awards and Presentations
- Jim Gray Doctoral Dissertation Awards
- Test-of-Time Award
- Edgar F. Codd Innovations Award
Careers in Industry Panel
Wednesday 10:30-12:15
Location: Seacliffs
Moderator: Guy Lohman (IBM Research)
Panelists:
- Alon Halevy (Recruit)
- Andrew Witkowski (Oracle)
- Divesh Srivastava(ATT)
- Ganapathy Subramanian (Infosys)
- Janet Wiener (Facebook)
- Kate Morris (Tableau)
- Latha Colby (Platfora)
- Marcin Zukowski (Snowflake)
- Pinar Tözün (IBM Research)
- Siuling Ku (Salesforce)
- Surajit Chaudhuri (Microsoft)
Business Meeting
Tuesday 17:30-19:00
Location: Seacliffs
- Chair's Report - Donald Kossman
- Vice Chair's Report - Anastasia Ailamaki
- Secretary/Treasurer's Report - Magdalena Balazinska
- SIGMOD General Chairs' report - Fatma Özcan and Georgia Koutrika
- PODS General Chair's Report - Tova Milo
- SIGMOD PC Chair's Report – Samuel Madden
- Advertisement for SIGMOD 2017 - Rada Chirkova and Jun Yang
