The SCEAS System
Navigation Menu

Search the dblp DataBase


Michal Krátký: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michal Krátký, Jaroslav Pokorný, Václav Snásel
    Indexing XML Data with UB-trees. [Citation Graph (0, 0)][DBLP]
    ADBIS Research Communications, 2002, pp:155-164 [Conf]
  2. Tomás Skopal, Jaroslav Pokorný, Michal Krátký, Václav Snásel
    Revisiting M-Tree Building Principles. [Citation Graph (0, 0)][DBLP]
    ADBIS, 2003, pp:148-162 [Conf]
  3. Jiri Dvorský, Michal Krátký, Tomás Skopal, Václav Snásel
    Term Indexing in Information Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    Communications in Computing, 2003, pp:263-270 [Conf]
  4. Tomás Skopal, Václav Snásel, Michal Krátký, Vojtech Svátek
    Searching the Internet Using Topological Analysis of Web Pages. [Citation Graph (0, 0)][DBLP]
    Communications in Computing, 2003, pp:271-277 [Conf]
  5. Jiri Dvorský, Michal Krátký
    Multi-dimensional Sparse Matrix Storage. [Citation Graph (0, 0)][DBLP]
    DATESO, 2004, pp:152-161 [Conf]
  6. Michal Krátký, Marek Andrt
    On Efficient Part-match Querying of XML Data. [Citation Graph (0, 0)][DBLP]
    DATESO, 2004, pp:96-105 [Conf]
  7. Michal Krátký, Svatopluk Stolfa, Václav Snásel, Ivo Vondrák
    Efficient Searching in Large Inheritance Hierarchies. [Citation Graph (0, 0)][DBLP]
    DEXA, 2005, pp:940-952 [Conf]
  8. Michal Krátký, Jaroslav Pokorný, Václav Snásel
    Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML Data. [Citation Graph (0, 0)][DBLP]
    EDBT Workshops, 2004, pp:219-229 [Conf]
  9. Michal Krátký, Jaroslav Pokorný, Tomás Skopal, Václav Snásel
    The Geometric Framework for Exact and Similarity Querying XML Data. [Citation Graph (0, 0)][DBLP]
    EurAsia-ICT, 2002, pp:35-46 [Conf]
  10. Michal Krátký, Václav Snásel, Jaroslav Pokorný, Pavel Zezula
    Efficient Processing of Narrow Range Queries in Multi-dimensional Data Structures. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2006, pp:69-79 [Conf]
  11. Martin Labský, Vojtech Svátek, Ondrej Svab, Pavel Praks, Michal Krátký, Václav Snásel
    Information Extraction from HTML Product Catalogues: From Source Code and Images to RDF. [Citation Graph (0, 0)][DBLP]
    Web Intelligence, 2005, pp:401-404 [Conf]
  12. Tomás Skopal, Michal Krátký, Jaroslav Pokorný, Václav Snásel
    A new range query algorithm for Universal B-trees. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 2006, v:31, n:6, pp:489-511 [Journal]
  13. Michal Krátký, Radim Baca
    A Comparison of Element-based and Path-based Approaches to Indexing XML Data. [Citation Graph (0, 0)][DBLP]
    DATESO, 2006, pp:- [Conf]
  14. Michal Krátký, Radim Baca, Václav Snásel
    On the Efficient Processing Regular Path Expressions of an Enormous Volume of XML Data. [Citation Graph (0, 0)][DBLP]
    DEXA, 2007, pp:1-12 [Conf]

  15. On Support of Ordering in Multidimensional Data Structures. [Citation Graph (, )][DBLP]

  16. Workshop Organizers' Message. [Citation Graph (, )][DBLP]

  17. TJDewey - On the Efficient Path Labeling Scheme Holistic Approach. [Citation Graph (, )][DBLP]

  18. Benchmarking the Compression of XML Node Streams. [Citation Graph (, )][DBLP]

  19. Towards Cost-based Optimizations of Twig Content-based Queries. [Citation Graph (, )][DBLP]

  20. Optimization of Disk Accesses for Multidimensional Range Queries. [Citation Graph (, )][DBLP]

  21. On the efficient search of an XML twig query in large DataGuide trees. [Citation Graph (, )][DBLP]

  22. On the Efficiency of a Prefix Path Holistic Algorithm. [Citation Graph (, )][DBLP]

  23. The Fast Fibonacci Decompression Algorithm [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002