Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Sebastian Breß"'
Autor:
Gábor E. Gévay, Tilmann Rabl, Sebastian Breß, Loránd Madai-Tahy, Jorge-Arnulfo Quiané-Ruiz, Volker Markl
Publikováno v:
ACM SIGMOD Record. 51:60-67
Modern data analysis tasks often involve control flow statements, such as the iterations in PageRank and K-means. To achieve scalability, developers usually implement these tasks in distributed dataflow systems, such as Spark and Flink. Designers of
Publikováno v:
ACM Computing Surveys. 55:1-38
Due to their high computational power and internal memory bandwidth, graphic processing units (GPUs) have been extensively studied by the database systems research community. A heterogeneous query processing system that employs CPUs and GPUs at the s
Autor:
Sebastian Breß, Volker Markl, Alejandro Rodriguez Cuellar, Asterios Katsifodimos, Tilmann Rabl, Jonas Traub, Philipp M. Grulich
Publikováno v:
ACM Transactions on Database Systems. 46:1-46
Window aggregation is a core operation in data stream processing. Existing aggregation techniques focus on reducing latency, eliminating redundant computations, or minimizing memory usage. However, each technique operates under different assumptions
Publikováno v:
Proceedings of the 2022 International Conference on Management of Data.
Publikováno v:
Proceedings of the VLDB Endowment. 14:281-293
Sketching algorithms are a powerful tool for single-pass data summarization. Their numerous applications include approximate query processing, machine learning, and large-scale network monitoring. In the presence of high-bandwidth interconnects or in
Publikováno v:
ACM SIGMOD Record. 47:23-28
Data management systems research at TU Berlin is spearheaded by the Database Systems and Information Management (DIMA) Group, the Big Data Management (Big- DaMa) Group, as well as the affiliated Intelligent Analytics for Massive Data (IAM) Research G
Autor:
Sebastian Breß, Tilmann Rabl, Volker Markl, Gábor E. Gévay, Jorge-Arnulfo Quiané-Ruiz, Lorand Madai-Tahy
Publikováno v:
ICDE
Modern data analysis tasks often involve control flow statements, such as iterations. Common examples are PageRank and K-means. To achieve scalability, developers usually implement data analysis tasks in distributed dataflow systems, such as Spark an
Publikováno v:
SIGMOD Conference
GPUs have long been discussed as accelerators for database query processing because of their high processing power and memory bandwidth. However, two main challenges limit the utility of GPUs for large-scale data processing: (1) the on-board memory c
Publikováno v:
Datenbank-Spektrum
k-Means is a versatile clustering algorithm widely used in practice. To cluster large data sets, state-of-the-art implementations use GPUs to shorten the data to knowledge time. These implementations commonly assign points on a GPU and update centroi
Publikováno v:
Proceedings of the VLDB Endowment. 10:2085-2096
Accurately predicting the cardinality of intermediate plan operations is an essential part of any modern relational query optimizer. The accuracy of said estimates has a strong and direct impact on the quality of the generated plans, and incorrect es