Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Priority_R-tree> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Priority_R-tree abstract "The Priority R-tree is a worst-case asymptotically optimal alternative to the spatial tree R-tree. It was first proposed by Arge, De Berg, Haverkort and Yi, K. in an article from 2004. The prioritized R-tree is essentially a hybrid between a k-dimensional tree and a r-tree in that it defines a given object's N-dimensional bounding volume (called Minimum Bounding Rectangles - MBR) as a point in N-dimensions, represented by the ordered pair of the rectangles. The term prioritized arrives from the introduction of four priority-leaves that represents the most extreme values of each dimensions, included in every branch of the tree. Before answering a window-query by traversing the sub-branches, the prioritized R-tree first checks for overlap in its priority nodes. The sub-branches are traversed (and constructed) by checking whether the least value of the first dimension of the query is above the value of the sub-branches. This gives access to a quick indexation by the value of the first dimension of the bounding box.".
- Priority_R-tree wikiPageID "33373595".
- Priority_R-tree wikiPageRevisionID "589457107".
- Priority_R-tree hasPhotoCollection Priority_R-tree.
- Priority_R-tree subject Category:Database_index_techniques.
- Priority_R-tree subject Category:R-tree.
- Priority_R-tree type Ability105616246.
- Priority_R-tree type Abstraction100002137.
- Priority_R-tree type Cognition100023271.
- Priority_R-tree type DatabaseIndexTechniques.
- Priority_R-tree type Know-how105616786.
- Priority_R-tree type Method105660268.
- Priority_R-tree type PsychologicalFeature100023100.
- Priority_R-tree type Technique105665146.
- Priority_R-tree comment "The Priority R-tree is a worst-case asymptotically optimal alternative to the spatial tree R-tree. It was first proposed by Arge, De Berg, Haverkort and Yi, K. in an article from 2004. The prioritized R-tree is essentially a hybrid between a k-dimensional tree and a r-tree in that it defines a given object's N-dimensional bounding volume (called Minimum Bounding Rectangles - MBR) as a point in N-dimensions, represented by the ordered pair of the rectangles.".
- Priority_R-tree label "Priority R-tree".
- Priority_R-tree sameAs m.04nvb29.
- Priority_R-tree sameAs Q7245465.
- Priority_R-tree sameAs Q7245465.
- Priority_R-tree sameAs Priority_R-tree.
- Priority_R-tree wasDerivedFrom Priority_R-tree?oldid=589457107.
- Priority_R-tree isPrimaryTopicOf Priority_R-tree.