swift_db 0.1.1

data/Manifest

@@ -0,0 +1,13 @@
+Manifest
+README.rdoc
+Rakefile
+lib/a.rb
+lib/common/comparison.rb
+lib/db.rb
+lib/root/binary.rb
+lib/root/internal_node.rb
+lib/root/leaf.rb
+lib/root/table.rb
+lib/root/tree.rb
+lib/swift_db.rb
+swift_db.gemspec

data/Rakefile

@@ -0,0 +1,14 @@
+ require 'rubygems'  
+ require 'rake'  
+ require 'echoe'  
+   
+ Echoe.new('swift_db', '0.1.1') do |p|
+   p.description     = "Stores data in a B+tree structure"  
+   p.url             = "https://github.com/ask4prasath/swift_db"  
+   p.author          = "Prasath V Ram"  
+   p.email           = "ask4prasath@gmail.com"  
+   p.ignore_pattern  = ["tmp/*", "script/*"]  
+   p.development_dependencies = []  
+ end  
+   
+ Dir["#{File.dirname(__FILE__)}/tasks/*.rake"].sort.each { |ext| load ext }

data/lib/common/comparison.rb

@@ -0,0 +1,14 @@
+module DB
+  module Core
+    module Common
+      module Comparison
+        EQ = "==" # Equal
+        NEQ = "<>" # Not equal
+        GT = ">" # Greater than
+        GTE = ">=" # Greater than or equal
+        LT = "<" # Less than
+        LTE = "<=" # Less than or equal
+      end
+    end
+  end
+end 

data/lib/db.rb

@@ -0,0 +1,20 @@
+$:.unshift(File.join(File.dirname(__FILE__),'..','lib'))
+
+#Loads all the core Database Files
+
+#require "/home/prasath/database/Database/lib/root/leaf.rb"
+
+require "root/tree.rb"
+require "root/leaf.rb"
+require "root/internal_node.rb"
+require "root/binary.rb"
+require "root/table.rb"
+require "common/comparison.rb"
+
+
+
+
+#for local reference
+
+#require "/home/prasath/database/Database/lib/db.rb"
+#a = Db::Core::Table.new

data/lib/root/binary.rb

@@ -0,0 +1,7 @@
+module Db
+  module Core
+    def binary_search
+
+    end
+  end
+end

data/lib/root/internal_node.rb

@@ -0,0 +1,97 @@
+module Db
+  module Core
+    class InternalNode
+        attr_reader :infinity_node, :keys_and_node_pointers
+        attr_accessor :parent_node
+
+        def initialize(order=3, infinity_node=nil)
+          @order=order
+          @max_capacity=@order-1
+          @keys_and_node_pointers=[]
+          @infinity_node=infinity_node
+          @infinity_node.parent_node=self
+          @parent_node=nil
+        end
+
+        def keys
+          keys=[]
+          @keys_and_node_pointers.each {|key_data| keys << key_data[0]}
+          keys
+        end
+
+        def datas
+          
+        end
+
+
+        def max_key_value
+          @keys_and_node_pointers[-1][0]
+        end
+
+        def insert_node_pointer(key_and_node)
+          puts "-------------#{key_and_node}"
+          @keys_and_node_pointers << key_and_node
+          sort_keys
+          split if @keys_and_node_pointers.size > @max_capacity
+        end
+
+
+        def insert(key, value)
+          case
+            when key > max_key_value
+              @infinity_node.insert(key, value)
+            else
+              @keys_and_node_pointers.each do |key_node|
+                if key <= key_node[0]
+                  key_node[1].insert(key, value)
+                  break;
+                end
+              end
+          end
+        end
+
+        def search(key, operator=DB::Core::Common::Comparison::EQ)
+          match=nil
+          case
+            when key > max_key_value
+              match=@infinity_node.search(key, operator)
+            else
+              @keys_and_node_pointers.each do |key_node|
+                if key <= key_node[0]
+                  match=key_node[1].search(key, operator)
+                  break;
+                end
+              end
+          end
+          return match
+        end
+
+
+      private
+
+      def sort_keys
+        @keys_and_node_pointers.sort! {|a,b| a<=>b}
+        end
+
+        def split
+          puts "============#{@keys_and_node_pointers}"
+          split_index=((@keys_and_node_pointers.length / @max_capacity.to_f).ceil)-1
+          splited_values=@keys_and_node_pointers.values_at(0..split_index)
+          @keys_and_node_pointers.slice!(0..split_index)
+
+          max_key_node = splited_values[-1]
+
+          new_node=InternalNode.new(@order, max_key_node[1])
+
+          @parent_node = InternalNode.new(@order, self) if @parent_node.nil?
+          new_node.parent_node=@parent_node
+
+          splited_values.slice!(-1)
+          splited_values.each {|key_node| new_node.insert_node_pointer(key_node) }
+
+          @parent_node.insert_node_pointer([max_key_node[0], new_node])
+        end
+
+    end
+  end
+end

