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”

Lossless R-tree compression using variable-length codes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86077623" target="_blank" >RIV/61989100:27240/10:86077623 - isvavai.cz</a>

  • Result on the web

    <a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5678116" target="_blank" >http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5678116</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Lossless R-tree compression using variable-length codes

  • Original language description

    The R-tree is one of the most popular multidimensional data structure. This data structure bounds spatially near points in multidimensional rectangles and supports various types of queries, e.g. point and range queries. When a compression of the data structure is considered, we follow two objectives. The first objective is a smaller index file and the second one is a reduction of the query processing time. In this paper, we introduce a lossless R-tree compression using variable-length codes. Although variable-length codes are well known in the area of data compression, they have not been yet successfully applied in the case of the data structure compression. In this paper, we apply recently introduced fast decoding algorithms and we show that these codes provides more efficient query processing time than the lossless RLE or lossy quantization compressions. The proposed compression method saves 84% of the index file's size compared to the uncompressed R-tree.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2010

  • 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

  • Article name in the collection

    International Conference for Internet Technology and Secured Transactions (ICITST), 2010

  • ISBN

    978-1-4244-8862-9

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1-8

  • Publisher name

    IEEE

  • Place of publication

    Londýn

  • Event location

    London, England

  • Event date

    Nov 8, 2010

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article