About: M-tree

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: M-tree Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatDatabaseIndexTechniques, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/4CdZuufAH4

In computer science, M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle inequality for efficient range and k-nearest neighbor (k-NN) queries.While M-trees can perform well in many conditions, the tree can also have large overlap and there is no clear strategy on how to best avoid overlap. In addition, it can only be used for distance functions that satisfy the triangle inequality, while many advanced dissimilarity functions used in information retrieval do not satisfy this.

Attributes	Values
rdf:type	yago:Ability105616246 yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:Know-how105616786 yago:Method105660268 yago:PsychologicalFeature100023100 yago:WikicatGeometricDataStructures building yago:Structure105726345 yago:Technique105665146 yago:WikicatDataStructures yago:WikicatDatabaseIndexTechniques
rdfs:label	M-tree (it) M-tree (en)
rdfs:comment	In computer science, M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle inequality for efficient range and k-nearest neighbor (k-NN) queries.While M-trees can perform well in many conditions, the tree can also have large overlap and there is no clear strategy on how to best avoid overlap. In addition, it can only be used for distance functions that satisfy the triangle inequality, while many advanced dissimilarity functions used in information retrieval do not satisfy this. (en) Un M-tree o albero M in informatica è una struttura dati ad albero simile agli alberi R-tree e B-albero. È costruito usando una metrica e si affida alla disuguaglianza triangolare per l'intervallo di efficienza e per le interrogazioni k-NN.Mentre gli alberi M-tree possono essere usati in tante situazioni, l'albero può avere grandi sovrapposizioni e non c'è una chiara strategia su quale sia il modo migliore per evitare le sovrapposizioni.Può essere usato solamente con funzioni di distanza che soddisfano la disuguaglianza triangolare, mentre altre funzioni di dissimilarità avanzate usate nel recupero di informazioni non possono essere usate. (it)
foaf:depiction
dct:subject	Geometric data structures Trees (data structures) Database index techniques
Wikipage page ID	27481099 (xsd:integer)
Wikipage revision ID	1092209376 (xsd:integer)
Link from a Wikipage to another Wikipage	Information retrieval Interval tree R-tree Bounding volume hierarchy Tree data structure Computer science B-tree Geometric data structures Triangle inequality Trees (data structures) K-nearest neighbor algorithm Database index techniques Spatial index Segment tree Metric (mathematics) GiST Distance function
sameAs	M-tree M-tree M-tree M-tree M-tree
dbp:wikiPageUsesTemplate	dbt:CS-Trees dbt:Mvar dbt:Portal_bar dbt:Reflist dbt:Short_description dbt:Technical dbt:Tmath dbt:Algorithm-begin dbt:Algorithm-end
thumbnail	wiki-commons:Special:FilePath/M-tree_built_with_MMRad_split.png?width=300
has abstract	In computer science, M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle inequality for efficient range and k-nearest neighbor (k-NN) queries.While M-trees can perform well in many conditions, the tree can also have large overlap and there is no clear strategy on how to best avoid overlap. In addition, it can only be used for distance functions that satisfy the triangle inequality, while many advanced dissimilarity functions used in information retrieval do not satisfy this. (en) Un M-tree o albero M in informatica è una struttura dati ad albero simile agli alberi R-tree e B-albero. È costruito usando una metrica e si affida alla disuguaglianza triangolare per l'intervallo di efficienza e per le interrogazioni k-NN.Mentre gli alberi M-tree possono essere usati in tante situazioni, l'albero può avere grandi sovrapposizioni e non c'è una chiara strategia su quale sia il modo migliore per evitare le sovrapposizioni.Può essere usato solamente con funzioni di distanza che soddisfano la disuguaglianza triangolare, mentre altre funzioni di dissimilarità avanzate usate nel recupero di informazioni non possono essere usate. (it)
gold:hypernym	Structures
prov:wasDerivedFrom	wikipedia-en:M-tree?oldid=1092209376&ns=0
page length (characters) of wiki page	11061 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:M-tree
is Link from a Wikipage to another Wikipage of	List of data structures Metric tree Bounding volume hierarchy ELKI Ball tree Spatial database
is foaf:primaryTopic of	wikipedia-en:M-tree

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 53 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software