Re: Thoughts on the new concat() step

You guys are ruining the language with your approach to string manipulation. Look to math()-step to see how you should handle non-graph data structure manipulations. Marko. > On Aug 16, 2023, at 4:35 AM, Stephen Mallette wrote: > > I think the syntax should just be changed from concat(Travers

Re: [DISCUSS] Draft ASF Board Report - April 2022

43 PM, Daniel Craig wrote: > > People will make their own opinions. For me, your twitter posts crossed > the line. > > On 2022/04/13 08:33:29 Marko Rodriguez wrote: > Thanks Florian. > > It sucks, man. Really sucks. The Apache Board meddled in TinkerPop so as to >

Re: [DISCUSS] Draft ASF Board Report - April 2022

Thanks Florian. It sucks, man. Really sucks. The Apache Board meddled in TinkerPop so as to appease some voracious mob of anonymous Twitter fools. I contend that all would have been averted had someone stood up and simply said: "Comon guys. Yes, Marko is an odd fella with a twisted sense of hum

Re: [DISCUSS] Draft ASF Board Report - April 2022

I imagine Florian omitted my leaving the PMC in this draft as he was > waiting for it to become public knowledge. I expected to send an email > about it after the release at which point the report could have been > amended. > > > > On Wed, Apr 6, 2022 at 12:05 PM Ma

Re: [DISCUSS] Draft ASF Board Report - April 2022

Hello dev@, Stephen Mallette has stepped down from both the PMC Chair and now the PMC. I believe this should be included in the report given the significance of the event. Furthermore, it would be good to address why the two primary developers of Apache TinkerPop (10+ years) are still active me

Re: [DISCUSS] Removal of Marko A. Rodriguez from Apache TinkerPop

ri, Jan 7, 2022 at 11:05 AM Marko Rodriguez > wrote: > >> Thanks for the update. I opened up my email this morning to ping: >> >>“Any updates? I can’t believe open source software has come to >> this. I look back and think, once you took your recent corpo

Re: [DISCUSS] Removal of Marko A. Rodriguez from Apache TinkerPop

27;s not being ignored. Thank you for your patience. > > On Wed, Jan 5, 2022 at 3:24 PM Marko Rodriguez wrote: > >> Understood. >> >> Marko. >> >>> On Jan 5, 2022, at 12:31 PM, Stephen Mallette >> wrote: >>> >>> Please

Re: [DISCUSS] Removal of Marko A. Rodriguez from Apache TinkerPop

Understood. Marko. > On Jan 5, 2022, at 12:31 PM, Stephen Mallette wrote: > > Please allow some more time for a reply as I've been away for the New Years > Eve weekend. > > On Wed, Jan 5, 2022 at 12:50 PM Marko Rodriguez > wrote: > >> Hey Stephen, >

Re: [DISCUSS] Removal of Marko A. Rodriguez from Apache TinkerPop

much, Marko. > On Dec 31, 2021, at 2:14 PM, Marko Rodriguez wrote: > > Hello everyone, > > As you all may know, I was recently removed from TinkerPop for the crime of > “being a Nazi troll.” When arguing I’m not a Nazi, I was told I “violated > social norms.” Assuming

[DISCUSS] Removal of Marko A. Rodriguez from Apache TinkerPop

Hello everyone, As you all may know, I was recently removed from TinkerPop for the crime of “being a Nazi troll.” When arguing I’m not a Nazi, I was told I “violated social norms.” Assuming I violated social norms, I inquired as to where such social norms are specified as I never signed anythin

Re: [DISCUSS] ASF Board Draft Report - October 2021

gt; ## PMC/Committer: > - Last PMC addition was Kelvin Lawrence/Josh Shinavier - June 2021 > - Last committer addition was Øyvind Sæbø - March 2021 > > ## Links > [1] https://www.tibco.com/products/tibco-graph-database/ > <https://www.tibco.com/products/tibco-graph-database/>

Re: [DISCUSS] ASF Board Draft Report - October 2021

n Sun, Oct 3, 2021 at 9:50 AM Marko Rodriguez <mailto:okramma...@gmail.com>> wrote: > >> Josh — if you are going to come onto this project, put your name on it, >> then you need to do something. You promised me for 2 years that you would >> work on TInkerPop4. You ha

Re: [DISCUSS] ASF Board Draft Report - October 2021

rage against Amazon, but > your ideas around the mm-ADT "economic machine" seemed good -- why not > execute on them. > > Josh > > > On Sun, Oct 3, 2021 at 7:59 AM Marko Rodriguez <mailto:okramma...@gmail.com>> wrote: > >> Hello, >> >>

Re: [DISCUSS] ASF Board Draft Report - October 2021

Hello, This looks good, though I think we should add some items regarding project leadership. First off, Tibco has been a TinkerPop-enabled graph database for over 5 years now. So that is nothing new. Next, we should alert the Apache Board about the lack of contributions by recently elected P

Re: Anything I could do to help?

at is a vicious downward spiral — a whole bunch of chiefs and not enough Indians. <— OH NO! RACISM! AAAH! Outz, Marko. > > > > On Sun, Sep 12, 2021 at 1:18 PM Marko Rodriguez <mailto:okramma...@gmail.com>> > wrote: > >> Understood. However, it seem

Re: Anything I could do to help?

but perhaps they can become > something new. > > On Tue, Sep 7, 2021 at 6:34 PM Marko Rodriguez <mailto:okramma...@gmail.com>> wrote: > >> Hi guys/gals, >> >> Looks like it’s just been Stephen nick-nacking away again as it’s been the >> last few years. G

Re: Anything I could do to help?

nted to support you in spite of > all the craziness. I don't see us working together so soon after these > weird rants on the dev list, but I won't speak for anyone else. You're > still a TinkerPop contributor. Go ahead and do something. > > Josh > > > &

Anything I could do to help?

Hi guys/gals, Looks like it’s just been Stephen nick-nacking away again as it’s been the last few years. Given the recent big turnover in management, I was hoping to eat my own words and see some performance out of Josh, but unfortunately as given the last 15+ years, 'talk and walk’ (which is e

Re: [TinkerPop] Welcome Josh Shinavier as a TinkerPop PMC member

Ha! Gotta get those stats up so the monthly reports look good, eh? Marko. > On Jun 4, 2021, at 2:12 PM, Stephen Mallette wrote: > > The TinkerPop PMC is pleased to announce that Josh Shinavier has accepted the > invitation to become a PMC member. Thanks, Josh, for your continued support > of

Re: 3.5.0 Announcement Volunteers

> Josh > > > > On Sat, May 1, 2021 at 6:55 PM Marko Rodriguez wrote: > >> Josh — You have been talking for over 2 years now about what you will >> accomplish. 2 years ago you asked to be a committer. Do you remember what I >> said? "You have to do somet

Re: 3.5.0 Announcement Volunteers

some > of the changes will require a clean break from the existing code base, > hence a new major version, but others can follow more of a > replace-and-deprecate pattern. > > Josh > > > > On Sat, May 1, 2021 at 8:54 AM Marko Rodriguez wrote: > >> Hello,

Re: 3.5.0 Announcement Volunteers

And that will be a sad state of affairs my old friend. Marko. > > On Fri, Apr 30, 2021 at 9:55 AM Marko Rodriguez > wrote: > >> Hello mein freunden, >> >> I’d love to contribute a body of work from mm-ADT that is one of the main >> issues with the Grem

Re: 3.5.0 Announcement Volunteers

Hello mein freunden, I’d love to contribute a body of work from mm-ADT that is one of the main issues with the Gremlin language: every step should support pipeline arguments (i.e., every argument can be a dynamically/traversal determined value). I solved this problem in mm-ADT elegantly and eff

Re: [DISCUSS] exp4j

uld be no difference compared to what we >> have now, everything would be string-based. >> >> Cheers, >> Daniel >> >> >> On Tue, Jul 30, 2019 at 4:34 AM Marko Rodriguez >> wrote: >> >>> Hi, >>> >>> I think we s

Re: [DISCUSS] exp4j

Hi, I think we should create our own math library. We will need it for mm-ADT, Kuppitz has the ANTLR chops down, … Marko. http://rredux.com > On Jul 30, 2019, at 5:31 AM, Stephen Mallette wrote: > > Kuppitz just answered a question on gremlin-users that involved math(

Re: [DISCUSS] code freeze 3.3.8/3.4.3

My bio is choice. > On Jul 26, 2019, at 8:40 AM, Florian Hockmann > wrote: > > My bio is still up to date. > > -Ursprüngliche Nachricht- > Von: Stephen Mallette > Gesendet: Freitag, 26. Juli 2019 16:29 > An: dev@tinkerpop.apache.org > Betreff: [DISCUSS] code freeze 3.3.8/3.4.3 > >

mm-ADT: A Multi-Model Abstract Data Type

Hello everyone, Over the last few months, Kuppitz, Stephen, and I have been working on a database virtual machine specification called mm-ADT. http://rredux.com/mm-adt/ This is our first public showing. While there is a large body of work here, it is still v

Re: mm-ADT to TinkerPop3

tp://rredux.com > > > On Thu, Jun 13, 2019 at 6:25 PM Marko Rodriguez <mailto:okramma...@gmail.com>> > wrote: > >> Hello, >> >> Various stakeholders in Apache TinkerPop have been wondering weather >> mm-ADT can be leveraged in TinkerPop3. While I

mm-ADT to TinkerPop3

Hello, Various stakeholders in Apache TinkerPop have been wondering weather mm-ADT can be leveraged in TinkerPop3. While I originally planned for mm-ADT to form the foundation of TinkerPop4, there are a subset of features in mm-ADT that could really help TP3 moving forward. Here is a preliminar

I believe mm-ADT needs the concept of a sequence.

Hello, I think that mm-ADT has new data type. sequence: zero or more objects. …where the two collections are a type of sequence: list: an integer-based index of a sequence. map: an object-based index of a sequence. Why does a sequence exist? It exists because we don’t h

mm-ADT breakthrough regarding writes and partial data loading

Hi, *** This email is primarily for Kuppitz (and Stephen might appreciate the general idea — especially the last part). *** We have 3 types of containers in mm-ADT. 1. map-> [:] 2. list -> [ ] 3. ?sequence? -> .* This #3 thing doesn’t have a name, but its

Re: A Type System Core to mm-ADT

;, consuming an "a" and > producing a "b"). But I need to grok more. Sorta. The semantics of X->Y are: “Given a matching X-instruction executed on the reference’s referents, the result is Y." If Y is sufficient to solve the computation, the VM avoide

