3 ms·
Thank you for the paper - it is well-written and succinct. Karhik, do you think this approach can be applied to Apache Spark as well (given its well-known slown
by maslam 8y ago
Thank you for the paper - it is well-written and succinct. Karhik, do you think this approach can be applied to Apache Spark as well (given its well-known slowness with UDFs)?
- karthiksr 8y agoThank you. Conceptually the ideas behind Froid follow from relational algebra so it can be applied to other relational engines as well. However, the details still need to be figured before making any concrete statement. If you could share any pointers about UDFs and their performance problems in Spark, I would love to investigate more.
- prince617 8y agoYou might want to check out this related work: http://casper.uwplse.org http://casper.uwplse.org
- karthiksr 8y agoThank you. Casper is very interesting work, and I am aware of it. Program synthesis offers an alternative approach to such problems, with different trade offs and characteristics. The paper includes a brief discussion on synthesis-based techniques, and the reasoning behind Froid's design choices.