Show Bid Request
Simple B-tree in C
Bid Request Id: 27640
|
|
|
|
Posted by: |
frox (4 ratings)
(Software buyer rating 10 )
|
|
Non-action Ratio: |
Above Average - 36.36%
|
|
Posted: |
Sep 16, 2002
3:59:40 AM EDT
|
|
Bidding Closes: |
Sep 19, 2002
3:03:51 AM EDT
|
|
Viewed (by coders): |
639 times
|
|
Deadline: |
9/25/2002 4:03:51 AM
TIME EXPIRED
|
|
|
|
|
Description:
PROJECT UPDATE.
The specifications that are attached in the ZIP file are NOT changed, but I would like to make some points clearer.
What I need is a set of C functions that I will link to a Pascal program.
These functions implement a B-tree index.
The index can get up to and above 1.000.000 entries, with key length of 255 characters. It is therefore mandatory that the Whole tree stays on files, that are read and written but never competely loaded into memory.
The key itself is 255 characters, and together with the key come two other fields (255 and 32 characters) that need to be retrieved through the index.
Duplicate keys must be available.
If MIGHT be better to use a B+tree instead of a B-tree, as I asked for transversal navigation in the index and that's much easier to implement in B+trees than in B-trees. I am open to suggestions, though.
For what I understand, the better solution is NOT to reinvent the weel and to get an available source code and adapt it to my needs.
For example, at http://www.epaperpress.com/sortsearch/index.html , under "Very large file" look under B-trees. There you will find an ANSI-C implementation of a B++tree (a variant of B+tree).
Again, I am not a good C reader, but that seems nice: file-based, buffered pages, duplicate keys, and free for use (it says so on the first page).
If you take that code, check it properly, adapt it to my needs, comment it thoroughly and assist me in interfacing with it for me it's fine.
The procedures I listed in the specs are what I would have liked to call from Pascal, of course they should be properly defined.
Also, please note the change in deadline.
Deliverables:
1) Complete and fully-functional working program(s) in executable form as well as complete C source code of all work done, compilable in gcc.
No dependencies on third-party tools
2) Complete ownership and distribution copyrights to all work purchased.
3) Abundant internal documentation (i.e. comments) at least 1 line of comments each 4 lines of code.
File structure must also be exactly documented.
Algorithms, where different from the ones shown at
http://www.semaphorecorp.com/btp/algo.html
must be explained too.
Also check http://www.epaperpress.com/sortsearch/index.html
where it speaks of B-trees
Platform:
C language
BETTER IF ANSI C
Must be 100% finished and received by buyer on:
Sep 25, 2002 4:03:51 AM EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Special Conditions / Other:
As soon as possible, short timeframes will be a plus!
Additional Files:
This bid request includes IMPORTANT additional attached files. Please download and read fully before bidding.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
This bid was accepted by the buyer!
|
$200 (USD)
|
Sep 17, 2002
9:01:22 PM EDT
|
10
(Excellent)
|
|
|
hi there,
I will write a new code which will fit exactly to your needs.
I will use the fastest algorithms and a lot of optimisation techniques.
It will be completed, debugged and tested in maximum 2 days.
that's all.
I can see that there already are a lot of bids on your project.
it is a pretty complicated job and any mistake will lead to an exponential increase in execution time of the program.
so If you want a good speed to your program you should choose the best coder.
please check my ratings : I was rated only 10 on all projects and I am number 17 in rentacoder top coder list(from approx 30000 coders).
regards,
Victor
|
|
|
|
|
|
|
