Here is the solution...it is in shell scripting..thought it will help..
put the below line in a file(except ---start-- and ---end-- line) and give
some name say "test_log.ksh"
--start---
#!/bin/ksh
file_name=$1
if [[ -f path.txt ]] ; then
rm ./path.txt
fi
if [[ -f
How about a multidimensional hashing with keys as Webpage?
On Mon, Jul 25, 2011 at 5:32 PM, Sandeep Jain wrote:
> This is similar to Frequent Pattern algorithms studied under data mining.
> You may refer FP Growth tree.
>
>
> Regards,
> Sandeep Jain
>
>
>
>
> On Mon, Jul 25, 2011 at 3:46 PM, sra
This is similar to Frequent Pattern algorithms studied under data mining.
You may refer FP Growth tree.
Regards,
Sandeep Jain
On Mon, Jul 25, 2011 at 3:46 PM, sravanreddy001 wrote:
> how about traversing the list once.. but.. looking at the user level.
> now.. we make a hashtable kind of entr
how about traversing the list once.. but.. looking at the user level.
now.. we make a hashtable kind of entry.. adding 1 to the count for each of
the combinations that comes in.
if the logs are tricky.. like.. joe's 3rd page comes after sam's 1st page in
the log.
then.. the logs first have to b