data/lib/root/leaf.rb

@@ -0,0 +1,9 @@
+module Db
+  module Core
+    class Leaf
+      def initialize()
+
+      end
+    end
+  end
+end

data/lib/root/table.rb

@@ -0,0 +1,32 @@
+module Db
+  module Core
+    class Table
+
+      attr_accessor :root_node, :first_node
+
+      def initialize(structure=3)
+        raise "Your node structure is less than 3 which is not good for BTree" if (structure < 3)
+        @structure = structure
+        @root_node = Tree.new(@structure)
+        @first_node = @root_node
+      end
+
+      def insert(key, value)
+        @root_node.insert(key, value)
+        @root_node = @root_node.parent_node unless @root_node.parent_node.nil?
+      end
+
+      def search(key, operator=DB::Core::Common::Comparison::EQ)
+          case operator
+            when DB::Core::Common::Comparison::NEQ
+              @root_node.search(key, DB::Core::Common::Comparison::LT) + @root_node.search(key, DB::Core::Common::Comparison::GT)
+            else
+              @root_node.search(key, operator)
+          end
+      end
+
+
+
+    end
+  end
+end

data/lib/root/tree.rb

@@ -0,0 +1,115 @@
+module Db
+  module Core
+    class Tree
+
+      attr_accessor :datas, :parent_node, :pre_node, :next_node, :structure
+
+      def initialize(structure=3)
+        @structure = structure
+        @datas = []
+        @parent_node = nil
+        @pre_node = nil
+        @leaf_node = nil
+        @next_node = nil
+      end
+
+      def keys
+        id = []
+        @datas.each {|k| id << k[0]}
+        id
+      end
+
+      def max_key_value
+          @datas[-1][0]
+        end
+
+      def insert(key, value)
+        inserting_element = key
+        _datas = [] << inserting_element << value
+        @datas << _datas
+        sort_keys
+        divide if @datas.length > @structure
+        @datas
+      end
+
+      def search(key, operator=DB::Core::Common::Comparison::EQ)
+          match=[]
+          case operator
+            when DB::Core::Common::Comparison::EQ
+              @datas.each do |key_node|
+                if key == key_node[0]
+                  match << key_node[1]
+                  break;
+                end
+              end
+              return match[0]
+            when DB::Core::Common::Comparison::GT  ## Find nodes that are greater than key
+              @datas.each do |key_node|
+                if key_node[0] > key
+                  match << key_node[1]
+                end
+              end if max_key_value > key
+              match += next_node.search(key, operator) unless next_node.nil?
+              return match
+            when DB::Core::Common::Comparison::GTE
+              @datas.each do |key_node|
+                if key_node[0] >= key
+                  match << key_node[1]
+                end
+              end if max_key_value >= key
+              match += next_node.search(key, operator) unless next_node.nil?
+              return match
+            when DB::Core::Common::Comparison::LT
+              @datas.each do |key_node|
+                if key_node[0] < key
+                  match << key_node[1]
+                end
+              end
+              pre_match = []
+              pre_match = pre_node.search(key, operator) unless pre_node.nil?
+              match = pre_match + match
+              return match
+            when DB::Core::Common::Comparison::LTE
+              @datas.each do |key_node|
+                if key_node[0] <= key
+                  match << key_node[1]
+                end
+              end
+              pre_match = []
+              pre_match = pre_node.search(key, operator) unless pre_node.nil?
+              match = pre_match + match
+              return match
+          end
+        end
+
+
+    private
+      def sort_keys
+        self.datas.sort!
+      end
+
+      def divide
+          no_of_divides = ((@datas.length/@structure).ceil) - 1
+          leaf_items = @datas.values_at(0..no_of_divides)
+          @datas.slice!(0..no_of_divides)
+
+
+          new_node = Tree.new()
+          new_node.datas = leaf_items
+          new_node.pre_node = @pre_node
+          new_node.next_node = self
+          new_node.pre_node.next_node = new_node unless new_node.pre_node.nil?
+          @pre_node = new_node
+          @parent_node = InternalNode.new(@structure, self) if @parent_node.nil?
+          @pre_node.parent_node=@parent_node
+          @parent_node.insert_node_pointer([@pre_node.max_key_value, @pre_node]) unless @parent_node.nil?
+
+      end
+    end
+  end
+end
+
+
+
+#require "/home/prasath/database/Database/lib/db.rb"
+#a= Db::Core::Tree.new

