About: Construction of Tree-based Indexes for Level-Contiguous Buffering Support

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

About: Construction of Tree-based Indexes for Level-Contiguous Buffering Support 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
Description	In multimedia databases, the spatial index structures based on trees (like R-tree, M-tree) have been proved to be efficient and scalable for low-dimensional data retrieval. However, if the data dimensionality is too high, the hierarchy of nested regions (represented by the tree nodes) becomes spatially indistinct. Hence, the query processing deteriorates to inefficient index traversal (in terms of random-access I/O costs) and in such case the tree-based indexes are less efficient than the sequential search. This is mainly due to repeated access to many nodes at the top levels of the tree. In this paper we propose a modified storage layout of tree-based indexes, such that nodes belonging to the same tree level are stored together. In multimedia databases, the spatial index structures based on trees (like R-tree, M-tree) have been proved to be efficient and scalable for low-dimensional data retrieval. However, if the data dimensionality is too high, the hierarchy of nested regions (represented by the tree nodes) becomes spatially indistinct. Hence, the query processing deteriorates to inefficient index traversal (in terms of random-access I/O costs) and in such case the tree-based indexes are less efficient than the sequential search. This is mainly due to repeated access to many nodes at the top levels of the tree. In this paper we propose a modified storage layout of tree-based indexes, such that nodes belonging to the same tree level are stored together. (en)
Title	Construction of Tree-based Indexes for Level-Contiguous Buffering Support Construction of Tree-based Indexes for Level-Contiguous Buffering Support (en)
skos:prefLabel	Construction of Tree-based Indexes for Level-Contiguous Buffering Support Construction of Tree-based Indexes for Level-Contiguous Buffering Support (en)
skos:notation	RIV/00216208:11320/07:00206189!RIV10-GA0-11320___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/06/0756), P(GP201/05/P036), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Skopal, Tomáš Hoksza, David Pokorný, Jaroslav
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	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	414866
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/07:00206189
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Construction; Tree-based; Indexes; Level-Contiguous; Buffering; Support (en)
http://linked.open.../riv/klicoveSlovo	Support Level-Contiguous Tree-based Construction Indexes Buffering
http://linked.open...ontrolniKodProRIV	[39783B9DA7C4]
http://linked.open...v/mistoKonaniAkce	New Delhi, India
http://linked.open...i/riv/mistoVydani	New Delhi, India
http://linked.open...i/riv/nazevZdroje	13th International Conference on Database Systems for Advance Applications
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Development of a native storage for XML data Efficient metric search in large multimedia databases
http://linked.open...UplatneniVysledku	2007
http://linked.open...iv/tvurceVysledku	Skopal, Tomáš Pokorný, Jaroslav Hoksza, David
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000246173300032
http://linked.open.../riv/zahajeniAkce	2007-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	13 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-540-78567-5
http://localhost/t...ganizacniJednotka	11320

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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software