数据库索引及其大o表示法

I'm trying to understand the performance of database indexes in terms of Big-O notation. Without knowing much about it, I would guess that:I'm trying to understand the performance of dat