Skip to main content
Select Page

Announcing
eXtremeDB 9.0!

• Native ANN Indexes
• IoT Edge in 8 KB or Less

Learn more

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

An on-demand Webinar from McObject.

Are you using data indexes to boost performance in locating data objects in embedded software?  If so, the right index can enhance lookup speed logarithmically, while reducing RAM and CPU demands. While the B-Tree is the best known index, there are many others can be more efficient in specific circumstances, such as ingeospatial/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 memory footprint.

eXtremeDB provides specialized indexes (opens in a new tab) to facilitate particular types of database search and navigation.

  • B-Tree
  • Patricia Trie (ideal for managing IP addresses)
  • R-Tree (example using spatial coordinates)
  • KD-Tree (example using Query-by-example)
  • Trigram (using Trigram indexes for text searches)
  • Autoid indexes and unique Object Id searches
  • List indexes

Visit the index page in our online documentation.

More about eXtremeDB indexes

[cmplz-accept-link text=”Having trouble with the video? Please accept the cookies.”]

View short segments from the Webinar about these indexes:

  • Patricia trie

  • T-tree

  • B-tree

  • R-tree

  • Hash indexes

What makes eXtremeDB different?

Our extensive combination of features.  Learn about features designed to:

Maximize database reliability
Reduce memory usage
Develop a faster database