diff --git a/lib/strokedb/views/view_storage.rb b/lib/strokedb/views/view_storage.rb
index 8ff07422..6000e8aa 100644
--- a/lib/strokedb/views/view_storage.rb
+++ b/lib/strokedb/views/view_storage.rb
@@ -5,7 +5,7 @@ class ViewStorage
     def initialize(options = {})
       # TODO: find out whether the view indexfile exists and read
       #       its options
-      @skiplist = SimpleSkiplist.new
+      @list = SimpleSkiplist.new
     end
     
     def set_options(options)
@@ -20,7 +20,7 @@ def set_options(options)
     # 
     #
     def oleganza_find(start_key, end_key, limit, offset, reverse, with_keys)
-      @skiplist.search(start_key, end_key, limit, offset, reverse, with_keys)
+      @list.search(start_key, end_key, limit, offset, reverse, with_keys)
     end
     
     #
@@ -28,12 +28,12 @@ def oleganza_find(start_key, end_key, limit, offset, reverse, with_keys)
     def find(start_key, end_key, key, limit, offset, reverse, with_keys)
       start_key = end_key = key if start_key.nil? && end_key.nil? 
       # Please note that below algorithm will most probably be eventually replaced by a new skiplist Oleg Andreev works on currently
-      start_key = @skiplist.first_key unless start_key
+      start_key = @list.first_key unless start_key
       current_key = start_key
       offset ||= 0
       
       items = []
-      item = @skiplist.find_nearest_node(current_key)
+      item = @list.find_nearest_node(current_key)
       
       offset.times do 
         item = item[0][0] # next node