data/lib/swift_db.rb

@@ -0,0 +1,12 @@
+$:.unshift(File.join(File.dirname(__FILE__),'..','lib'))
+
+#Loads all the core Database Files
+
+#require "/home/prasath/database/Database/lib/root/leaf.rb"
+
+require "root/tree.rb"
+require "root/leaf.rb"
+require "root/internal_node.rb"
+require "root/binary.rb"
+require "root/table.rb"
+require "common/comparison.rb"

data/swift_db.gemspec

@@ -0,0 +1,30 @@
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{swift_db}
+  s.version = "0.1.1"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 1.2") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Prasath V Ram"]
+  s.date = %q{2010-12-05}
+  s.description = %q{Stores data in a B+tree structure}
+  s.email = %q{ask4prasath@gmail.com}
+  s.extra_rdoc_files = ["README.rdoc", "lib/a.rb", "lib/common/comparison.rb", "lib/db.rb", "lib/root/binary.rb", "lib/root/internal_node.rb", "lib/root/leaf.rb", "lib/root/table.rb", "lib/root/tree.rb", "lib/swift_db.rb"]
+  s.files = ["Manifest", "README.rdoc", "Rakefile", "lib/a.rb", "lib/common/comparison.rb", "lib/db.rb", "lib/root/binary.rb", "lib/root/internal_node.rb", "lib/root/leaf.rb", "lib/root/table.rb", "lib/root/tree.rb", "lib/swift_db.rb", "swift_db.gemspec"]
+  s.homepage = %q{https://github.com/ask4prasath/swift_db}
+  s.rdoc_options = ["--line-numbers", "--inline-source", "--title", "Swift_db", "--main", "README.rdoc"]
+  s.require_paths = ["lib"]
+  s.rubyforge_project = %q{swift_db}
+  s.rubygems_version = %q{1.3.7}
+  s.summary = %q{Stores data in a B+tree structure}
+
+  if s.respond_to? :specification_version then
+    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+    else
+    end
+  else
+  end
+end

metadata

@@ -0,0 +1,94 @@
+--- !ruby/object:Gem::Specification 
+name: swift_db
+version: !ruby/object:Gem::Version 
+  hash: 25
+  prerelease: false
+  segments: 
+  - 0
+  - 1
+  - 1
+  version: 0.1.1
+platform: ruby
+authors: 
+- Prasath V Ram
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-12-05 00:00:00 +05:30
+default_executable: 
+dependencies: []
+
+description: Stores data in a B+tree structure
+email: ask4prasath@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- README.rdoc
+- lib/a.rb
+- lib/common/comparison.rb
+- lib/db.rb
+- lib/root/binary.rb
+- lib/root/internal_node.rb
+- lib/root/leaf.rb
+- lib/root/table.rb
+- lib/root/tree.rb
+- lib/swift_db.rb
+files: 
+- Manifest
+- README.rdoc
+- Rakefile
+- lib/a.rb
+- lib/common/comparison.rb
+- lib/db.rb
+- lib/root/binary.rb
+- lib/root/internal_node.rb
+- lib/root/leaf.rb
+- lib/root/table.rb
+- lib/root/tree.rb
+- lib/swift_db.rb
+- swift_db.gemspec
+has_rdoc: true
+homepage: https://github.com/ask4prasath/swift_db
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --line-numbers
+- --inline-source
+- --title
+- Swift_db
+- --main
+- README.rdoc
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 11
+      segments: 
+      - 1
+      - 2
+      version: "1.2"
+requirements: []
+
+rubyforge_project: swift_db
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: Stores data in a B+tree structure
+test_files: []
+