1 / 3

You Probably Expect Me to Say Something About Datalog

You Probably Expect Me to Say Something About Datalog. Recursion turns out to be much more important in big-data operations than we thought in 1980. Examples : PageRank, gradient descent, dimensionality reduction, SVM, etc., etc. Many new extended Datalog -like languages are coming into use.

badu
Download Presentation

You Probably Expect Me to Say Something About Datalog

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. You Probably Expect Me to Say Something About Datalog • Recursion turns out to be much more important in big-data operations than we thought in 1980. • Examples: PageRank, gradient descent, dimensionality reduction, SVM, etc., etc. • Many new extended Datalog-like languages are coming into use. • Examples: LogicBlox, Scalops. • Too many dislike logic, need SQL. • Better recursion in SQL needed. • Nonlinear, nonstratified.

  2. Nested Relations • Tree-like structures popular outside SQL. • Record (tuple) types + collection types like repeating groups, optional elements, arrays, etc., built recursively. • Examples: • Hierarchical model without pointers. • DTD’s without refs. • Google Protocol buffers. • ODL classes without relationships. • NoSQL types as in BigTable, Hbase, etc.

  3. Adapting SQL • In a sense, this is all in Object-Relational SQL, but constructs often cumbersome. • Start from the assumption that all rows are tree-like, with simple notations to navigate trees. • Following links OK, but efficiency?? • Semantics gets tricky fast. • Example: (A, B*, C*), with selection B < C. • XQuery would interpret existentially. • If you flatten (take X-product of B and C), and then select, you get a different structure.

More Related