About: An Access Structure for Similarity Search in 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)

AttributesValues
rdf:type
Description
  • Similarity retrieval is an important paradigm for searching in environments where exact match has little meaning. Moreover, in order to enlarge the set of data types for which the similarity search can efficiently be performed, the mathematical notion of metric space provides a useful abstraction of similarity. In this paper, we present a novel access structure for similarity search in arbitrary metric spaces, called D-Index. D-Index supports easy insertions and deletions and bounded search costs for range queries with radius up to $\rho$. D-Index also supports disk memories, thus, it is able to deal with large archives. However, the partitioning principles employed in the D-Index are not very optimal since they produce high number of empty partitions. We propose several strategies of partitioning and, finally, compare them.
  • Similarity retrieval is an important paradigm for searching in environments where exact match has little meaning. Moreover, in order to enlarge the set of data types for which the similarity search can efficiently be performed, the mathematical notion of metric space provides a useful abstraction of similarity. In this paper, we present a novel access structure for similarity search in arbitrary metric spaces, called D-Index. D-Index supports easy insertions and deletions and bounded search costs for range queries with radius up to $\rho$. D-Index also supports disk memories, thus, it is able to deal with large archives. However, the partitioning principles employed in the D-Index are not very optimal since they produce high number of empty partitions. We propose several strategies of partitioning and, finally, compare them. (en)
  • Podobností hledání je důležité v prostředích, ve kterých hledání na přesnou shodu má malý význam. Pro zvýšení okruhu aplikovatelnosti podobnostního hledání se jako matematická abstrakce používá pojem metrického prostoru. V tomto článku popisujeme novou indexovou metodu pro podobnostní hledání nazvanou D-Index. D-Index vkládá a maže datové objekty s velmi nízkými náklady. Rozsahové dotazy s poloměrem menším než rho jsou řešeny v čase, který je shora omezený. D-Index také podporuje disková úložiště a tím je schopen pracovat i s velkými objemy dat, které překračují velikost vnitřní paměti. Protože metody pro dělení prostoru použité v D-Indexu nejsou příliš optimální a vytvářejí velké množství prázdných oblastí, navrhujeme několik metod dělení a porovnáváme je. (cs)
Title
  • Indexová struktura pro podobnostní hledání v metrických prostorech (cs)
  • An Access Structure for Similarity Search in Metric Spaces
  • An Access Structure for Similarity Search in Metric Spaces (en)
skos:prefLabel
  • Indexová struktura pro podobnostní hledání v metrických prostorech (cs)
  • An Access Structure for Similarity Search in Metric Spaces
  • An Access Structure for Similarity Search in Metric Spaces (en)
skos:notation
  • RIV/00216224:14330/04:00010798!RIV09-MSM-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM 143300004)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 554040
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/04:00010798
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • similarity search; access structure; metric space (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1775864EB1B3]
http://linked.open...v/mistoKonaniAkce
  • Berlin, Germany
http://linked.open...i/riv/mistoVydani
  • Berlin, Germany
http://linked.open...i/riv/nazevZdroje
  • Current Trends in Database Technology - EDBT 2004
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dohnal, Vlastislav
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000226132200013
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag. Heidelberg
https://schema.org/isbn
  • 3-540-23305-9
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 100 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software