Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
We have a big trie in our server-side service which has something like tens of millions of nodes. Whole trie takes about 4 gigs of RAM. Until now we used only the basic binary .NET serialization for storing the trie in a file and reconstructing it back in memory. But it's way too slow... What are the better serialization algorithms in our case, some kind of direct mmap-like trick would be great but .NET doesn't permit custom memory allocators. The aim is to minimize saving and especially loading the trie from the file (filesize is not our concern).
Notice: We absolutely can't use relational databases for that because of the latencies.
Update: Well, we've found this similar question Persisting a trie to a file - C. C community seems better suited for this kind of questions ;) => Accepting protobuf.net solution.
The accepted "fastest serializer" for .net is ProtoBuf.net by a long way the fastest and smallest serializer. http://damienbod.wordpress.com/2014/01/09/comparing-protobuf-json-bson-xml-with-net-for-file-streams/
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 2 years ago.
Improve this question
Im looking for fast database to objects mapper (postgresql db) in C# for 200 000+ rows with features like database updating rows/scheme auto updating. Generally I need to rewrite Java software to C# and looking for alternative to Java Hibernate (would be nice to have all those features but also it must be fast).
I appreciate any recommendations
if its just about performance and database to objects mapping I would recommend Dapper. Dapper is about as fast as it gets. If you want full functionality with lots of documentation and examples I would recommend Entity Framework Core.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 4 years ago.
Improve this question
I want to have a spectrum analyzer as similar as possible to the one in Winamp (v5).
I tried http://wpfsvl.codeplex.com/ but the result is not nearly as good as in Winamp.
For example, if I put the chirp sound (http://en.wikipedia.org/wiki/File:Linchirp.ogg) through it, Winamp seems to be much more accurate. With the C# example, the frequencies seem to "bleed" outside and so everything is much less pronounced. Also in general with any music, Winamp will pronounce everything much more and it's much more clear, in the C# one it's all very "blurry". E.g. when drums hit, in winamp this will be very obvious on the left part of the analyzer, while in the C# example it is hardly noticable.
Winamp is not accurate, it's tuned so it looks good. For example, it DOESN'T have exact values, but does 'falloff' of the values so it look natural.
To emulate it, you'll have to go beyond mere FFT and eventual binning of the results.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I am looking for a spatial index library in C# that has to be able to index geometries (circles, polygons, polylines) as well as answer intersection questions. I found NetTopologySuite (NTS) and some other one-file solution project but I wonder if I missed anything significant?
NTS is pretty good but somewhat heavy. The second one is a one man art and apparently I have to pick it up and maintain myself. I wonder if I can find something that is supported and tested.
I am looking for C# one but if I can get hands on Java one, I can adapt that.
libspatialindex seems to have all the features you want, but it's in C++
JSI is a Java project, but it only works with rectangles.
I am not 100% sure but i guess Solr and Elastic search supports spatial index. They are in Java and they support REST.
I found some good examples here http://www.rtreeportal.org/
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 5 years ago.
Improve this question
It's pretty much all in the title: what library would you recommend to perform principal component analysis? I'm looking for free and simple to use - performance is not necessarily a criterion so far as I just want to play around with the concept and see what I get. Google got me this:
http://crsouza.blogspot.com/2009/09/principal-component-analysis-in-c.html
Anyone tried this? How good is it? Would you have any other recommendation?
I have used PCA in SPSS and Matlab. This is a good place to start learning it, as those applications have already got all the infrastructure ready for you (like lots of plots and supportive tests).
If you are looking for something in C#, take a look at the Accord framework and maybe this sample here
Thanks for the help guys. I eventually decided to implement the algorithm myself, using Math.Net Numerics to lay the matrix groundwork and ARPACK to do the hard work of finding the biggest eigenvectors of the correlation matrix (I don't need of all them). Subject closed.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
I'm looking for a well tested simple in-memory binary tree implementation for c#. I would appreciate any pointers...
The .NET framework already contains them, they are just not advertised as such. Probably because of the inherent ambiguity in the three different ways to iterate a tree. SortedDictionary uses a self-balancing red-black tree under the hood and has the same time and space complexity as a binary tree. You'll need SortedList if your tree contains duplicates.
How about this article on MSDN? (An Extensive Examination of Data Structures Using C# 2.0 ).
Here is a very well tested one: SortedList
You could try this implementation found at CodeProject. Has worked for me.