Re: A Type System Core to mm-ADT

Hello, >> [db][get,’people’] // *{name:@string, age:!gt(20)&!lt(33)} >> >> We have lost information about the “schema.” This is not good as >> compile-time write validation is not possible. >> > > So far, I am thinking: yeah, dealing with schema changes can be tricky. This is not a “schema cha

Re: A Type System Core to mm-ADT

Hello, >> [db][get,’people’] // *{name:@string, age:!gt(20)&!lt(33)} >> >> We have lost information about the “schema.” This is not good as >> compile-time write validation is not possible. >> > > So far, I am thinking: yeah, dealing with schema changes can be tricky. This is not a “schema cha

A Type System Core to mm-ADT

Hi, *** This email is primarily for Josh (and Kuppitz). I think we need Josh's type system core to mm-ADT. I’m facing the problem of having to model both a “range” (legal schema) and a “codomain” (current schema) of the referents of a reference. Let me explain with an example. Suppose that the

Next steps on the mm-ADT specification.

Hello, ** This email is primarily for Kuppitz, Josh, and Stephen. *** I sent the DRAFT specification to George to get some feedback regarding a potential home for the work. As it stands, I think we have a really solid approach. Once the concept of a “instruction patterns” hit home, we were of

Modeling SQL Table Schema with Map-References

