B-TREE


Also found in: Encyclopedia, Wikipedia.
AcronymDefinition
B-TREEBinary Tree
B-TREEBalanced Multiway Search Tree
References in periodicals archive ?
The heaped table requires a full table scan to either locate an instance of a single key or to locate multiple instances for a range of keys; while the hashed table can efficiently locate an instance of a specific key, but still requires a full table scan to locate a range of keys; whereas a B-tree can perform both searches efficiently.
In looking to bring the data warehouse into a harmonious relationship with the operational system, these indexes provide a compelling alternative to conventional B-tree indexes, hash indexes and bit maps.
For large tables with dynamic data, such as a fact table, B-Tree indexes and hashed clusters are unsuitable.
Each of the standard index structures has a number of variants that are used throughout industry For example, the B-Tree often surfaces as a B' Tree or B* Tree variant However, from a general functionality and overall performance standpoint, there is little to distinguish the variants and this paper will focus its attention on the fundamental structure of each index type.
eXtremeDB supports virtually all data types, and provides multiple query methods, including exact match searches, b-tree indexes, and object-identifier references.
5 sports industrial-strength improvements in performance and stability, including new debugging features, connection pooling, B-tree optimization, and identity columns for clustered tables, as well as added support for AES encryption.
Support for Unicode through the UCS2 and UTF8 international character sets, making it easier to store and manipulate internationalized data; -- Support for a subset of GIS data types as proposed by the OpenGIS consortium, which can be used to do efficient searches in maps -- Support for up to 64 gigabytes of memory in 32-bit Windows (AWE memory) using the InnoDB storage engine -- Better performance through in-memory tables using B-TREE indices.
Speed Disk, the fastest and safest way to optimize your Macintosh's data, now optimizes B-tree directory structures to improve performance while accessing files.
RDM/Vx fully supports the relational database model, in which records are stored in tables and accessed via b-tree indexes.
B-Tree Systems announced today it has changed its name to TestQuest to reflect the company's new focus on providing functional testing systems for information appliances, which are digital consumer electronics that provide access to the Internet.
And unlike traditional access methods such as B-tree, the new JS engine can achieve and sustain high performance as the database continues to grow in size and complexity.