Code for Storing XML in a Relational Database

CLOSED
Bids
11
Avg Bid (USD)
$138
Project Budget (USD)
$30 - $250

Project Description:
I want the C code for the attached algorithm to store an XML document in a relational database.

Things to be done:

1) Use the Xrecursive algorithm to store the result obtained (after parsing the xml file) into MYSQL.

2) Parse the same xml file using any other parsing method (SAX or DOM) and compare the result
on the basis of parsing time, time required to store the result into relational database &
database size required to store the document in both the cases.

3) Show from the comparison that the Xrecursive algorithm is the most efficient one in both the
cases and thus could be used as a method to store xml files into RDBMS.

I want this asap, i.e. within a day or 2 max. Make sure to give proper documentation and properly explain the code with comments.

Note: My budget is very minimal as it's not my project, I'm putting it up to help a friend of mine. I'm looking for someone who could do it for around $30.

Skills required:
C Programming, C++ Programming, Data Processing, Java, XML
Additional Files: xrec.pdf
About the employer:
Verified
Public Clarification Board
Bids are hidden by the project creator. Log in as the employer to view bids or to bid on this project.
You will not be able to bid on this project if you are not qualified in one of the job categories. To see your qualifications click here.


$ 231
in 5 days
$ 99
in 5 days
$ 55
in 3 days
Hire ilavenil
$ 137
in 3 days
Hire jindalkamal
$ 242
in 3 days
Hire esadeghi59
$ 147
in 4 days
Hire cuda
$ 79
in 5 days
Hire arokai
$ 110
in 3 days
$ 200
in 5 days
Hire coderGuruu
$ 165
in 3 days