in reply to index for large text file

When all the blocks are of the same length, you don't even need to build an index. 
# the usual precautions
use strict;
use warnings;

# automatically die when open() or so fails
use autodie;

my $filename = shift @ARGV;
open my $handle, '<', $filename ;

# determine the block length
my $first_block = '';
$first_block .= <$handle> for 1..4;
my $block_length = length $first_block;

sub get_line {
   my ($handle, $block_length, $line) = @_;
   
   # assume the file starts with line 1:
   seek $handle, $block_length * ($line - 1), 0;
   my $result;
   my $read_len = read $handle, $result, $block_length;
   if ($read_len == $block_length) {
       return $result
   } else {
       die "Error while reading file: expected $block_length bytes, bu
+t got $read_len instead";
   }
}

[download]

(untested)

Perl 6 - second systems done right

Replies are listed 'Best First'.
Re^2: index for large text file
by cafeblue (Novice) on Mar 28, 2011 at 06:52 UTC

    thank you for your advice!!

    but the odd lines are not of the same length. maybe your solution would get a wrong result. but you give me a good advice!

    I change the pack parameter from "N" to "L", maybe the "L" could be enough to store the line number, while the "N" is not long enough.

    thank you!

[reply]
      I change the pack parameter from "N" to "L", maybe the "L" could be enough to store the line number, while the "N" is not long enough.

      Both "N" and "L" are 32-bit usigned integers, so that's not going to make a (useful) difference.  They only differ with respect to byte order:

      • "N" — 32-bit unsigned integer in big-endian byte order
      • "V" — 32-bit unsigned integer in little-endian byte order
      • "L" — 32-bit unsigned integer in native byte order of the architecture perl is running on

      A 32-bit unsigned int can hold values up to 4294967296 (4G). If you need to store larger values, you could use the "Q" template (64-bit), if your build of perl supports it.  Otherwise - or if you want to save space - you could just "add" another single byte ("C"), so you have 5 bytes / 40-bit in total — which would be able to handle indices of up to around 1 Terabyte: 

      my $i = 78187493530;

write_index($i);
print read_index();  # 78187493530

sub write_index {
    my $i = shift;
    open my $f, ">", "myindex" or die $!;
    my $pi = pack("CN", $i / 2**32, $i % 2**32);
    print $f $pi;    # writes 5 bytes
    close $f;
}

sub read_index {
    open my $f, "<", "myindex" or die $!;
    read $f, my $pi, 5;
    my ($C, $N) = unpack "CN", $pi;
    return $C * 2**32 + $N;
}

      [download]

      This works even with 32-bit-int perls, because then numbers larger than 32-bit are handled as floats internally.

[reply]
[d/l]
[select]

        thank you!

        after I change "N" to "L", indeed there are still some wrong lines! you are right !

        I will try your solution!

[reply]

        So "Q" is not supported on my architecture and my file is 100GB+ with variable length lines. I'm a little confused with your code. is $i the offset?<\p>

        If I wanted to rebuild the entire index with the following code what would I change.

        sub build_index {
        my $data_file = shift;
        my $index_file = shift;
        my $offset = 0;

        while (<$data_file>) {
                print $index_file pack("N", $offset);
                $offset = tell($data_file);
        }
}

sub line_with_index {
        my $data_file = shift;
        my $index_file = shift;
        my $line_number = shift;

        my $size;
        my $i_offset;
        my $entry;
        my $d_offset;

        $size = length(pack("N", 0));
        $i_offset = $size * ($line_number-1);
        seek($index_file, $i_offset, 0) or return;
        read($index_file, $entry, $size);
        $d_offset = unpack("N", $entry);
        seek($data_file, $d_offset, 0);
        return scalar(<$data_file>);
}

        [download]
[reply]
[d/l]
[reply]

In Section Seekers of Perl Wisdom