Lars Arge, Andrew Danner, Sha-Mayn Teh. I/O-efficient point location using persistent B-trees. ACM Journal of Experimental Algorithmics, 8, 2003. [doi]
@article{ArgeDT03:0,
title = {I/O-efficient point location using persistent B-trees},
author = {Lars Arge and Andrew Danner and Sha-Mayn Teh},
year = {2003},
doi = {10.1145/996546.996549},
url = {http://doi.acm.org/10.1145/996546.996549},
tags = {persistent},
researchr = {https://researchr.org/publication/ArgeDT03%3A0},
cites = {0},
citedby = {0},
journal = {ACM Journal of Experimental Algorithmics},
volume = {8},
}