Embedded Software: Boost Performance and Minimize Footprint with Specialized Data Indexes
[Please note that the live Webinar date has passed. To view a recorded version, click here.]
![]() |
That's unfortunate, because many other index types can be more efficient in specific circumstances, enabling important design tradeoffs and offering distinct advantages for categories such as geospatial/mapping and telecom/IP-based communications applications.
Join McObject Founders Steve Graves and Andrei Gorine to look at less well-known indexes that are a “good fit” for application needs, including:
- R-Trees for geospatial indexing (common in GPS/navigation systems)
- Patricia trie (yes, that’s spelled correctly) for router and telephone directory searches
- T-trees for all-in-memory data storage and access
- Hash tables for quickly locating a single unique index entry
- “Custom indexes” or b-trees that allow the application to define the sort ordering of entries, rather than defaulting to lexographical or numerical sorting; this is useful in implementing soundex indexes, for example
The presentation also examines index implementation methods that avoid data duplication, to minimize an embedded system’s memory requirements. After the presentation, get your questions answered in live a Q&A session with Steve and Andrei.
Don't miss McObject's Webinar, Embedded Software: Boost Performance and Minimize Footprint with Specialized Data Indexes!
Registration:
[Please note that the live Webinar date has passed. To view a recorded version, click here.]




