Click here to Skip to main content
Click here to Skip to main content
Articles » Database » NoSQL » General » Downloads
 
Add your own
alternative version
Go to top

RaptorDB - the Key Value Store

, 22 Jan 2012
Smallest, fastest embedded nosql persisted dictionary using b+tree or MurMur hash indexing. (Now with Hybrid WAH bitmap indexes)
RaptorDB_v1.0.zip
RaptorDB
testing
RaptorDB_v1.1.zip
Indexes
Storage
Views
RaptorDB_v1.2.zip
RaptorDB_v1.3.zip
RaptorDB_v1.4.1.zip
Properties
RaptorDB_v1.4.zip
RaptorDB_v1.5.1.zip
RaptorDB_v1.5.2.zip
RaptorDB_v1.5.zip
RaptorDB_v1.6.zip
RaptorDB_v1.7.5.zip
UnitTests
Properties
UnitTests.nunit
RaptorDB_v1.7.zip
_svn
all-wcprops
dir-prop-base
entries
prop-base
props
text-base
AssemblyInfo.cs.svn-base
tmp
prop-base
props
text-base
UnitTests.nunit
RaptorDB_v1.8.zip
DataTypes
UnitTests release.nunit
UnitTests.nunit
UnitTests.nunit
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace RaptorDB
{
    #region [ internal classes ]
    internal class KeyPointer
    {
        public KeyPointer(bytearr key, int recno, int duppage)
        {
            RecordNum = recno;
            Key = key;
            DuplicatesPage = duppage;
        }

        public KeyPointer(bytearr key, int recno)
        {
            RecordNum = recno;
            Key = key;
            DuplicatesPage = -1;
        }

        public bytearr Key;
        public int RecordNum;
        public int DuplicatesPage = -1;

        //public override string ToString()
        //{
        //    return "" + Key;
        //}

        public KeyPointer Copy()
        {
            return new KeyPointer(Key, RecordNum);
        }
    }

    public struct bytearr
    {
        public bytearr(byte[] key)
        {
            val = key;
        }
        public byte[] val;

        //public override string ToString()
        //{
        //    return "" + val[0];
        //}
        public override int GetHashCode()
        {
            int result = 17;
            foreach (byte b in val)
            {
                result = result * 31 + b;
            }
            return result;
        }
    }
    #endregion

    internal class Node
    {
        internal int DiskPageNumber = -1;
        internal List<KeyPointer> ChildPointers = new List<KeyPointer>();
        internal bool isLeafPage = false;
        internal bool isDirty = false;
        internal bool isDuplicatePage = false;
        internal bool isRootPage = false;  
        internal List<int> Duplicates = new List<int>();
        internal int ParentPageNumber = -1;
        internal int RightPageNumber = -1;

        public Node(byte type, int parentpage, List<KeyPointer> children,List<int> duplicates, int diskpage, int rightpage)
        {
            DiskPageNumber = diskpage;
            ParentPageNumber = parentpage;
            RightPageNumber = rightpage;
            if ((type & 1) == 1)
                isLeafPage = true;
            if ((type & 2) == 2)
                isRootPage = true;
            if((type & 4) == 4)
                isDuplicatePage =true;
            ChildPointers = children;
            Duplicates = duplicates;
        }

        public Node(int diskpage)
        {
            isLeafPage = true;
            DiskPageNumber = diskpage;
            isRootPage = false;
        }

        public short Count
        {
            get { return (short)ChildPointers.Count; }
        }

        //public override string ToString()
        //{
        //    return "childs=" + ChildPointers.Count + " page=" + diskPageNumber + " isleaf=" + isLeaf;
        //}
    }

    internal class Bucket
    {
        internal int BucketNumber = -1;
        internal List<KeyPointer> Pointers = new List<KeyPointer>();
        internal List<int> Duplicates = new List<int>();
        internal int DiskPageNumber = -1;
        internal int NextPageNumber = -1;
        internal bool isDirty = false;
        internal bool isBucket = true;
        internal bool isOverflow = false;

        public Bucket(byte type, int bucketnumber, List<KeyPointer> pointers, List<int> duplicates, int diskpage, int nextpage)
        {
            DiskPageNumber = diskpage;
            BucketNumber = bucketnumber;
            NextPageNumber = nextpage;
            if ((type & 8) == 8)
                isBucket = true;
            if ((type & 16) == 16)
                isOverflow = true;
            Pointers = pointers;
            Duplicates = duplicates;
        }

        public Bucket(int page)
        {
            DiskPageNumber = page;
        }

        public short Count
        {
            get { return (short)Pointers.Count; }
        }

        //public override string ToString()
        //{
        //    return "count = " + Pointers.Count;
        //}
    }
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Mehdi Gholam
Architect
United Kingdom United Kingdom
Mehdi first started programming when he was 8 on BBC+128k machine in 6512 processor language, after various hardware and software changes he eventually came across .net and c# which he has been using since v1.0.
He is formally educated as a system analyst Industrial engineer, but his programming passion continues.
 
* Mehdi is the 5th person to get 6 out of 7 Platinums on CodeProject (13th Jan'12)

| Advertise | Privacy | Mobile
Web01 | 2.8.140922.1 | Last Updated 23 Jan 2012
Article Copyright 2011 by Mehdi Gholam
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid