Talk:K-D-B-tree

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

???

This article has not yet received a rating 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}}

Splitting[edit]

"First, a region page is split along some plane to ..."

Well, how do you decide on which plane to use? — Preceding unsigned comment added by 188.60.245.15 (talk) 10:26, 21 November 2017 (UTC)[reply]

"It is important to take care in the domain and element chosen to split page by, since it is desirable to try to balance the number of points on either side of the splitting plane. In some cases, a poor choice of splitting domain can result in undesirable splits. It is also possible that a page cannot be split by a certain domain."

Algorithm (split part) doesn't specify actually how this is done, making this really a pseudo-algorithm. The splitting (and deciding where to split) is crucial and actually most important part of the algorithm, and other parts of algorithm are actually trivial. Are there some standard strategies for the KDB-trees? Histograms, or maybe having additional metadata in region pages like counts of points (at the expense of needing to update it on every insert, even if otherwise region pages and root would not require to be updated) or counters of queries (if one wants to optimize for query speed instead of storage balance)? — Preceding unsigned comment added by 188.60.245.15 (talk) 10:25, 21 November 2017 (UTC)[reply]