Hi, This is mainly for Josh/Kuppitz/Mallette, but others might find it interesting. // a map-reference demonstrating how various RDBMS table features are captured via key/value ?patterns and reference instructions. // created a new concept called self* which is just a pointer to the current ref

Re: The Bytecode Pattern-Matching Model

t; > On May 17, 2019, at 7:58 AM, Marko Rodriguez wrote: > > Hi, > > Thanks for your question. > > I suppose that a “limit bandwidth”-optimization could be based on the > provider looking at all the instructions in the submitted instruction and > then use that i

Re: The Bytecode Pattern-Matching Model

ollowing the > abstraction hehe). You nicely wrote this from the perspective of the > individual providers which I think connected me more to the more concrete > aspect of things, which leads me to this question: Does the provider send > the instructions by looking at the query or do t

The Bytecode Pattern-Matching Model

Hello, This email is primarily for Kuppitz and Josh. Kuppitz offered me his attention yesterday. I explained to him an idea I’ve been working on this week. I’ve been frustrated lately because emails and IM are so hard to express abstract ideas. Fortunately, Kuppitz was patient with me. Then he

Re: N-Tuple Transactions?

Wow. I totally understood what you wrote. Question: What is the TransactionLog in a distributed environment? e.g. Akka-driven traversers spawned from the same query migrating around the cluster mutating stuff. Thanks for the lesson, Marko. http://rredux.com

A Novel "Bytecode" Optimization Mechanism for TP4

Hi, Thinking last night, I came up with another way of doing bytecode optimization in TP4 that has some interesting properties. 1. Providers don't write custom strategies. 2. Providers don’t write custom instructions. 3. TP4 can be ignorant of large swaths of optimization

N-Tuple Transactions?

Hello Josh (others), You mentioned a week or so ago that the n-tuple model should be able to capture both indices and transactions. At the time, I scoffed at the notion. However, as you know, I have been recently enlightened to how n-tuples can model indices and am using it extensively in the

Re: N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

ties). So we > treat edge relations like triples, where the first element of the triple is > the identity of the edge. The _ symbol represents "don't care" variables. > > Josh > > > On Sat, May 11, 2019 at 8:01 AM Joshua Shinavier wrote: > >>

Re: A collection of examples that map a query language query to provider bytecode.

mming language they want to support. The bulk >>> of >>>> the work seems to be in the "compiler" so if that were moved to the >>> server >>>> (what we did in TP3) then the language designer would only have to write >>>> that once

Re: A collection of examples that map a query language query to provider bytecode.

Hello Dmitry, > In TP3 compilation to Bytecode can happen on Gremlin Client side or Gremlin > Server side: > > 1. If compilation is simple, it is possible to implement it for all Gremlin > Clients: Java, Python, JavaScript, .NET... > 2. If compilation is complex, it is possible to create a plug

The TP4 Universal Model ==> A Multi-Model ADT

Hi, *** I’ve started a GoogleDoc called “A Multi-Model Data Type Specification.” *** An abstract data type is a data structure + operations to manipulate it. Classic examples include: 1. stacks — arrays with push() and pop() operations. 2. lists — arrays with add(), remove(), get

What is a TP4 structure and what is a TP4 property graph structure?

Hello, *** I believe the following email provides the most elegant TP4 structure/ proposal to date. *** Every database (withStructure()) is understood by TP4 as an unordered sequence of #type'd tuples. {#type:?, ...} {#type:?, ...} {#type:?, ...} ... This is the TP4 “universal model.” Every

Re: N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

e #keys, and a set of standard tuple pointers (optimizations). In the situation that TP4 doesn’t have an optimization represented, well, the provider can always write a strategy. Thoughts?, Marko. http://rredux.com <http://rredux.com/> > > Cheers, > Daniel > > > >

Re: N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

crazy. From what I can see, it is theoretically possible to provide a service of this nature with TP4. Marko. http://rredux.com <http://rredux.com/> > On May 7, 2019, at 11:14 AM, Marko Rodriguez wrote: > > When your hot, your hot. Going to keep pushin’. > >

Re: N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

ully encoded (in one particular way) a property graph into a relational database. Drop mic, Marko. http://rredux.com <http://rredux.com/> > On May 7, 2019, at 10:20 AM, Marko Rodriguez wrote: > > I’m in the pocket so I’m just going to riff… > > The concept of a poin

Re: N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

’t talking “multi-model” …. no my friend, we are talking “hybrid-model.” Its all just tuples and pointers. Outz, Marko. http://rredux.com <http://rredux.com/> > On May 7, 2019, at 7:26 AM, Marko Rodriguez wrote: > > Whoa. > > Check out this trippy trick. >

Re: N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

eason for providers to have to write custom strategies and instructions ?!?!?!?!? crazy!? Marko. http://rredux.com <http://rredux.com/> > On May 7, 2019, at 4:44 AM, Marko Rodriguez wrote: > > Hey Josh, > >> I think of your Pointer as a reference to an entity. It does

Re: N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

ere. Take care, Marko. http://rredux.com <http://rredux.com/> > On Mon, May 6, 2019 at 9:38 PM Marko Rodriguez <mailto:okramma...@gmail.com>> wrote: > >> Hey Josh, >> >>> I am feeling the tuples... as long as they can be typed, e.g. >>> >

Re: N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

confidence. See ya, Marko. http://rredux.com <http://rredux.com/> > > Josh > > > On Mon, May 6, 2019 at 5:34 PM Marko Rodriguez <mailto:okramma...@gmail.com>> wrote: > Hi, > > I spent this afternoon playing with n-tuples, pointers, data model

N-Tuples, Pointers, Data Model Interfaces, and Bytecode Instructions

Hi, I spent this afternoon playing with n-tuples, pointers, data model interfaces, and bytecode instructions. https://gist.github.com/okram/25d50724da89452853a3f4fa894bcbe8 *** Kuppitz: They are tuples :). A Map extends T

A collection of examples that map a query language query to provider bytecode.

Hello, I’m experimenting with moving between X query language and Y bytecode via Universal Bytecode. The general (and very difficult) goal of TP4 is to be able to execute queries (from any known query language) against any database (regardless of underlying data model) using any processing eng

Re: The Fundamental Structure Instructions Already Exist! (w/ RDBMS Example)

Hey Josh, > One more thing is needed: disjoint unions. I described these in my email on > algebraic property graphs. They are the "plus" operator to complement the > "times" operator in our type algebra. A disjoint union type is just like a > tuple type, but instead of having values for field a A

Re: The Fundamental Structure Instructions Already Exist! (w/ RDBMS Example)

TP4 bytecode. And there you have it — I believe Apache TinkerPop is on the verge of offering a powerful new data(base) theory and technology. The Database Virtual Machine Thanks for reading, Marko. http://rredux.com <http://rredux.com/> > On Apr 30, 201

Re: The Fundamental Structure Instructions Already Exist! (w/ RDBMS Example)

; Meta-properties -- again, this is where I think we should have a > lower-level select() operation. Then has() builds on that operation. > Whereas select() matches on fields of a relation, has() matches on property > values and other higher-order things. If you want properties of properties, >

TP4 + Cypher

Hello, I had the most interesting meeting this morning with Dmitry Novikov (the author of Cypher-for-Gremlin). The fellow is sharp and has a thorough understanding of Gremlin (language + mechanics). Here are two points to consider: 1. https://github.com/opencypher/cypher-for-gremlin/tr

Re: [DISCUSS] The Two Protocols of TP4

Hi, > Currently users can send either bytecode or groovy scripts to be executed > on the server. I'm saying we replace "groovy scripts evaluation" with > "gremlin groovy traversal execution”. I concur. But why even send Gremlin-Groovy traversals? Just send bytecode. - assuming we can get

Re: The Fundamental Structure Instructions Already Exist! (w/ RDBMS Example)

tored >> Procedures and Views in RDBMS? Views can be treated as tables, easy, but >> what about stored procedures? SPs can be found in many more DBMS, would be >> bad to not support them (or hack something ugly together later in the >> development process). > >

