About: Lossless R-tree compression using variable-length codes

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Lossless R-tree compression using variable-length codes Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5678116
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. (en)
Title	Lossless R-tree compression using variable-length codes Lossless R-tree compression using variable-length codes (en)
skos:prefLabel	Lossless R-tree compression using variable-length codes Lossless R-tree compression using variable-length codes (en)
skos:notation	RIV/61989100:27240/10:86077623!RIV13-GA0-27240___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA102/09/1842), P(GAP202/10/0573)
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Krátký, Michal Walder, Jiří Chovanec, Peter
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	268937
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/10:86077623
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Data structures, Decoding, Encoding, Indexes, Quantization, Query processing (en)
http://linked.open.../riv/klicoveSlovo	Data structures Decoding Encoding Indexes Query processing Quantization
http://linked.open...ontrolniKodProRIV	[602374590BF8]
http://linked.open...v/mistoKonaniAkce	London, England
http://linked.open...i/riv/mistoVydani	Londýn
http://linked.open...i/riv/nazevZdroje	International Conference for Internet Technology and Secured Transactions (ICITST), 2010
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Reliable Electric Power Network with Connected Alternative Power Sources Handling XML Data in Heterogeneous and Dynamic Environments
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Krátký, Michal Walder, Jiří Chovanec, Peter
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-11-08 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4244-8862-9
http://localhost/t...ganizacniJednotka	27240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software