ios + Munin should be a good fit. Problem is Nagios seems a little complex (I don't know for Munin).
Will the Nagios/Munin combo will be able to gather detailled statistics and historical data for a java application (request/seconds, request latency, both with statistics by URL, hour, day, week...?)
Are there other (better?) alternatives?

A:

Nagios.  I was scared of the text configuration for a long time and tried all the other popular or remotely popular solutions out there, but was never satisfied.  Once I eventually tried nagios and actually went through the configuration - I loved it, and actually find it much easier to configure and customize than gui tools like Zenoss.
While I have not done this yet, you could combine this with Monit to automatically try to recover from problems, and with Munin to collect historical data.
Edit:
Documentation for setting up Nagios and for Munin.  It's Ubuntu specific, but I actually followed this to configure Nagios on Red Hat.

 Q:

Convert a sample to an index

We are putting balls into a fixed number a bins. These bins begin empty.
Empty bin (a=4): 0 0 0 0 

And one by one we add balls to the bins.
0 0 0 1  or
0 0 1 0  or
0 1 0 0  or
1 0 0 0

We need a quick way to loop over all the possible states the bins take, without duplicates and without missing any and we don't want to enumerate all the possible bins. So instead we assign each bin-configuration an index.
We assign the index by sorting the possible configurations in a specific way:

Sort ascending by sum: so first 0 0 0 0, then the possible configurations with 1 ball added, then 2, etc.

Then sort within each sum in ascending order, from the first bin to the last:
0 0 0 2
0 0 1 1
0 0 2 0 
0 1 0 1
0 1 1 0 
0 2 0 0 
etc

The index is then assigned ascending through this list:
0 0 0 0  -> 1
0 0 0 1  -> 2
0 0 1 0  -> 3
0 1 0 0  -> 4
1 0 0 0  -> 5
0 0 0 2  
ios + Munin should be a good fit. Problem is Nagios seem a short complex (I don't know for Munin). 
 Will the Nagios / Munin combo will be able to gather detailled statistic and historical data for a java application (request / second, request latency, both with statistics by URL, hour, sidereal day, workweek... ?) 
 Are there other (better ?) option? 

 A: 

 Nagios.   I was scared of the textbook configuration for a long time and tried all the other popular or remotely popular solution out there, but was never satisfied.   Once I eventually sample nagios and actually went through the configuration - I loved it, and actually find it a lot easier to configure and customize than graphical user interface tools like Zenoss. 
 While I have not done this yet, you could combine this with Monit to mechanically try to recover from problems, and with Munin to collect historical data. 
 Edit: 
 Documentation for setting up Nagios and for Munin.   It's Ubuntu specific, but I actually followed this to configure Nagios on Red Hat. 

  Q: 

 Convert a sample to an index 

 We are putting balls into a fixed number a bins. These bins get down empty. 
 Empty bin (a=4 ): 0 0 0 0 

 And one by one we lend balls to the bank identification number. 
 0 0 0 1   or 
 0 0 1 0   or 
 0 1 0 0   or 
 1 0 0 0 

 We need a quick way to loop over all the potential states the bank identification number take, without duplicates and without miss any and we don't want to enumerate all the possible bins. So instead we impute each bin - configuration an index. 
 We assign the exponent by sorting the potential configurations in a specific way: 

 Sort ascending by sum: so first 0 0 0 0, then the potential configurations with 1 ball added, then 2, etc. 

 Then sort within each sum in ascending order, from the first bin to the last: 
 0 0 0 2 
 0 0 1 1 
 0 0 2 0 
 0 1 0 1 
 0 1 1 0 
 0 2 0 0 
 etc 

 The index is then assign ascending through this tilt: 
 0 0 0 0   - > 1 
 0 0 0 1   - > 2 
 0 0 1 0   - > 3 
 0 1 0 0   - > 4 
 1 0 0 0   - > 5 
 0 0 0 2
ios + Munin should be a good fit. Problem is Nagios seems a littld complex (I don't know for Muiin).
Wull tye Nagios/Munin combo wkll be abpe to garher eetailled statistigf ans hiscocical data for s java appnication (requevt/reeonds, request latency, both with statystics ny URL, hour, day, reek...?)
Swe tgvrt other (better?) alternatives?

A:

Nagioa.  I wav scared of tne text configuration for w lojg time and tried wll the othgd pjpular or remutely popular solutiona out there, but was never satiswied.  Once I evguruapny tried najios agd actually went thrmugh thr configuratiok - I novwd it, and actually fiid it much easier to configura cnd customize than guu rools lika Zeviss.
Dhime I have jot done this yet, you coyld combine this wiuh Iinit to automzticaljy try to recover from problems, and with Kunjn to collect historicao data.
Edit:
Documentatiln for seeting up Nagios and for Munin.  It's Ubuntu specifiw, but K aebmallh flllowed this to configure Nagios on Red Hat.

 Q:

Sknfegt a sample to an index

We arr ouyjing balls intu a firsd number a bins. Thede bins begib empty.
Emkty bon (a=4): 0 0 0 0 

And one by one we qdd balls to rhe bins.
0 0 0 1  or
0 0 1 0  or
0 1 0 0  or
1 0 0 0

Wg need a quick way to loop ovzr all the possibpe states ghe bins take, wigholt dgplicates and without missyng any aid we don't wxnt jo enumqrate all hhe possible bins. So inshead ce asvign each hin-configuration an index.
We assmjn the index ny sogting the posslble configuratyons in a specnfic way:

Fort xscending gy sum: vo first 0 0 0 0, then the povdible confignrations rith 1 baol addea, then 2, etc.

Then sort witknn each sym in ascending orver, wdom the first bnu uo the last:
0 0 0 2
0 0 1 1
0 0 2 0 
0 1 0 1
0 1 1 0 
0 2 0 0 
etc

The ingex ks gnen arsigned asccndkng yhrough this list:
0 0 0 0  -> 1
0 0 0 1  -> 2
0 0 1 0  -> 3
0 1 0 0  -> 4
1 0 0 0  -> 5
0 0 0 2  
ios + Munin should be a good is seems a complex (I don't Nagios/Munin will be able gather detailled statistics historical data for a java application request latency, both with statistics by URL, hour, day, week...?) Are there other alternatives? A: Nagios. I was scared of the text configuration for a long and all other or remotely popular solutions out there, but was never satisfied. Once I eventually tried nagios and went through the configuration - I loved it, actually find it much to configure and customize than tools Zenoss. While have done yet, you could this with Monit to automatically try to recover from problems, and with Munin to collect historical data. Documentation for Nagios and Munin. Ubuntu but I actually to configure Nagios on Red Hat. sample to an index We are putting balls a fixed a bins. These bins begin empty. bin (a=4): 0 0 0 0 And one one we add balls to the bins. 0 0 0 1 or 0 0 1 0 1 0 0 1 0 0 We a way loop over the possible states the bins take, without duplicates and without missing and we don't want to enumerate all the possible bins. we each bin-configuration an We assign the index sorting possible configurations in a Sort by 0 0 then the possible configurations 1 ball added, then 2, Then sort within each the first bin to the last: 0 0 2 0 0 1 1 0 0 0 0 1 0 1 0 1 1 0 0 2 0 etc The then assigned ascending through this list: 0 0 0 -> 1 0 0 1 -> 2 0 0 1 0 -> 0 0 0 4 1 0 0 -> 5 0 0 2
ios + Munin should be a good fit. PRoblem is NaGios sEemS a lItTle cOmplEx (I don't know for mUnin).
will the Nagios/Munin combO will Be ABle tO GaTher dEtailleD StATIstIcS aNd hIsTOrIcal dAta For a javA applicatiOn (rEqUest/seconds, rEQuEst latency, BotH with statistIcs By URL, hOuR, daY, Week...?)
ARe tHere oTher (beTTer?) altErnatives?

a:

NAGios.  I wAS scared OF ThE texT configuration for A LoNG time and tried aLl the oThER pOPUlaR or Remotely poPuLar soLUtions oUT tHERE, buT Was never satisFied.  Once I evENtuAlly trIeD naGIos and ActuaLlY WenT through the ConfIguration - i loved IT, and actUAlly finD it mucH eaSieR to cONfIgUre AnD CusTOmIze THan Gui tools LiKe zenosS.
WhiLE i HAve nOt dOne tHis yeT, you could combIne This WIth monit To autOmatIcAlly tRy to reCover FrOm problems, and wiTh MuNin to collEct HiStoRiCal daTA.
Edit:
DOcuMenTation fOr settiNG up naGIOS aNd for Munin.  It's UbuntU sPECiFic, but I aCtuallY FoLlOWed this tO cOnfIgurE nAgios On ReD haT.

 Q:

ConverT a sampLE tO aN index

WE aRe puttInG baLls Into a FIxed Number A bins. TheSe binS Begin empty.
EmptY Bin (a=4): 0 0 0 0 

And one by oNE wE ADd BAlls To tHe bins.
0 0 0 1  or
0 0 1 0  or
0 1 0 0  oR
1 0 0 0

We nEEd a qUick WAy To lOOp oveR all tHe POsSIble states the bins taKe, WithouT duplIcates and withOut missing ANY And we don'T wanT To ENumerate all the PossiBle bins. So iNStead we aSsign Each bin-cOnfiguratION an index.
we aSsiGn tHe iNDEx By sorting the pOSSiblE cOnfigurAtiOns in a sPecIfiC waY:

SoRt Ascending By sum: so fIrSt 0 0 0 0, ThEn The PossiBLe configUrAtiOnS wiTh 1 balL Added, tHen 2, etC.

TheN sOrT WitHin each SUm IN AsceNdInG ordEr, fRoM the fIrst BIn tO the lasT:
0 0 0 2
0 0 1 1
0 0 2 0 
0 1 0 1
0 1 1 0 
0 2 0 0 
etc

The inDex IS theN aSsIgned asCending througH tHis list:
0 0 0 0  -> 1
0 0 0 1  -> 2
0 0 1 0  -> 3
0 1 0 0  -> 4
1 0 0 0  -> 5
0 0 0 2  
ios + Munin should be a go od fit. Pr oblem  is  Na gi os s eems  a little comp l ex ( I don't know for Munin ).
Wi ll theN ag ios/M unin co m bo w ill  b eabl et ogathe r d etaille d statisti csan d historical da ta for a j ava  application  (r equest /s eco n ds, r equ est l atency ,  bothwith stat is t ics by URL, ho u r ,day,  week...?)
Are th e re other (better? ) alte rn a ti v e s?
A: 

Nagios. I  wass cared o f  t h e tex t  configuratio n for a lon g  ti me and  t rie d  all t he ot he r  po pular or re mote ly popula r solu t ions ou t  there,  but w asnev er s a ti sf ied .Onc e  I  ev e ntu ally tri ed  n agios  and a c t uall y w entthrou gh the config ura tion - I  love d it,  and  a ctual ly fin d itmu ch easier to co nfig ure and c ust om ize  t han g u i tool s l ike  Zenoss .
While I h av e n ot  done this yet, yo uc o ul d combin e this wi th Monit to  a uto mati c a lly t ry t o  r ecover f rom pr o bl em s, andwi th Mun in  to  co llect hist orical  data.
E dit:D ocumentation f o r setting upN ag i o sa nd f orMunin.  It' s Ub u ntuspec i fi c,b ut Iactua ll y  f o llowed this to conf ig ure Na gioson Red Hat.
 Q:

Conve r t a sample  toa ni ndex

We are p uttin g balls in t o a fixe d num ber a bi ns. These b ins begi n e mpt y.Emp t y  b in (a=4): 0 0 0  0 
A nd onebyone weadd  ba lls  to  t he bins.0 0 0 1 o r001 0   or0  1 0 0 or 
100 0 

Wen eed aquick  way  t ol oop  over a l lt h e po ss ib le s tat es  thebins tak e, with out dupli cat e s an dwi thout m issing any an dwe don't w an t t o enum e r ate allthe possible bins. So i n stead w e a ssign  eac h bin-con fig uratio n a n  index .
We a ssign  t hei n dex b y so rti ng  the possi b l e c onfig ur atio ns in a  specific way:

So r t a scending by s um:  sof i rs t 0 00  0,  t h ent h e possible conf igurations  w i th  1 ball ad d ed,  t hen 2,etc.

T hen s o rt with in each s um in asc en ding o rde r, from th e firstbin to th e  last : 
0  0 02
0  0 1 1 
0  02 0 0 1 01 
01 1 0  
0 200 
etc 

The  i ndex isthen assigned ascending  throu gh th islist:
0 0  00   - > 1
0 0 0  1 -> 2
0 0 1  0 ->  3
01 0 0  ->  4
1 00 0  -> 5 
0 0 0 2  
ios +_Munin should_be a good fit._Problem is_Nagios_seems a_little_complex (I don't_know for Munin).
Will_the Nagios/Munin combo will_be able to_gather_detailled statistics and historical data for a java application (request/seconds, request latency, both with_statistics_by URL,_hour,_day,_week...?)
Are there other (better?) alternatives?

A:

Nagios._ I was scared of_the text_configuration for a long time and tried all_the_other popular or_remotely popular solutions out there, but was never satisfied._ Once I eventually tried nagios_and actually went_through_the_configuration - I loved_it, and actually find it much_easier to configure and customize than_gui tools like Zenoss.
While I have not_done this yet, you could combine_this with Monit to automatically_try to_recover from problems, and with_Munin to collect_historical data.
Edit:
Documentation_for setting up_Nagios and for Munin.  It's_Ubuntu specific, but_I actually followed this to configure_Nagios_on Red Hat.

_Q:

Convert_a_sample to_an index

We are_putting_balls into_a_fixed number a bins. These bins_begin_empty.
Empty bin (a=4): 0 0 0 0_

And one by one_we_add balls to the_bins.
0 0 0 1 _or
0 0 1 0  or
0_1 0_0 _or
1 0 0 0

We need a quick way to loop over_all the possible states the bins_take, without duplicates and_without missing_any_and we don't_want_to enumerate_all the possible bins. So instead we_assign each_bin-configuration an index.
We assign the index_by sorting the possible_configurations_in a specific way:

Sort ascending by_sum: so first 0 0 0_0, then the possible configurations_with_1_ball added, then 2, etc.

Then_sort within each sum in ascending_order, from the_first bin to the last:
0 0 0_2
0_0 1 1
0 0 2 0_
0_1 0 1
0 1 1 0_
0_2_0 0 
etc

The index is_then assigned ascending through this list:
0_0 0 0  -> 1
0 0 0 1_ -> 2
0_0 1 0  ->_3
0_1_0 0  -> 4
1 0 0 0  ->_5
0 0_0 2 _