Any query such as the one in Listing 1 has a precise path to the specified datum, which a DBMS can quickly determine in balanced trees and byte-offset codings.
如清单1中所示的任何查询都有到指定数据的精确路径，DBMS可以迅速地在均衡树和字节偏移编码中确定它。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
应用推荐