Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
DrJosiah
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
30 ms
·
271.
▲
Read about the design of a new NoSQL database while it's being built
(dr-josiah.blogspot.com)
2 points
by
DrJosiah
16y ago
|
0 comments
272.
▲
by
DrJosiah
16y ago
import * is the devil, really don't use it. Instead, hack up this recipe: http://code.activestate.com/recipes/277940-decorator-for-bin... to inject the common tags into the local namespace of the function. It will have the side-effect o
273.
▲
by
DrJosiah
16y ago
There is more to business logic than database calls. And there is more to modern web development than your backend language and your templating language (hello javascript, jquery, yui, mootools, etc.). Again, as I stated earlier, reducing t
274.
▲
by
DrJosiah
16y ago
I built a variant of this style a couple years back http://code.activestate.com/recipes/440563-yet-another-reinv... . I used it to generate static content in advance, but it could have easily been used for dynamic content. In my experien
275.
▲
by
DrJosiah
16y ago
It is definitely neat that you can take a language like C# and make it dynamic... but it would seem to be a lot more sane to just use the IronPython or IronRuby, or even the plain Python or Ruby runtimes themselves. Use a language for what
276.
▲
Some initial ideas on SSD database tuning
(dr-josiah.blogspot.com)
5 points
by
DrJosiah
16y ago
|
0 comments
277.
▲
Building a search engine using Redis and redis-py
(dr-josiah.blogspot.com)
2 points
by
DrJosiah
16y ago
|
0 comments
278.
▲
by
DrJosiah
16y ago
Gensim has LSI and SVD clustering for data, and is in Python. http://nlp.fi.muni.cz/projekty/gensim/ There is also SVM Lite, which can do much of the same things with potentially less work from you. I've not used it, so I don't know how
279.
▲
by
DrJosiah
16y ago
boost::unordered_set is an in-memory hash table, not unlike std::hash_set (which may save you some download/link time). Note that the blog post discusses your options when your data is too large to fit in memory. Most hash tables operate u
280.
▲
by
DrJosiah
16y ago
I mention that in the post, get specific with the characteristics of the particular B+Tree that we just constructed, and even link off to the relevant Wikipedia entry. :)
281.
▲
Beating Interpolation Search & Binary Search
(dr-josiah.blogspot.com)
29 points
by
DrJosiah
16y ago
|
6 comments