Top Downloads News Highlights

Financial data management experts TimeStored feature McObject in their blog post, Pipe-lining Time Series Calculations for Cache Efficiency.

On multi-core systems, less resource contention = faster performance.
Learn more in our September 24th Webinar!

e
XtremeDB In-Memory Database System paired with ThreadX RTOS in technology alliance for deeply embedded systems. Get details.

Benchmark: McObject & EMC technologies combine to boost in-memory database speed, durability & scalability. Read the
press release.

Printable Version

Upcoming Live Webinar

Boost Performance and Minimize Footprint with Specialized Data Indexes

Register now for this event on September 26, 2012:

Session 1 (8:30 a.m. India; 10 a.m. Bangkok; 11 a.m. Beijing & Singapore; Noon Tokyo & Seoul; 1 p.m. Brisbane-Sydney-Melbourne)

Session 2 (9 a.m. Eastern Time; 2 p.m. London; 3 p.m. Berlin-Paris-Amsterdam; 4 p.m. Istanbul-Tel Aviv; 5 p.m. Moscow; 6:30 p.m. India; 8 p.m. Bangkok; 9 p.m. Singapore)


Session 3 (11 a.m. Pacific Time; Noon Mountain Time; 1 p.m. Central Time; 2 p.m. Eastern Time; 3 p.m. Buenos Aires-Sao Paulo; 7 p.m. London; 8 p.m. Berlin-Paris-Amsterdam)

Steven T. Graves
Steven T. Graves

Are you using data indexes to enhance performance in locating data objects in your software? The right index data structure can boost lookup speed logarithmically beyond that of a linear data search.

However, when indexing is considered, the first – and often only – index to be considered is likely to be the b-tree, due to its near-universal familiarity.

Join McObject president and co-founder Steve Graves for the Webinar, Boost Performance and Minimize Footprint with Specialized Data Indexes, which examines less well-known index types that may be a “better fit” to accelerate your application, 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. Register now for the Webinar, Boost Performance and Minimize Footprint with Specialized Data Indexes.

Registration

Session 1 (8:30 a.m. India; 10 a.m. Bangkok; 11 a.m. Beijing & Singapore; Noon Tokyo & Seoul; 1 p.m. Brisbane-Sydney-Melbourne)

Session 2 (9 a.m. Eastern Time; 2 p.m. London; 3 p.m. Berlin-Paris-Amsterdam; 4 p.m. Istanbul-Tel Aviv; 5 p.m. Moscow; 6:30 p.m. India; 8 p.m. Bangkok; 9 p.m. Singapore)

Session 3 (11 a.m. Pacific Time; Noon Mountain Time; 1 p.m. Central Time; 2 p.m. Eastern Time; 3 p.m. Buenos Aires-Sao Paulo; 7 p.m. London; 8 p.m. Berlin-Paris-Amsterdam)