Database Paper Browser

Back to papers

K-means Split Revisited: Well-grounded Approach and Experimental Evaluation

Summary: Re-examines the k-means node-split for R-trees, uncovers theoretical flaws, and presents a well-grounded redesign. Empirical evaluation in PostgreSQL with a modern multidimensional benchmark demonstrates when the new split improves performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5223
Venue
SIGMOD
Year
2016
Pagerank
4.1945683e-05
Overall Rank
11,852 | 17.55%
DOI
10.1145/2882903.2914833

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0032169493
3,255 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD 7.3160522e-05
Previous Page 1 / 1 Next

Semantically Similar Papers