06-13-2012
Any comment about the order of the data in the files and whether there is a one-for-one match between the two files (in which case the paste command might be suitable?
Edit: Posts crossed. I can see that neither file is in any particular order and that your sample does not show a one-for-one match.
It's going to be necessary to sort both files. Does the order of the final output data matter?
Last edited by methyl; 06-13-2012 at 08:35 AM..
7 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hello,
I have got one file with more than 120+ million records(35 GB in size). I have to extract some relevant data from file based on some parameter and generate other output file.
What will be the besat and fastest way to extract the ne file.
sample file format :--... (2 Replies)
Discussion started by: learner16s
2 Replies
2. Shell Programming and Scripting
hi,
I'm trying to sort a file which has 3.7 million records an gettign the following error...any help is appreciated...
sort: Write error while merging.
Thanks (6 Replies)
Discussion started by: greenworld
6 Replies
3. What is on Your Mind?
Here is an easy game!
I wrote a number between 0 and 20 (that can include 0 and 20) on a piece of paper. I am staring at it now, imagining the number so you can read my mind ;)
Reply once, and only once, with a number from 0 to 20 and the first person to guess it wins 1,000,000 Bits.
... (24 Replies)
Discussion started by: Neo
24 Replies
4. Shell Programming and Scripting
I have a log file that is about 1.2 million lines long and about 300MB.
we need a way to clean up this file and only keep the last few thousand lines.
if i use tail command we run our of memory as the file is too big.
I do have a key word to match on.
example, we want to keep every line... (8 Replies)
Discussion started by: robsonde
8 Replies
5. UNIX for Dummies Questions & Answers
Hi,
one of the server, log directory was never cleaned up. We have so many files. I want to remove all the files that starts with dfr* but I get error message when I use the *.
rm qfr*
bash: /usr/bin/rm: Arg list too long
I am trying to write this script but not working.
... (4 Replies)
Discussion started by: samnyc
4 Replies
6. UNIX for Dummies Questions & Answers
Hi,
Which way is faster rm -rf /path/ or find / -name -exec rm {} \; and why? (7 Replies)
Discussion started by: cain82
7 Replies
7. UNIX for Dummies Questions & Answers
Hi,
here is my problem:
I've got a file with 6 columns (file1):
a b c d e f
a b c d e f
a b c d e f
a b c d e f
I need to add 1 million columns to this file, each column needs to be a zero.
Here is how the result file (file2) should look like (for the sake of the example, I've only... (7 Replies)
Discussion started by: zajtat
7 Replies
LEARN ABOUT DEBIAN
vztminer
VZTMINER(1) Dumpfile Data Mining VZTMINER(1)
NAME
vztminer - Data mining of VZT files
SYNTAX
vztminer [option]... [VZTFILE]
DESCRIPTION
Mines VZT files for specific data values and generates gtkwave save files to stdout for future reload.
OPTIONS
-d,--dumpfile <filename>
Specify VZT input dumpfile.
-m,--match <value>
Specifies "bitwise" match data (binary, real, string)
-x,--hex <value>
Specifies hexadecimal match data that will automatically be converted to binary for searches
-n,--namesonly
Indicates that only facnames should be printed in a gtkwave savefile compatible format. By doing this, the file can be used to
specify which traces are to be imported into gtkwave.
-c,--comprehensive
Indicates that results are not to stop after the first match. This can be used to extract all the matching values in the trace.
-h,--help
Show help screen.
EXAMPLES
vztminer dumpfile.vzt --hex 20470000 -n
This attempts to match the hex value 20470000 across all facilities and when the value is encountered, the facname only is printed to std-
out in order to generate a gtkwave compatible save file.
LIMITATIONS
vztminer only prints the first time a value is encountered for a specific net. This is done in order to cut down on the size of output
files and to aid in following data such as addresses through a simulation model. Note also that the reader algorithm attempts to recon-
struct bitblasted nets back into their original vectors but this is not always successful, specifically in the case where the individual
bitstrands are dumped in non-sequential order.
AUTHORS
Anthony Bybell <bybell@rocketmail.com>
SEE ALSO
lxt2miner(1) vzt2vcd(1) lxt2vcd(1) vcd2lxt2(1) gtkwave(1)
Anthony Bybell 3.2.1 VZTMINER(1)