11-13-2014
Quote:
Originally Posted by
DGPickett
I wrote a "locality of reference" sort once: mmap64() the file and start sorting by making 2 lists of one line, then a linked list of 2 lines sorted, twice, and then merge them, then again, then merge the two sets of 4, etc.
This seems to be what is classically called
merge sort. In the wikipedia article there are also its Landau symbols for runtime estimates.
I hope this helps.
bakunin
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I am trying to understand the webserver log file for an error which has occured on my live web site.
The webserver access file is very big in size so it's not possible to open this file using vi editor. I know the approximate time the error occured, so i am interested in looking for the log file... (4 Replies)
Discussion started by: sehgalniraj
4 Replies
2. Shell Programming and Scripting
Hi All
I have approximately 10 files that are at least 100+ MB in size. I am importing them into a DB to output them to the web. What i need to do first is clean the files up so i dont have un necessary rows in the DB. Below is what the file looks like:
Ignore the <TAB> annotations as that... (4 Replies)
Discussion started by: caddyjoe77
4 Replies
3. UNIX for Dummies Questions & Answers
How do we check 'large files' is enabled on a Unix box -- HP-UX B11.11 (2 Replies)
Discussion started by: ranj@chn
2 Replies
4. UNIX for Dummies Questions & Answers
I was wondering how sort works.
Does file size and time to sort increase geometrically?
I have a 5.3 billion line file I'd like to use with sort -u I'm wondering if that'll take forever because of a geometric expansion?
If it takes 100 hours that's fine but not 100 days.
Thanks so much. (2 Replies)
Discussion started by: dcfargo
2 Replies
5. Shell Programming and Scripting
hello all,
kindly i need your help, i made a script to print a specific lines from a huge file about 3 million line. the output of the script will be about 700,000 line...the problem is the script is too slow...it kept working for 5 days and the output was only 200,000 lines !!!
the script is... (16 Replies)
Discussion started by: m_wassal
16 Replies
6. Shell Programming and Scripting
Hello everyone!
I have 2 types of files in the following format:
1) *.fa
>1234
...some text...
>2345
...some text...
>3456
...some text...
.
.
.
.
2) *.info
>1234 (7 Replies)
Discussion started by: ad23
7 Replies
7. UNIX for Dummies Questions & Answers
Hi all,
I have problem with searching hundreds of CSV files, the problem is that search is lasting too long (over 5min).
Csv files are "," delimited, and have 30 fields each line, but I always grep same 4 fields - so is there a way to grep just those 4 fields to speed-up search.
Example:... (11 Replies)
Discussion started by: Whit3H0rse
11 Replies
8. Solaris
Hello everyone. Need some help copying a filesystem. The situation is this: I have an oracle DB mounted on /u01 and need to copy it to /u02. /u01 is 500 Gb and /u02 is 300 Gb. The size used on /u01 is 187 Gb. This is running on solaris 9 and both filesystems are UFS.
I have tried to do it using:... (14 Replies)
Discussion started by: dragonov7
14 Replies
9. UNIX for Advanced & Expert Users
Hello all -
I am to this forum and fairly new in learning unix and finding some difficulty in preparing a small shell script. I am trying to make script to sort all the files given by user as input (either the exact full name of the file or say the files matching the criteria like all files... (3 Replies)
Discussion started by: pankaj80
3 Replies
10. Shell Programming and Scripting
Hello,
I have a very large file of around 2 million records which has the following structure:
I have used the standard awk program to sort:
# wordfreq.awk --- print list of word frequencies
{
# remove punctuation
#gsub(/_]/, "", $0)
for (i = 1; i <= NF; i++)
freq++
}
END {
for (word... (3 Replies)
Discussion started by: gimley
3 Replies
LEARN ABOUT DEBIAN
unsort
UNSORT(1) BSD General Commands Manual UNSORT(1)
NAME
unsort -- reorder lines in a file in semirandom ways
SYNOPSIS
unsort [-hvrpncmMsz0l] [--help] [--version] [--random] [--heuristic] [--identity] [--concatenate] [--merge] [--merge-random] [--seed integer]
[--zero-terminated] [--null] [--linefeed] [file ...]
DESCRIPTION
unsort prints the lines in the input files (or standard input) in semi-random order. Available algorithms are a Mersenne Twister based PRNG
and a heuristic algorithm that aims to create a subjective even distribution.
Command line options
-h, --help
Display a concise summary of the available options and argument syntax.
-v, --version
Display version and copyright information.
-r, --random
Use the Mersenne Twister based randomization algorithm.
-p, --heuristic
Use the heuristic "shuffling" algorithm which permutes the lines in such a way that they're spread more or less evenly in the output.
This is the default.
-n, --identity
Do not reorder lines in the input. Useful if you just want to merge the files.
-r, --concatenate
Concatenate all input files then apply the shuffling algorithm to the result as a whole.
-m, --merge
Shuffle all input files seperately then merge the result. Equal-sized files will be merged in the order in which they appear on the
command line.
-M, --merge-random
Shuffle all input files seperately then merge the result. Equal-sized files will be merged in random order. This is the default.
-s, --seed integer
Use this integer as a seed, instead of random data from the environment.
-z, --zero-terminated, -0, --null
Lines are terminated with a character.
-l, --linefeed
Lines are terminated with a
character. This is the default.
SEE ALSO
sort(1)
Free Software June 1, 2019 Free Software