computer science

Priority R-tree

Priority R-tree is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Priority R-tree rather than just read about it. In short: 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.

Key takeaways

Priority R-tree belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Priority R-tree to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Priority R-tree from memory before moving on to harder problems.

Reference excerpt

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.

Performance Arge et al. writes that the priority tree always answers window-queries with

O ( ( N B ) 1 − 1 d + T B ) {\displaystyle O\left(\left({\frac {N}{B}}\right)^{1-{\frac {1}{d}}}+{\frac {T}{B}}\right)} I/Os, where N is the number of d-dimensional (hyper-) rectangles stored in the R-tree, B is the disk block size, and T is the output size.

Dimensions In the case of d = 2 {\displaystyle d=2} the rectangle is represented by ( ( x m i n , y m i n ) , ( x m a x , y m a x ) ) {\displaystyle \,((x_{min},y_{min}),(x_{max},y_{max}))} and the MBR thus four corners ( x m i n , y m i n , x m a x , y m a x ) {\displaystyle \,(x_{min},y_{min},x_{max},y_{max})} .

See also Bounding volume hierarchy B-tree R-tree

References

Worked examples

Example 1 — a first encounter with Priority R-tree

Start with the simplest possible case. Write down what Priority R-tree claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Priority R-tree before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Priority R-tree ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Priority R-tree

In research: Priority R-tree appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Priority R-tree in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Priority R-tree is common in secondary-school and first-year university syllabi. It links to neighbouring topics Algorithms and data structures stubs, Database index techniques, R-tree, so understanding it makes those chapters shorter.
In everyday life: Look for Priority R-tree outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Priority R-tree in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Priority R-tree means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Priority R-tree out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Priority R-tree in simple terms?

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.

Why does Priority R-tree matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Priority R-tree?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Priority R-tree.