Re: best way to index numerical text data ?



On 31 Mar 2006 08:45:53 -0800, "Jack" <jack_posemsky@xxxxxxxxx> wrote
in comp.lang.c:

Hi I have a lot of data that is in a TEXT file which are numbers does
anyone have a good suggestion for indexing TEXT numbers (zip codes,
other codes, dollar amounts, quantities, etc). since Lucene and other
indexers are really optimized for Alpha character indexing. What
approaches are typically taken in computer science for example to index

text numbers..hash maps or something else ??

Thank you,

Jack

I don't see any question here about the C language. If you are
looking for an algorithm, I would suggest asking in
news:comp.programming.

Once you have selected an algorithm, if you have problems writing a
standard C program to implement it, then ask for help here.

--
Jack Klein
Home: http://JK-Technology.Com
FAQs for
comp.lang.c http://c-faq.com/
comp.lang.c++ http://www.parashift.com/c++-faq-lite/
alt.comp.lang.learn.c-c++
http://www.contrib.andrew.cmu.edu/~ajo/docs/FAQ-acllc.html
.



Relevant Pages

  • Algorithm for license codes
    ... I know that posting here the details of a new algorithm would irk most of us, but this is the only place I know where I can ask for a reliable advice. ... I'm studying the feasibility of an algorithm based on public key cryptography that is suited for generating strong license codes for product activation. ... The public key part are the polynomials, the private part are an equivalent representation of the polynomials such that it's easy, given Y, to compute the reverse X = F^-1. ...
    (sci.crypt)
  • Re: A Revolutionary Breakthrough in Data Compression!
    ... What I have got is a minor improvement of the classic Huffman ... This is usually addressed by modifying the algorithm to arrange the ... even require rearrangement of the codes: ...
    (comp.compression)
  • Re: Generating a large sequence of unique, random numbers
    ... > Generate n unique codes of length l so that they are non-predictable. ... > whatsoever which algorithm to use or how to start in general. ... Luby-Rackoff construct, using F1..F4, producing L' and R'. ... Use that to encrypt the ...
    (sci.crypt)
  • Re: Adaptive Huffman algorithm with syllable compression?
    ... I had now a closer look at LZW algorithm and no it isn't LZW. ... 12 Bit long codes, and so on. ... I don't understand which element make you thinking about Adaptive Huffman. ... don't understand how the syllable compression is integrated in this. ...
    (comp.compression)
  • Re: sparse polynomial arithmetic
    ... Remaining within the boundaries of this representation (which are ... do arithmetics directly on codes ... perfect hash values in a hash set ... The algorithm first checks if the exponents of the polynomials to be ...
    (sci.math.symbolic)