Advances in Database Research 5
News
- Kickoff meeting Thursday, Oct 12, 14:00, SR T06. The attendance of the kickoff meeting is compulsory.
-
This seminar can be accredited as
- Seminar aus Informatik (Master Informatik 2016, Pflichtmodul P2 "Software Vertiefung") or as
- Seminar in Computer Science (Master Computer Science 2023, Mandatory Module P2, "Software in Depth").
General
Questions and discussions
For questions and discussions (also among students) regarding course specific topics please use the Slack channel #advances-in-database-research (Workspace dbteaching.slack.com).
Slack registration: Students register with their university email here: https://dbteaching.slack.com/signup
Procedure and Evaluation
The seminar consists of presentations given bei the students and discussions on the presentations.
Presentations: The students choose a current research paper (from a given list), which they prepare and present during the seminar. The presentation should be very detailed and didactically well prepared. Students should not just recite the explanations in the research paper, but acquire the necessary background knowledge and build their own understanding. Students should be able to respond to detailed questions and create and solve examples on their own.
Discussion: students listen to presentations by fellow students and young researchers and engage with the content in discussions.
The quality of the presentation, the participation in the discussions, and the quality of the contributions to the discussion will be evaluated.
Research Papers
The papers are grouped by topic.
Semantic and Syntactic Token Matching
- Dong Deng, Albert Kim, Samuel Madden, Michael Stonebraker: SilkMoth: An Efficient Method for Finding Related Sets with Maximum Matching Constraints. Proc. VLDB Endow. 10(10): 1082-1093 (2017)
- Yeye He, Kris Ganjam, Xu Chu: SEMA-JOIN: Joining Semantically-Related Tables Using Big Table Corpora. Proc. VLDB Endow. 8(12): 1358-1369 (2015)
- Chuan Xiao, Wei Wang, Xuemin Lin, Haichuan Shang: Top-k Set Similarity Joins. ICDE 2009: 916-927
- Pei Wang, Chuan Xiao, Jianbin Qin, Wei Wang, Xiaoyang Zhang, Yoshiharu Ishikawa: Local Similarity Search for Unstructured Text. SIGMOD Conference 2016: 1991-2005
Data Processing Using Fast Networks
- Wolf Rödiger, Tobias Mühlbauer, Alfons Kemper, Thomas Neumann: High-Speed Query Processing over High-Speed Networks. Proc. VLDB Endow. 9(4): 228-239 (2015)
- Claude Barthels, Simon Loesing, Gustavo Alonso, Donald Kossmann: Rack-Scale In-Memory Join Processing using RDMA. SIGMOD Conference 2015: 1463-1475
- Carsten Binnig, Andrew Crotty, Alex Galakatos, Tim Kraska, Erfan Zamanian: The End of Slow Networks: It's Time for a Redesign. Proc. VLDB Endow. 9(7): 528-539 (2016)
- Li et al., Accelerating Relational Databases by Leveraging Remote Memory and RDMA - SIGMOD 2016
- Taranov et al., CoRM: Compactable Remote Memory over RDMA - SIGMOD 2021
- Wang, et al., Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory - SIGMOD 2022
- Tobias Ziegler, Jacob Nelson-Slivon, Viktor Leis, Carsten Binnig: Design Guidelines for Correct, Efficient, and Scalable Synchronization using One-Sided RDMA. Proc. ACM Manag. Data 1(2): 131:1-131:26 (2023)
Multi-Core and Main-Memory Database Systems
- Boncz et al., MonetDB/X100: Hyper-Pipelining Query Execution - CIDR 2005
- Abadi et al., Column-Stores vs. Row-Stores: How Different Are They Really? - SIGMOD 2008
- Leis et al., Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age - SIGMOD 2014
- Timo Kersten, Viktor Leis, Alfons Kemper, Thomas Neumann, Andrew Pavlo, Peter Boncz: Everything You Always Wanted to Know About Compiled and Vectorized Queries But Were Afraid to Ask. Proc. VLDB Endow. 11(13): 2209-2222 (2018)
- Robert Binna, Eva Zangerle, Martin Pichl, Günther Specht, Viktor Leis: HOT: A Height Optimized Trie Index for Main-Memory Database Systems. SIGMOD Conference 2018: 521-534
Graph Edit Distance Bounds
- Zeng et al., 2009, Comparing stars on approximating graph edit distance
- Blumenthal and Gamper, 2018, Improved Lower Bounds for Graph Edit Distance
- Riesen et al., 2014, Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time
Process Mining
- Van Der Aalst, 2023, Object-Centric Process Mining: Unraveling the Fabric of Real Processes
- Fani Sani et al., 2020, Conformance Checking Approximation Using Subset Selection and Edit Distance
- Adam and van der Aalst, 2021, Precision and Fitness in Object-Centric Process Mining
Discovering JSON Schemas
- William Spoth, Oliver Kennedy, Ying Lu, Beda Hammerschmidt, Zhen Hua Liu: Reducing Ambiguity in JSON Schema Discovery. ACM SIGMOD (2021)
- Mohamed-Amine Baazizi, Houssem Ben Lahmar, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani: Schema inference for massive JSON datasets. Extending Database Technology (EDBT). (2017)
Schedule
Location: Seminar room T06
| Date | Time | Presenter | Titel |
|---|---|---|---|
| 2023-10-12 | 14:00-15:00 | Nikolaus Augsten | Kickoff meeting (compulsory) |
| 2023-12-07 | 14:00-16:00 | Samy Dafir | Efficient String Similarity Joins with the Jaro-Winkler Similarity Metric |
| 2023-12-14 | 14:00-16:00 | Manuel Widmoser | Design Guidelines for Correct, Efficient, and Scalable Synchronization using One-Sided RDMA (SIGMOD 2023) |
| 2023-12-21 | 14:00-15:00 | Bianca Löhnert | Answering Two-Way Regular Path Queries over Knowledge Bases |
| 2023-12-21 | 15:15-16:15 | Michael Peter Brunauer | Comparing stars: on approximating graph edit distance (VLDB 2009) |
| 2024-01-18 | 14:00-15:00 | Begüm Tosun | Everything You Always Wanted to Know About Compiled and Vectorized Queries But Were Afraid to Ask (VLDB 2018) |
| 2024-01-18 | 15:15-16:15 | Thomas Hütter | How to extract ‘high quality’ JSON schemas? |
| 2024-01-25 | 14:00-16:00 | Daniel Schmitt | InfiniFilter: Expanding Filters to Infinity and Beyond (SIGMOD 2023) |