data structures - Statistical performance of purely functional maps and sets -


given data structure specification such purely functional map known complexity bounds, 1 has pick between several implementations. there folklore on how pick right one, example red-black trees considered faster, avl trees have better performance on work loads many lookups.

  1. is there systematic presentation (published paper) of knowledge (as relates sets/maps)? ideally see statistical analysis performed on actual software. might conclude, example, there n typical kinds of map usage, , list input probability distribution each.

  2. are there systematic benchmarks test map , set performance on different distributions of inputs?

  3. are there implementations use adaptive algorithms change representation depending on actual usage?

these research topics, , results given in form of conclusions, while statistical data hidden. 1 can have statistical analysis on own data though.

for benchmarks, better go through implementation details.

the 3rd part of question subjective matter, , actual intentions may never known @ time of implementation. however, languages perl best implement highly optimized solutions every operation.

following might of help: purely functional data structures chris okasaki http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf


Comments

Popular posts from this blog

monitor web browser programmatically in Android? -

Shrink a YouTube video to responsive width -

wpf - PdfWriter.GetInstance throws System.NullReferenceException -