default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadim Baca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Radim Baca:
Window Function Expression: Let the Self-join Enter. Proc. VLDB Endow. 17(9): 2162-2174 (2024)- 2021
- [j6]Petr Lukás
, Radim Baca, Michal Krátký, Tok Wang Ling:
Demythization of Structural XML Query Processing: Comparison of Holistic and Binary Approaches. IEEE Trans. Knowl. Data Eng. 33(4): 1439-1452 (2021) - 2020
- [c22]Petr Lukás, Radim Baca, Michal Krátký, Tok Wang Ling:
Demythization of Structural XML Query Processing: Comparison of Holistic and Binary Approaches (Extended Abstract). ICDE 2020: 2030-2031
2010 – 2019
- 2019
- [i3]Petr Lukás, Radim Baca, Michal Krátký:
RadegastXDB - Prototype of Native XML Database Management System: Technical Report. CoRR abs/1903.03761 (2019) - 2018
- [j5]Michal Krátký, Stanislav Misák, Petr Gajdos, Petr Lukas, Radim Baca, Peter Chovanec:
A Novel Method for Detection of Covered Conductor Faults in Medium Voltage Overhead Line Systems. IEEE Trans. Ind. Electron. 65(1): 543-552 (2018) - 2017
- [j4]Radim Baca, Michal Krátký, Irena Holubová, Martin Necaský, Tomás Skopal, Martin Svoboda, Sherif Sakr:
Structural XML Query Processing. ACM Comput. Surv. 50(5): 64:1-64:41 (2017) - [i2]Petr Lukás, Radim Baca, Michal Krátký:
Cooking Lightweight XML Query Processor with Binary Joins and Comparing it with Holistic Joins: Technical Report. CoRR abs/1703.09539 (2017) - 2015
- [j3]Radim Baca, Petr Lukas, Michal Krátký:
Cost-based holistic twig joins. Inf. Syst. 52: 21-33 (2015) - 2014
- [c21]Radim Baca, Peter Chovanec, Michal Krátký, Petr Lukas:
QuickDB - Yet Another Database Management System? DATESO 2014: 91-99 - 2013
- [j2]Radim Baca, Michal Krátký, Tok Wang Ling, Jiaheng Lu:
Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings. VLDB J. 22(3): 369-393 (2013) - [c20]Petr Lukas, Radim Baca, Michal Krátký:
QuickXDB: A Prototype of a Native XML DBMS. DATESO 2013: 36-47 - 2012
- [j1]Jirí Walder, Michal Krátký, Radim Baca, Jan Platos, Václav Snásel:
Fast decoding algorithms for variable-lengths codes. Inf. Sci. 183(1): 66-91 (2012) - [c19]Radim Baca, Michal Krátký:
XML query processing: efficiency and optimality. IDEAS 2012: 8-13 - 2011
- [c18]Radim Baca, David Bednar:
Flexible Cache for Database Management Systems. DATESO 2011: 146-152 - [c17]Michal Krátký, Radim Baca, David Bednar, Jirí Walder, Jiri Dvorský, Peter Chovanec:
Index-based n-gram extraction from large document collections. ICDIM 2011: 73-78 - [c16]Filip Krizka, Michal Krátký, Radim Baca, Peter Chovanec:
Multidimensional Implementation of Stream ADT. WAIM Workshops 2011: 103-112 - 2010
- [c15]Filip Krizka, Michal Krátký, Radim Baca:
On Support of Ordering in Multidimensional Data Structures. ADBIS (Local Proceedings) 2010: 165-179 - [c14]Filip Krizka, Michal Krátký, Radim Baca:
On Support of Ordering in Multidimensional Data Structures. ADBIS 2010: 575-578 - [c13]Radim Baca, Jirí Walder, Martin Pawlas, Michal Krátký:
Benchmarking the Compression of XML Node Streams. DASFAA Workshops 2010: 179-190 - [c12]Peter Chovanec, Michal Krátký, Radim Baca:
Optimization of Disk Accesses for Multidimensional Range Queries. DEXA (1) 2010: 358-367
2000 – 2009
- 2009
- [c11]Radim Baca, Michal Krátký:
TJDewey - On the Efficient Path Labeling Scheme Holistic Approach. DASFAA Workshops 2009: 6-20 - [c10]Radim Baca, Martin Pawlas:
Compression of the Stream Array Data Structure. DATESO 2009: 23-31 - [c9]Jirí Walder, Michal Krátký, Radim Baca:
Benchmarking Coding Algorithms for the R-tree Compression. DATESO 2009: 32-43 - [c8]Filip Krizka, Michal Krátký, Radim Baca:
Benchmarking a B-tree Compression Method. ITAT 2009: 37-43 - [c7]Jiri Dvorský, Jan Martinovic, Václav Snásel, Lukás Adamus, Michal Gacek, Radim Baca:
Analysis of biosignal with information retrieval methods. PDeS 2009: 167-171 - [c6]Radim Baca, Michal Krátký:
On the Efficiency of a Prefix Path Holistic Algorithm. XSym 2009: 25-32 - 2008
- [c5]Michal Krátký, Radim Baca:
Towards Cost-based Optimizations of Twig Content-based Queries. DATESO 2008 - [c4]Radim Baca, Michal Krátký:
A cost-based join selection for XML twig content-based queries. DataX@EDBT 2008: 13-20 - [c3]Radim Baca, Michal Krátký, Václav Snásel:
On the efficient search of an XML twig query in large DataGuide trees. IDEAS 2008: 149-158 - 2007
- [c2]Michal Krátký, Radim Baca, Václav Snásel:
On the Efficient Processing Regular Path Expressions of an Enormous Volume of XML Data. DEXA 2007: 1-12 - [i1]Radim Baca, Václav Snásel, Jan Platos, Michal Krátký, Eyas El-Qawasmeh:
The Fast Fibonacci Decompression Algorithm. CoRR abs/0712.0811 (2007) - 2006
- [c1]Michal Krátký, Radim Baca:
A Comparison of Element-based and Path-based Approaches to Indexing XML Data. DATESO 2006
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-22 19:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
