在这些系统中对数据库进行比较，以确定将数据迁移到目标系统所需的数据转换复杂度。

Where the databases are compared to find out the level of complexity required for data transformation to migrate the data to the target systems.

youdao

复杂度：容器中元素数量的分期对数加上具有给定键值的对象数量的线性比例。

Complexity: Amortized logarithmic to the number of elements contained plus lineal to number of objects with the given key.

youdao

复杂度：所含元素数量的对数加上具有给定键值的元素数量的线性。

Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

youdao

A log algorithm typically is one where you cut the size of the problem down by some multiplicative factor.

对数级复杂度的算法就是指,通过一系列常量级步数的操作,可以将问题的规模。

麻省理工公开课 - 计算机科学及编程导论课程节选

So in fact, what does that suggest about the order of growth here? What is the complexity of this? Yeah. Logarithmic. Why?

复杂度是多少？,对的，对数级的么？，为什么呢？,学生：对数级的？

麻省理工公开课 - 计算机科学及编程导论课程节选

All right? It's now something that I can search in constant time. And that's what's going to allow me to keep this thing as being log.

在固定的时间内搜索,这样就可以让时间复杂度保持在对数级,好的，考虑过了这些。

麻省理工公开课 - 计算机科学及编程导论课程节选