Talk:R-tree

This article is within the scope of WikiProject Databases, a project which is currently considered to be inactive.DatabasesWikipedia:WikiProject DatabasesTemplate:WikiProject DatabasesDatabases articles

Computer science Mid‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Linear data?

I don't like the use of the term 'linear data' because although the meaning 'like a line' is accurate, it also means something different in mathematics. I propose something like 'scalar data' instead. Effervecent (talk) 11:36, 6 October 2023 (UTC)[reply]

Priority R-Tree

I think the priority R-trees would fit more into r-tree bulk-loading algorihms. As I understand the PR-tree it is very good variant of bulk-loading algorithm.— Preceding unsigned comment added by 212.47.3.98 (talk) 12:41, 7 July 2006

Yes, as I understand it, it is bulk loading only. So I moved it there. --Chire (talk) 15:01, 8 October 2011 (UTC)[reply]

Illustration Request

Is the illustration right? I think R6 and R7 are switched?— Preceding unsigned comment added by 130.108.237.126 (talk) 07:42, 19 November 2006

Definitely an error, values for R6 and R7 are switched. —The preceding unsigned comment was added by 193.1.172.104 (talk) 09:31, 12 December 2006 (UTC).[reply]

This has been fixed in 2007, in the previous version of the image, see: File:R-tree.jpg. --Chire (talk) 15:01, 8 October 2011 (UTC)[reply]

Illustration Validity?

Isn't this illustrating an interval tree? If each rectangles had points, then it would make it simpler to undertsand imo— Preceding unsigned comment added by 67.127.184.86 (talk) 09:55, 4 March 2008

An R-Tree can store points, rectangles, polygons (via their MBR) ... The term "interval tree" is commonly used for a tree storing 1d intervals using a 2d index structure, where then an interval is represented by a point. --Chire (talk) 07:28, 4 October 2011 (UTC)[reply]

Broken Link

The "containment" example of a searching algorithm link points to an interesting but somewhat irrelevant article on "the foreign policy strategy of the United States" —Preceding unsigned comment added by 62.49.247.83 (talk) 13:35, 8 March 2008 (UTC)[reply]

Similarity to multi-dimensional enfilades

Interesting. I wonder if there is a similarity with Project Xanadu's enfilades. — Preceding unsigned comment added by Mpe (talk • contribs) 14:22, 4 March 2010