Re: A TP4 Structure Agnostic Bytecode Specification (The Universal Structure)

2019-04-25 Thread Marko Rodriguez
Hello, After receiving comments from various people and re-reading the proposal over again, I thought it best to provide some fixes and extended notes. TP4 REQUIREMENTS ERRATA - Point #2 should read: The TP4 VM

Re: [TinkerPop] A TP4 Structure Agnostic Bytecode Specification (The Universal Structure)

2019-04-25 Thread Ryan Wisnesky
And 40+ years of programming languages research too :-) > On Apr 25, 2019, at 12:36 PM, Joshua Shinavier wrote: > > +10. Great to see structure and process coming together in this way. I think > the algebraic and relational idiom will serve TP4 well. ADTs + constraints > are all we need in ord

Re: [TinkerPop] A TP4 Structure Agnostic Bytecode Specification (The Universal Structure)

2019-04-25 Thread Joshua Shinavier
+10. Great to see structure and process coming together in this way. I think the algebraic and relational idiom will serve TP4 well. ADTs + constraints are all we need in order to expose a wide variety of structured data models to TinkerPop. Traditional property graphs, hypergraphs, relational DBs,

Re: What makes 'graph traversals' and 'relational joins' the same?

2019-04-25 Thread Joshua Shinavier
Hi Marko. Responses inline. On Wed, Apr 24, 2019 at 10:30 AM Marko Rodriguez wrote: > Hi, > > I think I understand you now. The concept of local and non-local data is > what made me go “ah!” > Nice. I also brought this up yesterday in the Property Graph Schema Working Group, where there is a di

A TP4 Structure Agnostic Bytecode Specification (The Universal Structure)

2019-04-25 Thread Marko Rodriguez
Hello, This email proposes a TP4 bytecode specification that is agnostic to the underlying data structure and thus, is both: 1. Turing Complete: the instruction set has process-oriented instructions capable of expressing any algorithm (universal processing). 2. Pointer-Based: th