Show Bid Request
database or data compression
Bid Request Id: 24989
|
|
|
Description:
Please see the attached for the sample files
We need a lightweight database or data compression engine that does the following:
Compression:
Data contains 10,000 to 30,000 text files, uncompressed text size is 1 GB to 2GB.
Max space used required: 150MB to 200MB
Data format:
Descending order in dates. Each row contains a date and contains comma delimited with numeric values, approximately 100 bytes or less per row.
Data retrieval:
Average Max speed for 1 file, 5000 rows, 100 bytes: 0.03 Secs
Data update:
Average Max speed for inserting new row for 1 file, 100 bytes: 0.03 Secs
Operating Platform:
Win98 and above.
We have tested Pkzip, Xceedzip and Dynazip. None qualifies.
We will provide detail once we find a potential candidate.
To get sample files to work with, please go to the following link, download the CSV file (spreadsheet), create 10,000 files with different names.
http://finance.yahoo.com/q?s=ibm&d=t
Please see detail attached.
Deliverables:
we requires a functional DLL which can be written in any language, but preferably in C++
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
Complete copyrights to all work purchased.
Platform:
Win98 and above
Must be 100% finished and received by buyer on:
Sep 30, 2002 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:
deadline can be changed to earlier date. However it will be discussed when we select a potential candidate and discuss with him/her in detail.
Additional Files:
This bid request includes IMPORTANT additional attached files. Please download and read fully before bidding.
|
|
|
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 |
|
|
|
|
$1,000 (USD)
|
Aug 22, 2002
4:10:50 PM EDT
|
10
(Excellent)
|
|
|
Hello matkimj,
I am a professional programer at Indiana University. I have a MS in CS, and substantial experience in C++ programming. One example of my work is the Feature Analyst which I was a part of last year. http://www.vls-inc.com I am very easy to work with and will make sure you are getting exactly what you are looking for. I feel I could build the application you describe in the attached file entitled: 'Application Explained' for the quoted price however, I have some questions I would like to ask. |
|
|
|
|
|
|
$875 (USD)
|
Aug 31, 2002
1:48:12 PM EDT
|
10
(Excellent)
|
|
|
Hi Matthew,
I am Mark Mangrich. We talked on the phone on Sunday night late. I called you if you recall. We had been talking on IM and I told you about the work I was doing on the Data Compression Demo. I have re-adjusted my bid price. I have also attached a demo. This demo is zipped in the attched file. But it is really simply an exe that will step you through the process of showing you how I did the compression and the speeds and the compression rate. I am getting as good of compression as ZIP! I have written two versions. The version I have given you is the most robust. There are some advances I made in a different version that can save disk space and retrieval time. If you have any questions please dont hesitate to ask. We can talk about further details when you have time.
Thank you for the oportunity to build this nice piece of software for you.
Sincerely,
Mark Mangrich |
|
|
Attached File
|
|
|
|
|
|
N/A
|
Aug 31, 2002
7:45:26 PM EDT
|
10
(Excellent)
|
|
|
Hello Matthew,
I have updated the demo. Like I said, these larger requirements will not increase the size of the compressed files and it will not affect performace. If any very little.
Please use and test this demo and let me know what you think. We can talk more anytime.
Here are the new limitations:
We can accept prices up to $131,071.99999999
We can accept volumes to just over 1 trillion
As for the other guy. I may be faster at retrieval and updating. I can do this because I dont look over the file to make decisions about how to compress the file. I have a unique way of compressing data a line at a time this way we can insert and read lines very quickly. Other approaches that use some form of run length encoding can get higher compression rates at the cost of a little access speed.
I hope we can work together on this.
Thanks,
Mark Mangrich |
|
|
Attached File
|
|
|
|
|
|
N/A
|
Sep 1, 2002
11:19:03 AM EDT
|
10
(Excellent)
|
|
|
Hello Matthew,
I was thinking about my competitions solution to this problem. I am more and more sure that the way I have done it is going to be faster. If he/she takes 4.5 minutes to compress the data and I can do it in 44 seconds, my update speed must be faster since it is the same process of taking a line from the uncompressed file and adding to the binary compressed archive. A line from the user is the same. This other demo may be able to look as if they are doing it quickly but they may need to run some maintenance sometime to restructure and optimize the data again. Just a thought. Also, keep in mind that the simple methods to measure time on a computer are not extremely accurate. When a process runs as quickly as 0.016 seconds, the computer is giving this as an somehwat accurate estimate. As the time periods get longer the measurements are more accurate. It can be hard to measure something that short and extrapolate it to out. Does that make sense?
If one file is an issue, I can put all the files into one. You let me know. I could try it and there may not be that much of a penalty.
Let me know how it goes.
Mark Mangrich |
|
|
|
|
This bid was accepted by the buyer!
|
$800 (USD)
|
Sep 4, 2002
1:38:47 PM EDT
|
10
(Excellent)
|
|
|
This bid is for data compression work only and does not include ZIP support. Buyer will supply zip support on their own. I will supply a dll that does data compression and is callable by VB.
Thank you
Mark Mangrich |
|
|
|
|
|
|
live RSS newsfeeds
Mark Mangrich