Re: The Fundamental Structure Instructions Already Exist! (w/ RDBMS Example)

DBMS, would be > bad to not support them (or hack something ugly together later in the > development process). I’m not super versed in RDBMS technology. Can you please explain to me how to create a StoreProcedure and the range of outputs a StoredProcedure produces? From there, I can try

Re: The Fundamental Structure Instructions Already Exist! (w/ RDBMS Example)

raph in a relational database, you will have to strategize the bytecode accordingly! Just a heads up in case you haven’t noticed that. Thanks for your input, Marko. http://rredux.com <http://rredux.com/> > > Josh > > > > On Mon, Apr 29, 2019 at 7:34 AM Marko Rodriguez

The Fundamental Structure Instructions Already Exist! (w/ RDBMS Example)

Hi, *** This email is primarily for Josh (and Kuppitz). However, if others are interested… *** So I did a lot of thinking this weekend about structure/ and this morning, I prototyped both graph/ and rdbms/. This is the way I’m currently thinking of things: 1. There are 4 base types in

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

elete() in a property graph deletes all the data - select('V').has(id,1).delete('outE') // g.V(1).outE().drop() - select('V').has(id,1).project('outE').has('weight',gt(0.5)) //

A TP4 Structure Agnostic Bytecode Specification (The Universal Structure)

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

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

aining relations. However, with this model, I’m assuming that “listener” is unique to the talk_table and this is not smart… Anywho, is this more in line with what you are getting at? Thanks for your patience, Marko. http://rredux.com <http://rredux.com/> > On Apr 24, 2019, at 11:30 A

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

ttp://rredux.com <http://rredux.com/> > On Apr 24, 2019, at 9:56 AM, Joshua Shinavier wrote: > > On Tue, Apr 23, 2019 at 10:28 AM Marko Rodriguez > wrote: > >> Hi, >> >> I think we are very close to something useable for TP4 structure/. Solving >&g

Re: TP4 Processors now support both push- and pull-based semantics.

> > On Apr 24, 2019, at 3:41 AM, brynco...@gmail.com wrote: > > > > On 2019/04/23 13:07:09, Marko Rodriguez <mailto:okramma...@gmail.com>> wrote: >> Hi, >> >> Stephen and Bryn were looking over my RxJava implementation the other day >> and B

More emails from Marko. Yes!

Hi, The parallel Josh/Marko/Pieter thread got me thinking… So, given ComplexType Iterator siblings(String label) Iterator children(String label) …lets see how both structure and processor providers can influence each other within the TP4 VM. Lets take JanusGraph as the example

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

