Using Data Indexes to Boost Performance and Minimize Footprint in Embedded Software

Are you using indexes to enhance performance in locating data objects in embedded software? The right index can boost lookup speed logarithmically, and reduce RAM and CPU demands. While the B-Tree is the best known index, many others can be more efficient in specific circumstances, such as geospatial/mapping and telecom/networking applications. This Webinar examines less well-known indexes including T-Tree, Hash table, R-Tree, Patricia trie and others. It emphasizes index implementation methods that avoid data duplication, to minimize an memory footprint.