- Databases
- Data Compression
- Graph Algorithms
- +۳ مورد دیگر
Prof. Dr. Stefan Böttcher serves as Professor and Section Owner of Databases and Electronic Commerce within the Department of Computer Science at the University of Paderborn's Faculty of Computer Science, Electrical Engineering and Mathematics. His office (F2.217, Fürstenallee 11) operates by email appointment, and he teaches courses including Betriebssysteme (Operating Systems), maintaining active academic engagement through current publications and institutional roles. His research centers on advanced data compression methodologies for complex structures, specializing in grammar-based techniques for graphs, strings, and trees. Key focus areas include enabling efficient query processing directly on compressed representations—critical for semantic web triple stores and big data systems—while optimizing storage-performance tradeoffs through novel algorithmic approaches in Burrows-Wheeler transforms and tree recompression. Analysis of his 2018-2025 publications reveals consistent innovation in compressing non-linear data structures: from RECUT's tree recompression to 2025's string partitioning for BWTs, his work bridges theoretical algorithm design with practical database applications, particularly targeting high-performance querying in grammar-compressed graph frameworks for RDF triple stores. Scientific Awards No awards documented in source materials Prof. Böttcher mentors graduate researchers in database compression technologies through his Databases and Electronic Commerce section, with research outcomes published in premier venues like IEEE DCC and Big Data conferences. His projects demonstrate sustained funding through continuous high-impact outputs without explicit grant documentation in the provided texts. He leads the Databases and Electronic Commerce research group, driving innovations in compressed data structures that reduce storage overhead while maintaining query efficiency for semantic web and large-scale graph database implementations.





