How can we efficiently represent and enumerate the results of theta-join queries? Factorization techniques have found notable success as a compact representation scheme that allows for enumeration algorithms where the results are produced incrementally after a preprocessing phase. However, these factorized representations have mainly been limited so far to equi-joins. This talk will present factorization techniques for general theta-join queries where the join conditions between relations go beyond equality.
Recently, Merkle trees have been proposed as a way to scale block validation in cryptocurrencies such as Ethereum (or Bitcoin). The key insight is that block validators can verify Merkle proofs of account balances (or of unspent coins) against a Merkle root of the cryptocurrency’s state (i.e., the database of every user’s balance). This so-called stateless validation approach eliminates the need for block validators (e.g., miners, P2P nodes) to store large amounts of data and access it from disk during validation, which can be slow.
You Can Play the Game, But Can You Make the Game?: Observations and Tips from 25+ Years of Building Games
Duke alum Cade Metz will discuss his new book, Genius Makers: The Mavericks Who Brought AI to Google, Facebook, and the World, a sweeping look at the rise of "AI" (Artificial Intelligence) over the last 10 years -- and the decades of history that made this possible. He will also discuss his time at Duke and his path to becoming a New York Times reporter. He will be interviewed by North Carolina State professor Ross Bassett, before taking any and all questions from students.
** We will raffle off a signed copy of his new book Genius Makers during the talk. **