anonetal

4 ms·

1.
by anonetal 7y ago
From the earlier cited paper, this seems to target relatively simple proofs too (i.e., hardly what "expert mathematicians can prove"): "... a broad coverage of basic mathematical theorems on calculus and the formal proof of t
2.
by anonetal 8y ago
As another comparison point, my volt does about 3.5 miles per kWh at 60-65mph on a highway and close to double that at 20-30mph in cities. And it’s not that light.
3.
by anonetal 8y ago
Datomic doesn't have cryptographically-guaranteed immutability -- its logical data model is immutable and so you can query the past versions of data etc., but there isn't anything stopping one from altering the history. In a ledge
4.
by anonetal 8y ago
OrientDB is a good open-source database that exposes a primarily object data model (the document and graph abstractions are built on top of it). Lack of a good query language and scalability issues doomed those. Mike Stonebraker ( https:&#x
5.
by anonetal 8y ago
Regarding 2: note that this is not the Cambridge Analytica data, rather similar data collected by researchers at Cambridge.
6.
by anonetal 8y ago
Regarding (1), they could just lease the cars from the car manufacturers. As I recall, that was one of the reasons why GE invested so heavily in Lyft.
7.
by anonetal 9y ago
I don't know about Neptune -- curious to hear what it is based on -- but TitanDB never really supported cross-machine traversals for the execution engine. The data was stored in a distributed fashion (across say a Cassandra cluster), b
8.
by anonetal 9y ago
I don't think this is that straightforward. One of the comments on the article said it nicely: graduate students are still being trained and are not very effective researchers, and they are getting a significant education in doing rese
9.
by anonetal 9y ago
There is lot of somewhat-researchy work on this topic, the primary one being the effort at Microsoft Research, called AutoAdmin, that started about 20 years ago. They looked at automatically creating indexes, views, histograms, and stuff li
10.
by anonetal 9y ago
Yes, I was just reading through that. The server is still single-threaded though -- they are getting the parallelism by starting multiple processes to do independent chunks of work. This makes sense for PostgreSQL, but has some fundamental
11.
by anonetal 9y ago
Aside from tooling, those systems often perform much better than PostgreSQL for large queries or transactions, as they feature much better optimizations. Even outside of newer optimizations like "columnar" storage, several of thos
12.
by anonetal 9y ago
Actually the queens problem starting with an empty board is not NP-Hard. See: https://cstheory.stackexchange.com/questions/12682/is-the-n-... The "completion" problem is the NP-Hard one. As one of the ot
13.
by anonetal 9y ago
The million-dollar prize just appears to be the Clay Institute's prize for solving P vs NP. I am guessing that the queens problem (a special case of maximum independent set in a graph) is NP-Hard.
14.
by anonetal 9y ago
The parallelization problem doesn't really go away though, since you still need to figure out how to do that to exploit all the cores effectively.
15.
by anonetal 10y ago
This appears to be a paper written for satisfying a CS Master's degree requirement. If you are looking for a survey on this topic, this is probably a better starting point: https://arxiv.org/abs/1504.00616
16.
by anonetal 10y ago
This is in line with the tenure cases that I have seen (across US) -- the department votes tend to be in early Fall, and the case makes its way through the rest of the univ over the next 5-6 months.
17.
by anonetal 10y ago
It's not very efficient if you have a large number of triggers. There was an early research prototype called Triggerman ( http://ieeexplore.ieee.org/document/754942/ ) which attempted to scale triggers, but mos
18.
by anonetal 10y ago
There is quite a bit of work on this topic in Databases, and stream processing is one of the primary use cases they identified (in particular, if you can put the FPGA device between the network and the CPU, it works out quite well). This is
19.
by anonetal 10y ago
This (CMU Course) is a graduate research-oriented course, with lots of research papers as required reading. 6.830 is a standard introductory database course (although somewhat more advanced than other introductory database courses like Stan
20.
by anonetal 10y ago
I think the following is a better references for putting unstructured property graphs or RDF into relational schemas. SQLGraph: An Efficient Relational-Based Property Graph Store; SIGMOD 2015. Previous hackernews discussion: https:/&#
21.
by anonetal 10y ago
There are several startups in that space, e.g., Domino Data Labs, that have been trying to make it easy to do collaborative/versioned notebooks. I have only seen the product videos so don't know how well they work etc.
22.
by anonetal 10y ago
Thanks for that link. However, they appear to conclude Flink and Storm are quite similar in performance. If you really need low latencies, it is quite likely that none of these will work for you anyway and you would have to build a speciali
23.
by anonetal 10y ago
That paper is excellent and serves as a great intro for a graduate database course. It would be remiss not to list the main author though (Joe Hellerstein, Berkeley).
24.
by anonetal 10y ago
Rewrite phase is also supposed to "flatten subqueries/views" (cf. "Extensible/rule based query rewrite optimization in Starburst"; SIGMOD 92) and can be fairly complex. PostgreSQL doesn't do it to the same
25.
by anonetal 11y ago
This is an old discussion on the dev list: http://www.postgresql.org/message-id/201209191305.44674.db@k... .. which indicates that reliance on them being optimization fences may be too ingrained to change. I had assume
26.
by anonetal 11y ago
I fully agree -- people underestimate this issue. We recently had a long discussion among the CS faculty on using GradeScope (a software for grading paper exams). It looks great and I would love to use it, but the feedback was that the Univ
27.
by anonetal 11y ago
As Frank notes, this is not really surprising if you have seen the recent-ish papers on sorting. It is indeed frustrating when a paper seems to have nice ideas but does not do a good enough job at the simple baselines; and in most cases, th
28.
by anonetal 11y ago
I think Datomic is a very interesting project for a variety of reasons like use of Datalog, immutability etc. This particular thing seems like a backwards step though. One of the major reasons why relational databases became so popular was
29.
by anonetal 11y ago
There is also TelegraphCQ, a competing project at Berkeley around the same time; TelegraphCQ was also built on top of PostgreSQL and its support for Continuous Queries seems essentially identical to Continuous Views here ("materialized
30.
by anonetal 11y ago
I haven't seen too many results that rely on SETH, so just did a bit of research. Ryan Williams (from Stanford) at least doesn't believe SETH is true -- here is a nice talk by him on SETH: http://www.imsc.res.in/~v

More ›