B+tree index - Simple SQL implementation

Completed Posted Jan 17, 2013 Paid on delivery
Completed Paid on delivery

Implementation of B + Tree in declarative programming language environment (DBMS): After searching for existing implementations should transfer customize one of these, or start your own one, a DBMS of your choice. The language implementation will obviously be the SQL and / or PL / SQL - / - T-SQL - / - PL pgSQL. The tree will be saved in database (tables) and not to drive as usual.

The implementation should support only 2 operations: (1) introducing a new element to the index(tree) and (2) search in 2 versions, (a) identity and (b) range.

Attention: I want the implementation to be very simple and understandable. Furthermore i want to be explained with comments into the code.

SQL

Project ID: #4136580

About the project

5 proposals Remote project Active Jan 21, 2013

Awarded to:

InSolWorld

Hi. I have practiced SQL and PL-SQL. So, I will handle this project for you in SQL and PL-SQL. I am looking forward your consideration. Best regards.

€30 EUR in 4 days
(3 Reviews)
1.9

5 freelancers are bidding on average €62 for this job

siberiangirl

Please, check PM

€100 EUR in 5 days
(78 Reviews)
5.8
rakib062

Please check private message.

€100 EUR in 7 days
(8 Reviews)
4.2
srajbr

Ready to do ASAP

€35 EUR in 5 days
(2 Reviews)
2.5
LogicalError

ready for job plz check your PMB

€45 EUR in 2 days
(1 Review)
2.1