Radim Bača
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Radim Bača has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Michal Krátký
Department of Computer Science Faculty of Electrical Engineering and Computer Science VSB Technical University of Ostrava
16 shared publications - Vaclav Snasel
VŚB-Technical University of Ostrava
4 shared publications Peter Chovanec
VŚB-Technical University of Ostrava
3 shared publicationsFilip Křižka
VŚB-Technical University of Ostrava
2 shared publications- Jiří Dvorský
VSB - Technical University of Ostrava
2 shared publications Jiří Walder
2 shared publications
Latest Publications
- Open Access
- 1 May 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 17 (9) , 2162-2174
Window Function Expression: Let the Self-Join Enter
Window function expressions (WFEs) became part of the SQL:2003 standard, and since then, they have often been implemented in database systems (DBS). They are especially essential to OLAP DBSs, and people use them daily. Even though WFEs are a heavily used part of the SQL language, the amount of research done on their optimization in the last two decades is not significant. WFE does not extend the expressive power of the SQL language, but it makes writing SQL queries easier and more transparent. DBSs always compile SQL queries with WFE using a sequence of partition-sort-compute operators, which we call a linear strategy. Plans resulting from the linear strategy are robust and, in many cases, efficient. This article introduces an alternative strategy using a self-join, which is not considered in the current DBSs. We call it the self-join strategy, and it is based on an SQL query transformation where the result query uses a self-join query plan to compute WFE. One output of this work is a tool that can automatically perform such SQL query transformations. We created a microbenchmark showing that the self-join strategy is more effective than the linear strategy in many cases. We also performed a cost-based experiment to evaluate the query optimizers' ability to select an appropriate strategy. The article's main aim is to show that usage of the self-join strategy for queries with WFE is beneficial if selected in a cost-based manner.
- 1 May 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 17 (9) , 2162-2174
Open AccessWindow Function Expression: Let the Self-Join Enter
Window function expressions (WFEs) became part of the SQL:2003 standard, and since then, they have often been implemented in database systems (DBS). They are especially essential to OLAP DBSs, and people use them daily. Even though WFEs are a heavily used part of the SQL language, the amount of research done on their optimization in the last two decades is not significant. WFE does not extend the expressive power of the SQL language, but it makes writing SQL queries easier and more transparent. DBSs always compile SQL queries with WFE using a sequence of partition-sort-compute operators, which we call a linear strategy. Plans resulting from the linear strategy are robust and, in many cases, efficient. This article introduces an alternative strategy using a self-join, which is not considered in the current DBSs. We call it the self-join strategy, and it is based on an SQL query transformation where the result query uses a self-join query plan to compute WFE. One output of this work is a tool that can automatically perform such SQL query transformations. We created a microbenchmark showing that the self-join strategy is more effective than the linear strategy in many cases. We also performed a cost-based experiment to evaluate the query optimizers' ability to select an appropriate strategy. The article's main aim is to show that usage of the self-join strategy for queries with WFE is beneficial if selected in a cost-based manner.
- Open Access
RadegastXDB - Prototype of Native XML Database Management System: Technical Report
A lot of advances in the processing of XML data have been proposed in last two decades. There were many approaches focused on the efficient processing of twig pattern queries (TPQ). However, including the TPQ into an XQuery compiler is not a straightforward task and current XML DBMSs process XQueries without any TPQ detection. In this paper, we demonstrate our prototype of a native XML DBMS called RadegastXDB that uses a TPQ detection to accelerate structural XQueries. Such a detection allows us to utilize state-of-the-art TPQ processing algorithms. Our experiments show that, for the structural queries, these algorithms and state-of-the-art XML indexing techniques make our prototype faster than all of the current XML DBMSs, especially for large data collections. We also show that using the same techniques is also efficient for the processing of queries with value predicates.
Open AccessRadegastXDB - Prototype of Native XML Database Management System: Technical Report
A lot of advances in the processing of XML data have been proposed in last two decades. There were many approaches focused on the efficient processing of twig pattern queries (TPQ). However, including the TPQ into an XQuery compiler is not a straightforward task and current XML DBMSs process XQueries without any TPQ detection. In this paper, we demonstrate our prototype of a native XML DBMS called RadegastXDB that uses a TPQ detection to accelerate structural XQueries. Such a detection allows us to utilize state-of-the-art TPQ processing algorithms. Our experiments show that, for the structural queries, these algorithms and state-of-the-art XML indexing techniques make our prototype faster than all of the current XML DBMSs, especially for large data collections. We also show that using the same techniques is also efficient for the processing of queries with value predicates.
- Open Access
- 26 September 2017
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 50 (5) , 1-41
Structural XML Query Processing
Since the boom in new proposals on techniques for efficient querying of XML data is now over and the research world has shifted its attention toward new types of data formats, we believe that it is crucial to review what has been done in the area to help users choose an appropriate strategy and scientists exploit the contributions in new areas of data processing. The aim of this work is to provide a comprehensive study of the state-of-the-art of approaches for the structural querying of XML data. In particular, we start with a description of labeling schemas to capture the structure of the data and the respective storage strategies. Then we deal with the key part of every XML query processing: a twig query join, XML query algebras, optimizations of query plans, and selectivity estimation of XML queries. To the best of our knowledge, this is the first work that provides such a detailed description of XML query processing techniques that are related to structural aspects and that contains information about their theoretical and practical features as well as about their mutual compatibility and general usability.
- 26 September 2017
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 50 (5) , 1-41
Open AccessStructural XML Query Processing
Since the boom in new proposals on techniques for efficient querying of XML data is now over and the research world has shifted its attention toward new types of data formats, we believe that it is crucial to review what has been done in the area to help users choose an appropriate strategy and scientists exploit the contributions in new areas of data processing. The aim of this work is to provide a comprehensive study of the state-of-the-art of approaches for the structural querying of XML data. In particular, we start with a description of labeling schemas to capture the structure of the data and the respective storage strategies. Then we deal with the key part of every XML query processing: a twig query join, XML query algebras, optimizations of query plans, and selectivity estimation of XML queries. To the best of our knowledge, this is the first work that provides such a detailed description of XML query processing techniques that are related to structural aspects and that contains information about their theoretical and practical features as well as about their mutual compatibility and general usability.
- 1 August 2015
- Published by Elsevier in Information Systems
- Vol. 52, 21-33
Cost-based holistic twig joins
- 1 August 2015
- Published by Elsevier in Information Systems
- Vol. 52, 21-33
Cost-based holistic twig joins
- 10 October 2012
- Published by Springer Nature in The VLDB Journal
- Vol. 22 (3) , 369-393
Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings
- 10 October 2012
- Published by Springer Nature in The VLDB Journal
- Vol. 22 (3) , 369-393
Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings
- Open Access
- 1 January 2012
- Published by Association for Computing Machinery (ACM)
- p. 8-13
XML query processing
- 1 January 2012
- Published by Association for Computing Machinery (ACM)
- p. 8-13
Open AccessXML query processing
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 103-112
Multidimensional Implementation of Stream ADT
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 103-112
Multidimensional Implementation of Stream ADT
- 1 January 2012
- Published by Elsevier in Information Sciences
- Vol. 183 (1) , 66-91
Fast decoding algorithms for variable-lengths codes
- 1 January 2012
- Published by Elsevier in Information Sciences
- Vol. 183 (1) , 66-91
Fast decoding algorithms for variable-lengths codes
- 1 September 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 73-78
Index-based n-gram extraction from large document collections
N-grams are applied in some applications searching in text documents, especially in cases when one must work with phrases, e.g. in plagiarism detection. N-gram is a sequence of n terms (or generally tokens) from a document. We get a set of n-grams by moving a floating window from the begin to the end of the document. During the extraction we must remove duplicate n-grams and we must store additional values to each n-gram type, e.g. n-gram type frequency for each document and so on, it depends on a query model used. Previous works utilize a sorting algorithm to compute the n-gram frequency. These approaches must handle a high number of the same n-grams resulting in high time and space overhead. Moreover, these techniques are often main-memory only, it means they must be executed for small or middle size collections. In this paper, we show an index-based method to the n-gram extraction for large collections. This method utilizes common data structures like B + -tree and Hash table. We show the scalability of our method by presenting experiments with the gigabytes collection.
- 1 September 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 73-78
Index-based n-gram extraction from large document collections
N-grams are applied in some applications searching in text documents, especially in cases when one must work with phrases, e.g. in plagiarism detection. N-gram is a sequence of n terms (or generally tokens) from a document. We get a set of n-grams by moving a floating window from the begin to the end of the document. During the extraction we must remove duplicate n-grams and we must store additional values to each n-gram type, e.g. n-gram type frequency for each document and so on, it depends on a query model used. Previous works utilize a sorting algorithm to compute the n-gram frequency. These approaches must handle a high number of the same n-grams resulting in high time and space overhead. Moreover, these techniques are often main-memory only, it means they must be executed for small or middle size collections. In this paper, we show an index-based method to the n-gram extraction for large collections. This method utilizes common data structures like B + -tree and Hash table. We show the scalability of our method by presenting experiments with the gigabytes collection.
- 1 January 2010
- Published by Springer Nature
- p. 575-578
On Support of Ordering in Multidimensional Data Structures
- 1 January 2010
- Published by Springer Nature
- p. 575-578
On Support of Ordering in Multidimensional Data Structures