ng dense (aka “being Kuppitz" — thats right, I said it. boom!). Thanks, Marko. http://rredux.com <http://rredux.com/> > On Apr 23, 2019, at 10:25 AM, Joshua Shinavier wrote: > > On Tue, Apr 23, 2019 at 5:14 AM Marko Rodriguez > wrote: > >> Hey Josh, >&

[Article] Pull vs. Push-Based Loop Fusion in Query Engines

Hello, I just read this article: Push vs. Pull-Based Loop Fusion in Query Engines https://arxiv.org/abs/1610.09166 It is a really good read if you are interested in TP4. Here are some notes I jotted down: 1. Pull-based engines are inefficient

TP4 Processors now support both push- and pull-based semantics.

Hi, Stephen and Bryn were looking over my RxJava implementation the other day and Bryn, with his British accent, was like [I paraphrase]: “Whoa dawg! Bro should like totally not be blocking to fill an iterator. Gnar gnar for surezies.” Prior to now, Processor implemented Iterator, wher

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

all in the pictures. I have nowhere to put them > online at the moment... maybe this attachment will go through to the list? > > Btw. David Spivak gave his talk today at Uber; it was great. Juan Sequeda > (relational <--> RDF mapping guy) was also here, and Ryan joined remotely. &

Re: [DISCUSS] The Two Protocols of TP4

evaluation of the tokens (like, do > the tokens evaluate into something meaningful?), can be optimized with > caching techniques (like preparing traversals) and more importantly, will > only execute class methods that are whitelisted, i.e., users can't use it > to execute arb

Re: [DISCUSS] The Two Protocols of TP4

Hi Jorge, > Instead of supporting a ScriptEngine or enable providers to implement one, > TP4 could be a good opportunity to ditch script engines while continue > supporting gremlin-groovy string literals using language recognition > engines like ANTLR. Huh…….. Can you explain how you think of usi

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

erialize them in a relational database, they > are rows. In any case, you need two basic graph traversal operations: > project() -- forward traversal of the arrows in the above diagrams. Takes you > from an element to a component like in-vertex. > select() -- reverse traversal of the

TP4 and Apache Cassandra

Hi, Apache Cassandra has the following abstract data model. Keyspace: A List of Tables Table: A Map of Rows Row: A Map of Primitive Values. In Java syntax: SortedMap> https://www.ebayinc.com/stories/blogs/tech/cassandra-data-modeling-best-practic

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

alEdgeName") will work. > In a way this is precisely to keep the graphy nature of gremlin, i.e. > traversing edges, and avoid using the manual join syntax you described. > CheersPieter > > On Thu, 2019-04-18 at 14:15 -0600, Marko Rodriguez wrote: >> Hi, >> *** This is m

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

Hi, *** This is mainly for Kuppitz, but if others care. Was thinking last night about relational data and Gremlin. The T() step returns all the tables in the withStructure() RDBMS database. Tables are ‘complex values’ so they can't leave the VM (only a simple ‘toString’). Below is a fake Grem

Re: [DISCUSS] Primitive Types, Complex Types, and their Entailments in TP4

maps are just generalized lists… lists are just generalized strings…and strings are just generalized singletons. Bye, Marko. http://rredux.com <http://rredux.com/> > On Apr 15, 2019, at 1:07 PM, Marko Rodriguez wrote: > > Hello, > >> I think this does satisfy your requ

Re: [DISCUSS] The Two Protocols of TP4

/apache/tinkerpop/machine/species/BasicMachine.java <https://github.com/apache/tinkerpop/blob/tp4/java/machine/machine-core/src/main/java/org/apache/tinkerpop/machine/species/BasicMachine.java> Marko. > > > On Tue, Apr 16, 2019 at 1:58 PM Marko Rodriguez <mailto:okramma...@gmail

Re: [DISCUSS] Primitive Types, Complex Types, and their Entailments in TP4

Hi, > just getting real specific around TLong/TInteger for a minute - should > TinkerPop's primitive just be TNumber? We do a lot of "stuff" to try to > make numbers just be numbers across TinkerPop and each language has to do > extra stuff to match the JVM, which is something we keep trying to a

Re: [DISCUSS] The Two Protocols of TP4

Hi, > i was thinking that an extensible bytecode model would be the solution for > these kinds of things. without the scriptengine anymore (stoked to see that > go away) graph providers with schema languages and other admin functions > will need something to replace that. what's neat about that op

Re: [DISCUSS] The Two Protocols of TP4

the JanusGraph clean utility to drop a database or use > javscript to create a graph in DSE Graph. pretty cool. > > > On Mon, Apr 15, 2019 at 2:44 PM Marko Rodriguez <mailto:okramma...@gmail.com>> > wrote: > >> Hello, >> >> I believe there wil

Re: [DISCUSS] Primitive Types, Complex Types, and their Entailments in TP4

h.Features in TP3. > IMO it's OK if URIs, in an RDF context, become Strings in a TP context. You > can think of URI as a constraint on String, which should be enforced at the > appropriate time, but does not require a vendor-specific class. Can you > concatenate two URIs? Sure... j

[DISCUSS] The Two Protocols of TP4

Hello, I believe there will only be two protocols in TP4. 1. The VM communication protocol. (Rexster) 2. The data serialization protocol. (Frames) [VM COMMUNICATION PROTOCOL] 1. Register bytecode —returns—> bytecode. 2. Submit bytecode —returns—> iterator of trav

Re: [DISCUSS] Primitive Types, Complex Types, and their Entailments in TP4

provide different SPARQL execution engines to their triple-store providers. The TP4 virtual machine may just turn out to be a technological masterpiece. Marko. http://rredux.com > > On Mon, Apr 15, 2019 at 8:06 AM Marko Rodriguez <mailto:okramma...@gmail.com>> > wrote:

[DISCUSS] Primitive Types, Complex Types, and their Entailments in TP4

Hello, I have a consolidated approach to handling data structures in TP4. I would appreciate any feedback you many have. 1. Every object processed by TinkerPop has a TinkerPop-specific type. - TLong, TInteger, TString, TMap, TVertex, TEdge, TPath, TList, …

TinkerPop4 Status Report #3

Hello, I spent most of the last 1.5 weeks working on RxJavaProcessor (ReactiveX — http://reactivex.io/ ), where 3 of those days were spent in a nasty code hell trying to figure out how to do cyclic stream topologies for repeat(). I’ve never read so much of someone else’s c

Re: [TP4 Benchmarking] Pipes vs. Single-Threaded RxJava vs. Multi-Threaded RxJava

o figure out how to do a loop in Rx. :| … have some new ideas this morning. Thanks for the effort. Take care, Marko. http://rredux.com > On Mon, Apr 8, 2019 at 12:16 PM Marko Rodriguez <mailto:okramma...@gmail.com>> > wrote: > >> Hi, >> >> I implemente

[TP4 Benchmarking] Pipes vs. Single-Threaded RxJava vs. Multi-Threaded RxJava

Hi, I implemented Multi-threaded RxJava this morning — its called ParallelRxJava. Single-threaded is called SerialRxJava. The RxJavaProcessor factory will generate either depending on the Map.of() configuration: https://github.com/apache/tinkerpop/blob/tp4/java/machine/processor/rxjav

Re: A Question Regarding TP4 Processor Classifications

http://rredux.com > > --Ted > > On Thu, Apr 4, 2019 at 12:36 PM Marko Rodriguez > wrote: > >> Hi, >> >> This is a pretty neat explanation of why Pipes will be faster than RxJava >> single-threaded. >> >> The map-operator for Pipes: >

Re: A Question Regarding TP4 Processor Classifications

<https://github.com/ReactiveX/RxJava/blob/2.x/src/main/java/io/reactivex/internal/operators/flowable/FlowableMap.java> RxJava has a lot of overhead. Pipes is as bare bones as you can get. Marko. http://rredux.com <http://rredux.com/> > On Apr 4, 2019, at 11:07 AM, M

Re: A Question Regarding TP4 Processor Classifications

questions or at least explained my confusion. Thanks, Marko. http://rredux.com <http://rredux.com/> > On Apr 4, 2019, at 10:33 AM, Ted Wilmes wrote: > > Hello, > > > --Ted > > On Tue, Apr 2, 2019 at 7:31 AM Marko Rodriguez <mailto:okramma...@gmail.com>>

Re: The Machine Interface of TP4.

ad > this conversation somewhere, but maybe i'm making that up. > > On Wed, Mar 27, 2019 at 9:09 AM Marko Rodriguez <mailto:okramma...@gmail.com>> > wrote: > >> Hi, >> >>> LocalMachine, it will lookup the registered UUID and if it exists, use >>

A Question Regarding TP4 Processor Classifications

Hello, TP4 will not make a distinction between STANDARD (OLTP) and COMPUTER (OLAP) execution models. In TP4, if a processing engine can convert a bytecode Compilation into a working execution plan then that is all that matters. TinkerPop does not need to concern itself with whether that executi

Re: [TinkerPop] What is the fundamental bytecode for TP4?

g that TP4 can offer what TP3 didn't, which was an easy > way to reason about complex query patterns. we promised that with "tools" in > TP3 but those never really materialized (attempts were made, but nothing > seemed to stick really). > > On Sat, Mar 23, 2019 at

  1   2   3   4   >