I want an unordered indexable data structure like a python list, which can access, update, insert and delete at arbitrary indices efficiently.

I have modified a skip list and an AVL tree to do the above in O(log n) time. Does there exist a data structure that can do better? Possibly O(log log n) or O(1) time?