Inside the Briefcase

Live Webcast: Minimize technical challenges while delivering high impact analytics

Live Webcast: Minimize technical challenges while delivering high impact analytics

Join this live webcast where we'll discuss how you...

Accelerating Software Delivery with DevOps

Accelerating Software Delivery with DevOps

This short webcast provides an overview of SmartCloud Continuous...

IT Briefcase Exclusive Interview: Maximizing Data Discovery and Visualization with TIBCO’s Steve Farr

IT Briefcase Exclusive Interview: Maximizing Data Discovery and Visualization with TIBCO’s Steve Farr

with Steve Farr, TIBCO
In this interview, Steve Farr...

IT Briefcase Exclusive Interview: The Future of Cloud Integration with Rick Nucci, DELL Boomi

IT Briefcase Exclusive Interview: The Future of Cloud Integration with Rick Nucci, DELL Boomi

with Rick Nucci, DELL Boomi
In this interview,...

The Importance of Ethernet in Building Smarter Systems with IBM Flex and IBM PureSystems™

The Importance of Ethernet in Building Smarter Systems with IBM Flex and IBM PureSystems™

IBM has industry-leading networking technologies that allow us to...

Webcast: Understanding Indexing: Three rules on making indexes around queries to provide good performance

July 27, 2012 No Comments

Tokutek Webinar, Tuesday, July 31

Time: 2PM EDT / 11AM PDT

Understanding Indexing: Three rules on making indexes around queries to provide good performance

Application performance often depends on how fast a query can respond and query performance almost always depends on good indexing. So one of the quickest and least expensive ways to increase application performance is to optimize the indexes. This talk presents three simple and effective rules on how to construct indexes around queries that result in good performance.

This is a general discussion applicable to all databases using indexes and is not specific to any particular MySQL® storage engine (e.g., InnoDB, TokuDB®, etc.). The rules are explained using a simple model that does NOT rely on understanding B-trees, Fractal Tree® indexing, or any other data structure used to store the data on disk.

The rules are derived from these simple properties:

  • Point queries are slow
  • Range queries are fast

Click here to register for this webcast

APPLICATION INTEGRATION, Featured Webinars

Leave a Reply

(required)

(required)


ADVERTISEMENT
Gartner

Predictive Analytics

Gartner

Gartner

Ovum BYOX

FuseSource Red Hat

IBM Data