|
|
| Understand the Informix Dynamic Server B-tree scanner |
|
|
Spread the news
| Written by Robby Ivanovitch | |
| Tuesday, 14 October 2008 | |
|
(Srinath Duvuru and Mirav Kapadia) The B-tree scanner is a feature of IBM Informix Dynamic Server (IDS) that cleans dirty index items and compresses B-tree leaf pages. In this article, you'll gain a better understanding of how the B-tree scanner works and learn techniques for leveraging this feature to achieve optimum transaction processing performance.
Find more about it here.
Find out more about Technorati Search for: Informix. Copyright © 2008. All rights reserved. Discuss this article on the forums. (0 posts) |
| < Prev | Next > |
|---|
| Community | |||
|---|---|---|---|
|
| Main Menu | |||||
|---|---|---|---|---|---|
|
| Newsflash | ||||||||
|---|---|---|---|---|---|---|---|---|
|
||||||||
| Ads |
|---|
| Login Form |
|---|