This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n20http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://localhost/temp/predkladatel/
n4http://purl.org/net/nknouf/ns/bibtex#
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/ontology/domain/vavai/
n22https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F10%3A86077623%21RIV13-GA0-27240___/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F10%3A86077623%21RIV13-GA0-27240___
rdf:type
skos:Concept n11:Vysledek
rdfs:seeAlso
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5678116
dcterms: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. 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.
dcterms:title
Lossless R-tree compression using variable-length codes Lossless R-tree compression using variable-length codes
skos:prefLabel
Lossless R-tree compression using variable-length codes Lossless R-tree compression using variable-length codes
skos:notation
RIV/61989100:27240/10:86077623!RIV13-GA0-27240___
n3:aktivita
n14:P
n3:aktivity
P(GA102/09/1842), P(GAP202/10/0573)
n3:dodaniDat
n19:2013
n3:domaciTvurceVysledku
n6:9614389 n6:9623450 Chovanec, Peter
n3:druhVysledku
n18:D
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
268937
n3:idVysledku
RIV/61989100:27240/10:86077623
n3:jazykVysledku
n15:eng
n3:klicovaSlova
Data structures, Decoding, Encoding, Indexes, Quantization, Query processing
n3:klicoveSlovo
n7:Query%20processing n7:Indexes n7:Data%20structures n7:Encoding n7:Decoding n7:Quantization
n3:kontrolniKodProRIV
[602374590BF8]
n3:mistoKonaniAkce
London, England
n3:mistoVydani
Londýn
n3:nazevZdroje
International Conference for Internet Technology and Secured Transactions (ICITST), 2010
n3:obor
n16:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n12:GAP202%2F10%2F0573 n12:GA102%2F09%2F1842
n3:rokUplatneniVysledku
n19:2010
n3:tvurceVysledku
Chovanec, Peter Walder, Jiří Krátký, Michal
n3:typAkce
n20:WRD
n3:zahajeniAkce
2010-11-08+01:00
s:numberOfPages
8
n4:hasPublisher
IEEE
n22:isbn
978-1-4244-8862-9
n21:organizacniJednotka
27240