Back to authors
Sebastian Breß
- Author ID
- 1639
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Technical University of Berlin
- Pagerank
- 0.11084608
- Overall Rank
- 584 | 97.23%
- Paper Count
- 13
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 13 of 13 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 1,574 |
Pipelined Query Processing in Coprocessor Environments |
2018 |
SIGMOD |
0.00010321274 |
| 2,203 |
Estimating Join Selectivities using Bandwidth-Optimized Kernel Density Models |
2017 |
VLDB |
8.9610447e-05 |
| 2,239 |
An Intermediate Representation for Optimizing Machine Learning Pipelines |
2019 |
VLDB |
8.8875753e-05 |
| 2,566 |
Pump Up the Volume: Processing Large Data on GPUs with Fast Interconnects |
2020 |
SIGMOD |
8.4116562e-05 |
| 2,713 |
Robust Query Processing in Co-Processor-accelerated Databases |
2016 |
SIGMOD |
8.2122726e-05 |
| 3,178 |
Why it is time for a HyPE: A Hybrid Query Processing Engine for Efficient GPU Coprocessing in DBMS |
2013 |
VLDB |
7.6630901e-05 |
| 3,851 |
Analyzing Efficient Stream Processing on Modern Hardware |
2019 |
VLDB |
7.0735328e-05 |
| 4,535 |
Triton Join: Efficiently Scaling to a Large Join State on GPUs with Fast Interconnects |
2022 |
SIGMOD |
6.6419266e-05 |
| 5,092 |
Ocelot/HyPE: Optimized Data Processing on Heterogeneous Hardware |
2014 |
VLDB |
6.3669454e-05 |
| 5,215 |
The NebulaStream Platform: Data and Application Management for the Internet of Things |
2020 |
CIDR |
6.3124972e-05 |
| 6,349 |
Grizzly: Efficient Stream Processing Through Adaptive Query Compilation |
2020 |
SIGMOD |
5.9049304e-05 |
| 8,846 |
Workload Insights From The Snowflake Data Cloud: What Do Production Analytic Queries Really Look Like? |
2025 |
VLDB |
5.3580184e-05 |
| 8,878 |
Scotch: Generating FPGA-Accelerators for Sketching at Line Rate |
2021 |
VLDB |
5.3532614e-05 |
Frequent Co-authors
Co-authored at least 5 papers.