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…
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.…
Regarding 2: note that this is not the Cambridge Analytica data, rather similar data collected by researchers at Cambridge.
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.
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…
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…
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,…
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…
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 other comments…
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.
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
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.
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 most…
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…
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…
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.
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…
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).
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 assumed…
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…
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;…
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…
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:…
Why? It would be a major hassle otherwise when visiting cities like SF or NYC if you are not planning to rent a car (if you are, you might be carrying a car seat). I wouldn't be comfortable using a random carseat in the…
Yes, I did know that someone did it in 5 mins, so that helped :) I think it took me 9-10 mins in total, including testing on the provided inputs. I think I could have done it in a few mins faster 15 years ago when I…
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…
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.…
Regarding 2: note that this is not the Cambridge Analytica data, rather similar data collected by researchers at Cambridge.
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.
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…
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…
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,…
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…
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 other comments…
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.
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
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.
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 most…
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…
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…
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.
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…
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).
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 assumed…
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…
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;…
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…
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:…
Why? It would be a major hassle otherwise when visiting cities like SF or NYC if you are not planning to rent a car (if you are, you might be carrying a car seat). I wouldn't be comfortable using a random carseat in the…
Yes, I did know that someone did it in 5 mins, so that helped :) I think it took me 9-10 mins in total, including testing on the provided inputs. I think I could have done it in a few mins faster 15 years ago when I…