default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Krátký
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j8]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
- [c39]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
- [j7]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
- [j6]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
- [j5]Radim Baca, Petr Lukas, Michal Krátký:
Cost-based holistic twig joins. Inf. Syst. 52: 21-33 (2015) - [c38]Roman Meca, Michal Krátký, Peter Chovanec, Filip Krizka:
Data Structures for Indexing Triple Table. DATESO 2015: 13-27 - 2014
- [c37]Radim Baca, Peter Chovanec, Michal Krátký, Petr Lukas:
QuickDB - Yet Another Database Management System? DATESO 2014: 91-99 - 2013
- [j4]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) - [c36]Petr Lukas, Radim Baca, Michal Krátký:
QuickXDB: A Prototype of a Native XML DBMS. DATESO 2013: 36-47 - [c35]Peter Chovanec, Michal Krátký:
On the efficiency of multiple range query processing in multidimensional data structures. IDEAS 2013: 14-27 - 2012
- [j3]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) - [c34]Pavel Bednár, Petr Gajdos, Michal Krátký, Peter Chovanec:
Processing of Range Query Using SIMD and GPU. ADBIS Workshops 2012: 13-25 - [c33]Radim Baca, Michal Krátký:
XML query processing: efficiency and optimality. IDEAS 2012: 8-13 - 2011
- [c32]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 - [c31]Filip Krizka, Michal Krátký, Radim Baca, Peter Chovanec:
Multidimensional Implementation of Stream ADT. WAIM Workshops 2011: 103-112 - 2010
- [c30]Filip Krizka, Michal Krátký, Radim Baca:
On Support of Ordering in Multidimensional Data Structures. ADBIS (Local Proceedings) 2010: 165-179 - [c29]Filip Krizka, Michal Krátký, Radim Baca:
On Support of Ordering in Multidimensional Data Structures. ADBIS 2010: 575-578 - [c28]Radim Baca, Jirí Walder, Martin Pawlas, Michal Krátký:
Benchmarking the Compression of XML Node Streams. DASFAA Workshops 2010: 179-190 - [c27]Jirí Walder, Michal Krátký, Jan Platos:
Fast Fibonacci Encoding Algorithm. DATESO 2010: 72-83 - [c26]Peter Chovanec, Michal Krátký, Radim Baca:
Optimization of Disk Accesses for Multidimensional Range Queries. DEXA (1) 2010: 358-367 - [c25]Peter Chovanec, Michal Krátký, Jirí Walder:
Lossless R-tree compression using variable-length codes. ICITST 2010: 1-8 - [c24]Filip Krizka, Michal Krátký:
On the efficient indexing of ordered multidimensional tuples. ICITST 2010: 1-8
2000 – 2009
- 2009
- [c23]Michal Krátký, Irena Mlynkova, Eric Pardede:
Workshop Organizers' Message. DASFAA Workshops 2009: 3 - [c22]Radim Baca, Michal Krátký:
TJDewey - On the Efficient Path Labeling Scheme Holistic Approach. DASFAA Workshops 2009: 6-20 - [c21]Jirí Walder, Michal Krátký, Radim Baca:
Benchmarking Coding Algorithms for the R-tree Compression. DATESO 2009: 32-43 - [c20]Peter Chovanec, Michal Krátký:
Efficiency Improvement of Narrow Range Query Processing in R-tree. DATESO 2009: 154-165 - [c19]Filip Krizka, Michal Krátký, Radim Baca:
Benchmarking a B-tree Compression Method. ITAT 2009: 37-43 - [c18]Radim Baca, Michal Krátký:
On the Efficiency of a Prefix Path Holistic Algorithm. XSym 2009: 25-32 - 2008
- [c17]Michal Krátký, Radim Baca:
Towards Cost-based Optimizations of Twig Content-based Queries. DATESO 2008 - [c16]Radim Baca, Michal Krátký:
A cost-based join selection for XML twig content-based queries. DataX@EDBT 2008: 13-20 - [c15]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
- [c14]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
- [j2]Tomás Skopal, Michal Krátký, Jaroslav Pokorný, Václav Snásel:
A new range query algorithm for Universal B-trees. Inf. Syst. 31(6): 489-511 (2006) - [c13]Michal Krátký, Radim Baca:
A Comparison of Element-based and Path-based Approaches to Indexing XML Data. DATESO 2006 - [c12]Michal Krátký, Václav Snásel, Jaroslav Pokorný, Pavel Zezula:
Efficient Processing of Narrow Range Queries in Multi-dimensional Data Structures. IDEAS 2006: 69-79 - 2005
- [c11]Michal Krátký, Svatopluk Stolfa, Václav Snásel, Ivo Vondrák:
Efficient Searching in Large Inheritance Hierarchies. DEXA 2005: 940-952 - [c10]Martin Labský, Vojtech Svátek, Ondrej Sváb, Pavel Praks, Michal Krátký, Václav Snásel:
Information Extraction from HTML Product Catalogues: From Source Code and Images to RDF. Web Intelligence 2005: 401-404 - 2004
- [j1]Michal Krátký, Tomás Skopal, Václav Snásel:
Multidimensional term indexing for efficient processing of complex queries. Kybernetika 40(3): 381-396 (2004) - [c9]Michal Krátký, Marek Andrt:
On Efficient Part-match Querying of XML Data. DATESO 2004: 96-105 - [c8]Jiri Dvorský, Michal Krátký:
Multi-dimensional Sparse Matrix Storage. DATESO 2004: 152-161 - [c7]Michal Krátký, Jaroslav Pokorný, Václav Snásel:
Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML Data. EDBT Workshops 2004: 219-229 - 2003
- [c6]Tomás Skopal, Jaroslav Pokorný, Michal Krátký, Václav Snásel:
Revisiting M-Tree Building Principles. ADBIS 2003: 148-162 - [c5]Jiri Dvorský, Michal Krátký, Tomás Skopal, Václav Snásel:
Term Indexing in Information Retrieval Systems. Communications in Computing 2003: 263-270 - [c4]Tomás Skopal, Václav Snásel, Michal Krátký, Vojtech Svátek:
Searching the Internet Using Topological Analysis of Web Pages. Communications in Computing 2003: 271-277 - 2002
- [c3]Michal Krátký, Jaroslav Pokorný, Václav Snásel:
Indexing XML Data with UB-trees. ADBIS Research Communications 2002: 155-164 - [c2]Michal Krátký, Jaroslav Pokorný, Tomás Skopal, Václav Snásel:
The Geometric Framework for Exact and Similarity Querying XML Data. EurAsia-ICT 2002: 35-46 - [c1]Tomás Skopal, Václav Snásel, Michal Krátký:
Image Recognition Using Finite Automata. Stringology 2002: 88-95
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-04-25 05:56 CEST 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:
