Author
Quanzheng Long
AbstractA new algorithm can speed up searching anything as a generalization of B/R-Trees