I was in Chicago to meet with colleagues from the Graph Query Language task force at the Linked Data Benchmark Council (LDBC) so we could have an impromptu face-to-face meeting (great progress towards our graph query language proposal!). They were in Chicago attending one of the main academic database conferences: SIGMOD/PODS. I was able to take a quick look at papers, demos and tutorials.
Example 1 of overlapping #Database/#SemanticWeb research. Similar idea to Linked Data fragments cc @olafhartig @RubenVerborgh pic.twitter.com/V5iEL9Ctzs
— Juan Sequeda (@juansequeda) May 18, 2017
Example 2 of overlapping #Database/#SemanticWeb research: Serving queries on compressed graphs similar to RDF HDT cc @AxelPolleres pic.twitter.com/LY651mnZiw
— Juan Sequeda (@juansequeda) May 18, 2017
Another example of #Database/#SemanticWeb overlap https://t.co/3NZSbxU7gj
— Juan Sequeda (@juansequeda) May 19, 2017
An example of #Database/#SemanicWeb interaction https://t.co/ZIyrHtwpmJ
— Juan Sequeda (@juansequeda) May 19, 2017
If you go to two conferences of your field in a year, consider swapping one conference to attend another conference in a different field. For example, for the Semantic Web community, if you attend ISWC and ESWC, consider swapping one of those to attend SIGMOD or VLDB. Same for the database community. VLDB 2017 will be in Munich from August 28th to September 1, 2017.
PODS Papers
- JSON: Data model, Query languages and Schema specification
- J-Logic: Logical Foundations for JSON Querying
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment (Best paper award)
- The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries
- Conjunctive Queries on Probabilistic Graphs: Combined Complexity
- Stable Model Semantics for Tuple-Generating Dependencies Revisited
- Schema Mappings for Data Graphs
- Dependencies for Graphs
SIGMOD Papers
- Landmark Indexing for Evaluation of Label-Constrained Reachability Queries
- Efficient Ad-Hoc Graph Inference and Matching in Biological Databases
- DAG Reduction: Fast Answering Reachability Queries
- Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs
- Interactive Mapping Specification with Exemplar Tuples
- Foofah: Transforming Data By Example
- Extracting and Analyzing Hidden Graphs from Relational Databases
- TrillionG: A Trillion-scale Synthetic Graph Generator using a Recursive Vector Model
- Synthesizing Mapping Relationships Using Table Corpus
- Waldo: An Adaptive Human Interface for Crowd Entity Resolution
- ZipG: A Memory-efficient Graph Store for Interactive Queries (seems similar to RDF HDT)
- All-in-One: Graph Processing in RDBMSs Revisited
- Online Deduplication for Databases
SIGMOD Demos
- Visual Graph Query Construction and Refinement
- A Demonstration of Lusail: Querying Linked Data at Scale
- Foofah: A Programming-By-Example System for Synthesizing Data Transformation Programs
- In-Browser Interactive SQL Analytics with Afterburner (seems similar to Linked Data Fragments)
- Generating Concise Entity Matching Rules
- A Demo of the Data Civilizer System
- Graph Data Mining with Arabesque
- DBridge: Translating Imperative Code to SQL
- Safe Visual Data Exploration
- Graphflow: An Active Graph Database
- Demonstration: MacroBase, A Fast Data Analysis Engine
SIGMOD Tutorials
- Graph Querying Meets HCI: State of the Art and Future Directions
- Graph Exploration: From Users to Large Graphs
- Building Structured Databases of Factual Knowledge from Massive Text Corpora
P.S. For the travel and points geeks. Last minute travel to Chicago was really expensive. Over $500 USD. I was able to use 25000 miles and pay just $10 USD. And I even got upgraded to first class!