Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
jamii
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
31 ms
·
271.
▲
What 1970s Databases Can Teach Reactive Web Frameworks
(blog.cloudstitch.io)
2 points
by
jamii
12y ago
|
0 comments
272.
▲
by
jamii
12y ago
Awesome :) Great work on the blog by the way, it's going into my morning reading list.
273.
▲
by
jamii
12y ago
I'm working on join algorithms at the moment, so I spent the last few months getting up to speed on the latest research. The rest is just from general interest. I spend around ten hours a week reading papers or textbooks. Whenever I fi
274.
▲
by
jamii
12y ago
http://hyper-db.de/index.html I believe it's closed source and they plan to commercialise it, although I can't figure out where I got that idea from.
275.
▲
by
jamii
12y ago
Some of the more exciting ideas I've seen recently: http://arxiv.org/abs/1310.3314 - Understanding the core difficulty in answering relational queries and examples of problems for which current query optimisers a
276.
▲
by
jamii
12y ago
This series of articles might help you picture how a game could be architected without inheritance: http://bitsquid.blogspot.com/2014/08/building-data-oriented-... A couple of commercial games have been built on t
277.
▲
by
jamii
12y ago
https://developer.mozilla.org/en-US/docs/Mozilla/Projects/XU... I'm not sure if it's still actively developed though.
278.
▲
by
jamii
12y ago
@ibdknox ported Light Table from node-webkit to atom-shell a few weeks ago ( https://github.com/LightTable/LightTable/tree/atom-shell ). I haven't looked at it myself, but I heard some noises from him abou
279.
▲
by
jamii
12y ago
Typed Objects are a huge step forwards but they still have some limitations. I frequently use things like: solverStates = { numVars: uint32 numConstraints: uint32 numStates: uint32 solverStates: solverState[num
280.
▲
by
jamii
12y ago
LLJS is listed here but the last commit is over a year ago. Having spent the last month hand-coding arrays of structs in js, I'm really feeling the need for better low-level constructs. Looks like I'm stuck waiting for rust + emsc
281.
▲
by
jamii
12y ago
This is wonderful work. I wonder how long it will take for software archeology to become a real field? So much is forgotten already.
282.
▲
by
jamii
12y ago
The ocaml runtime is wonderfully simple ( http://rwmj.wordpress.com/2009/08/04/ocaml-internals/ ) and the compiler focuses mostly on good codegen rather than advanced optimisations. In practice, it's
283.
▲
by
jamii
12y ago
That's a reasonable question, I don't see why it was downvoted. We don't plan to make money from Light Table. We will continue to maintain it but our main focus now is Eve ( http://www.chris-granger.com/2014&#x
284.
▲
by
jamii
12y ago
That's for building from source, which is only necessary if you want to back on Light Table itself or write a plugin.
285.
▲
by
jamii
12y ago
The video on the front page of http://lighttable.com was made in April. Most of the changes since then have just been bug fixes so its pretty representative of the current state. Now that we've removed the bottlenecks on o
286.
▲
by
jamii
12y ago
The decisions were largely separate. The goal of having a CA was to leave us the option of selling commercial plugins in the future. We no longer plan to do that so we got rid of it. Separately, we kept hearing that the GPL is a hurdle to a
287.
▲
by
jamii
12y ago
Firstly, dual-licensing requires that all contributors sign a CA, which is enough of a annoyance that many minor fixes just don't get contributed at all. Secondly, Mike Innes ( http://junolab.org/ ) is one of the big con
288.
▲
by
jamii
12y ago
> ...it generated a bunch of errors... What errors did you get? Was it connected to a page that had your code loaded already? > Aside from it needing a browser to do anything with JS... If you eval a html file it will open it in a lo
289.
▲
by
jamii
12y ago
I just ran flow on our js constraint solver and it caught a bug. The dirty checker used && instead of & to check the dirty variables bitflag against the interested propagators bitflag so it was silently doing more work than it h
290.
▲
by
jamii
12y ago
Datalog is relational. Both of those papers show datalog compilers in datalog.
291.
▲
by
jamii
12y ago
That's good to know, thanks.
292.
▲
by
jamii
12y ago
I saw a related issue on emscripten-fastcomp saying they are based off the pnacl fork of llvm, which is why they are lagging behind. I'm hoping we can use rust eventually but it doesnt look like the kind of problem we can just throw mo
293.
▲
by
jamii
12y ago
Unfortunately most (all?) of them have performance costs and we are already eyeing up asm.js for better performance.
294.
▲
by
jamii
12y ago
I really wish I could use rust for my current work, but it has to be runnable in the browser and it looks like it would take a lot of work to get emscripten on to the same version of llvm as rust. I just spent two hours debugging what turne
295.
▲
by
jamii
12y ago
The only good references I know of: http://p2.berkeley.intel-research.net/papers/EvitaRacedVLDB2... http://www.seas.upenn.edu/~mengmeng/papers/datalog2.0.pdf
296.
▲
by
jamii
12y ago
There has been some really interesting work on distributed streaming queries for monitoring/diagnostics eg http://p2.berkeley.intel-research.net/papers/EuroSys2006-deb...
297.
▲
by
jamii
12y ago
> try and optimize duplication away (copy your data flow graph, but memoize and try to reuse) We sort of do that by hand at the moment. Rather than parametrise code , we attach ids to the data that is pushed through it. For example, ins
298.
▲
by
jamii
12y ago
> I thought you were doing this to deal with non-local scope. Non-local data-flow (you can reference any table in a query) but only local control-flow (at the same level as excels 'if' statement) and no scoping (references are
299.
▲
by
jamii
12y ago
> So, ya, the question is "How do you pass information between sub-routines". Nitpicking now, but phrasing it that way supposes the existence of sub-routines. I would prefer to phrase as just thinking about control-flow and dat
300.
▲
by
jamii
12y ago
> So, just write your functions so they don't use parameters (expect for persistence of the program). In fact, you can bypass functions all together. It also makes it a lot easier define and visually represent behavior. I don't
More ›