All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Compression of a Set of Files with Natural Language Content

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00218065" target="_blank" >RIV/68407700:21240/15:00218065 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1093/comjnl/bxu046" target="_blank" >http://dx.doi.org/10.1093/comjnl/bxu046</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1093/comjnl/bxu046" target="_blank" >10.1093/comjnl/bxu046</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Compression of a Set of Files with Natural Language Content

  • Original language description

    An algorithm for very efficient compression of a set of natural language text files is presented. Not only a very good compression ratio is reached, the used compression method allows fast pattern matching in compressed text, which is an attractive property especially for search engines. Much information is stored in the form of a large collection of text files. The web search engines can store the web pages in the raw text form to build so-called snippets or to perform so-called positional ranking functions on them. Furthermore, there exist many other similar contexts such as the storage of emails, application logs or the databases of text files (literary works or technical reports). In this paper, we address the problem of the compression of a largecollection of text files distributed in cluster of computers, where the single files need to be randomly accessed in very short time. The compression algorithm is based on a word-based approach and the idea of combination of two statistic

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA13-03253S" target="_blank" >GA13-03253S: Text and Tree Structures Processing and Their Applications</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Computer Journal

  • ISSN

    0010-4620

  • e-ISSN

  • Volume of the periodical

    58

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    17

  • Pages from-to

    1169-1185

  • UT code for WoS article

    000359139000010

  • EID of the result in the Scopus database

    2-s2.0-84929464949