I want to know that while finding a record using the primary key does RDBMS takes O(1) time or not? Answer No. In all databases that I know of, the primary key index is a B-tree index. Finding a particular element in such an index is an O(log n) operation, not O(1). Note that for the sizes of databases, O(log