Matches in DBpedia 2014 for { <http://dbpedia.org/resource/M-tree> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- M-tree abstract "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-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.".
- M-tree thumbnail Mtree-2d.svg?width=300.
- M-tree wikiPageID "27481099".
- M-tree wikiPageRevisionID "596136766".
- M-tree hasPhotoCollection M-tree.
- M-tree subject Category:Database_index_techniques.
- M-tree subject Category:Geometric_data_structures.
- M-tree subject Category:Trees_(data_structures).
- M-tree type Ability105616246.
- M-tree type Abstraction100002137.
- M-tree type Arrangement105726596.
- M-tree type Cognition100023271.
- M-tree type DataStructure105728493.
- M-tree type DatabaseIndexTechniques.
- M-tree type GeometricDataStructures.
- M-tree type Know-how105616786.
- M-tree type Method105660268.
- M-tree type PsychologicalFeature100023100.
- M-tree type Structure105726345.
- M-tree type Technique105665146.
- M-tree comment "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-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.".
- M-tree label "M-tree".
- M-tree label "M-tree".
- M-tree sameAs M-tree.
- M-tree sameAs m.0c015tr.
- M-tree sameAs Q3841143.
- M-tree sameAs Q3841143.
- M-tree sameAs M-tree.
- M-tree wasDerivedFrom M-tree?oldid=596136766.
- M-tree depiction Mtree-2d.svg.
- M-tree isPrimaryTopicOf M-tree.
