Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Priority_R-tree> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples 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 wikiPageLength "2253".
- Priority_R-tree wikiPageOutDegree "13".
- Priority_R-tree wikiPageRevisionID "702704298".
- Priority_R-tree wikiPageWikiLink B-tree.
- Priority_R-tree wikiPageWikiLink Bounding_volume_hierarchy.
- Priority_R-tree wikiPageWikiLink Category:Database_index_techniques.
- Priority_R-tree wikiPageWikiLink Category:R-tree.
- Priority_R-tree wikiPageWikiLink K-d_tree.
- Priority_R-tree wikiPageWikiLink Point_(geometry).
- Priority_R-tree wikiPageWikiLink Query.
- Priority_R-tree wikiPageWikiLink R-tree.
- Priority_R-tree wikiPageWikiLink Spatial_database.
- Priority_R-tree wikiPageWikiLink Tree_(data_structure).
- Priority_R-tree wikiPageWikiLink Worst-case_complexity.
- Priority_R-tree wikiPageWikiLinkText "Priority R-tree".
- Priority_R-tree wikiPageUsesTemplate Template:CS_trees.
- Priority_R-tree wikiPageUsesTemplate Template:Datastructure-stub.
- Priority_R-tree subject Category:Database_index_techniques.
- Priority_R-tree subject Category:R-tree.
- Priority_R-tree type Redirect.
- Priority_R-tree type Structure.
- Priority_R-tree type Technique.
- 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 Q7245465.
- Priority_R-tree sameAs m.04nvb29.
- Priority_R-tree sameAs Q7245465.
- Priority_R-tree wasDerivedFrom Priority_R-tree?oldid=702704298.
- Priority_R-tree isPrimaryTopicOf Priority_R-tree.