Michal Krátký
Michal Krátký
Department of Computer Science, VŠB - Technical University of Ostrava
Dirección de correo verificada de vsb.cz - Página principal
TítuloCitado porAńo
Revisiting M-tree building principles
T Skopal, J Pokorný, M Krátký, V Snášel
East European Conference on Advances in Databases and Information Systems …, 2003
532003
Implementation of XPath axes in the multi-dimensional approach to indexing XML data
M Krátký, J Pokorný, V Snášel
International Conference on Extending Database Technology, 219-229, 2004
412004
A new range query algorithm for universal B-trees
T Skopal, M Krátký, J Pokorný, V Snášel
Information Systems 31 (6), 489-511, 2006
362006
Information extraction from HTML product catalogues: from source code and images to RDF
M Labsky, V Svatek, O Svab, P Praks, M Kratky, V Snasel
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05 …, 2005
362005
Efficient processing of narrow range queries in the R-Tree
M Krátký, V Snášel, P Zezula, J Pokorný, T Skopal
Proceedings of the 10th International Database Engineering and Applications …, 2006
262006
Fast decoding algorithms for variable-lengths codes
J Walder, M Krátký, R Bača, J Platoš, V Snášel
Information sciences 183 (1), 66-91, 2012
252012
Analysis of distribution network failure databases
R Gono, M Kratky, S Rusek
Przeglad elektrotechniczny 86 (8), 168-171, 2010
252010
Indexing XML Data with UB-trees.
M Krátký, J Pokorný, V Snasel
ADBIS Research Communications, 155-164, 2002
242002
Reliability analysis of distribution networks
R Gono, S Rusek, M Kratky
2007 9th International Conference on Electrical Power Quality and …, 2007
182007
On the efficient search of an XML twig query in large DataGuide trees
R Bača, M Krátký, V Snášel
Proceedings of the 2008 international symposium on Database engineering …, 2008
172008
Multidimensional term indexing for efficient processing of complex queries
M Krátký, T Skopal, V Snášel
Kybernetika 40 (3), [381]-396, 2004
162004
Efficient processing of narrow range queries in multi-dimensional data structures
M Kratky, V Snasel, J Pokorny, P Zezula
2006 10th International Database Engineering and Applications Symposium …, 2006
152006
A framework for an analysis of failures data in electrical power networks
M Kratky, R Gono, S Rusek, J Dvorsky
Proc. PEA Conf. on Power, Energy, and Applications, Gaborone, BW 45, 46, 2006
142006
The geometric framework for exact and similarity querying XML data
M Krátký, J Pokorný, T Skopal, V Snášel
Eurasian Conference on Information and Communication Technology, 35-46, 2002
132002
Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings
R Baca, M Krátký, TW Ling, J Lu
The VLDB Journal—The International Journal on Very Large Data Bases 22 (3 …, 2013
122013
Benchmarking the compression of XML node streams
R Bača, J Walder, M Pawlas, M Krátký
International Conference on Database Systems for Advanced Applications, 179-190, 2010
102010
TJDewey–on the efficient path labeling scheme holistic approach
R Bača, M Krátký
International Conference on Database Systems for Advanced Applications, 6-20, 2009
102009
On the Efficiency of a prefix path holistic algorithm
R Bača, M Krátký
International XML Database Symposium, 25-32, 2009
92009
On the efficient processing regular path expressions of an enormous volume of XML data
M Krátký, R Bača, V Snášel
International Conference on Database and Expert Systems Applications, 1-12, 2007
92007
Benchmarking Coding Algorithms for the R-tree Compression.
J Walder, M Krátký, R Baca
DATESO, 32-43, 2009
82009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20