About: On M-tree Variants in Metric and Non-metric Spaces

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

About: On M-tree Variants in Metric and Non-metric Spaces 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	Although there have been many metric access methods (MAMs) developed so far to solve the problem of similarity searching, there is still big need for gapping retrieval efficiency. One of the most acceptable MAMs is M-tree which meets the essential features important for large, persistent and dynamic databases. M-tree’s retrieval inefficiency is hidden in overlaps of its regions, therefore, its overlaps should be as small as possible. Slim-tree [Traina Jr. et al., 2000] (the M-tree variant), solves this problem by post-processing slim-down algorithm which is too expensive. We briefly mention our new reinserting algorithm which is dynamic with acceptable construction costs and which reorganizes efficiently index. Another approach how to improve similarity searching has been introduced with the TriGen algorithm [Skopal, 2006] which enables MAMs to perform also non-metric similarity search or faster approximate search. With the TriGen, far more problems of similarity searching can be solved by MAMs becaus Although there have been many metric access methods (MAMs) developed so far to solve the problem of similarity searching, there is still big need for gapping retrieval efficiency. One of the most acceptable MAMs is M-tree which meets the essential features important for large, persistent and dynamic databases. M-tree’s retrieval inefficiency is hidden in overlaps of its regions, therefore, its overlaps should be as small as possible. Slim-tree [Traina Jr. et al., 2000] (the M-tree variant), solves this problem by post-processing slim-down algorithm which is too expensive. We briefly mention our new reinserting algorithm which is dynamic with acceptable construction costs and which reorganizes efficiently index. Another approach how to improve similarity searching has been introduced with the TriGen algorithm [Skopal, 2006] which enables MAMs to perform also non-metric similarity search or faster approximate search. With the TriGen, far more problems of similarity searching can be solved by MAMs becaus (en) Varianty M-stromu v metrických a nemetrických prostorech (cs)
Title	On M-tree Variants in Metric and Non-metric Spaces On M-tree Variants in Metric and Non-metric Spaces (en) Varianty M-stromu v metrických a nemetrických prostorech (cs)
skos:prefLabel	On M-tree Variants in Metric and Non-metric Spaces On M-tree Variants in Metric and Non-metric Spaces (en) Varianty M-stromu v metrických a nemetrických prostorech (cs)
skos:notation	RIV/00216208:11320/08:00101285!RIV09-AV0-11320___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1ET100300419), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2009
http://linked.open...aciTvurceVysledku	Lokoč, Jakub
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	384633
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/08:00101285
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	M-tree; Variants; Metric; Non-metric; Spaces (en)
http://linked.open.../riv/klicoveSlovo	Metric Variants Spaces Non-metric M-tree
http://linked.open...ontrolniKodProRIV	[401B340A7A6D]
http://linked.open...v/mistoKonaniAkce	Praha
http://linked.open...i/riv/mistoVydani	Praha
http://linked.open...i/riv/nazevZdroje	WDS'08 Proceedings of Contributed Papers: Part I - Mathematics and Computer Sciences
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization)
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Lokoč, Jakub
http://linked.open...vavai/riv/typAkce	CST - Celostátní
http://linked.open.../riv/zahajeniAkce	2008-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	5 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Matfyzpress
https://schema.org/isbn	978-80-7378-065-4
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