![Graph theory / Data management / Computing / R-tree / Persistent data structure / FO / B+ tree / Tango tree / B-tree / Binary trees / Data structures Graph theory / Data management / Computing / R-tree / Persistent data structure / FO / B+ tree / Tango tree / B-tree / Binary trees / Data structures](https://www.pdfsearch.io/img/de2bef77b4476c8d453b9b840f2bc184.jpg) Date: 2004-01-23 10:39:23Graph theory Data management Computing R-tree Persistent data structure FO B+ tree Tango tree B-tree Binary trees Data structures | | I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University We present an external planar point location data structure that is I/O-effAdd to Reading ListSource URL: www.cs.swarthmore.eduDownload Document from Source Website File Size: 370,88 KBShare Document on Facebook
|