Simplify Service Dependencies with Nodes

Re:Simplify Service Dependencies with Nodes by adamnemecek on Saturday December 10, 2016 @03:45PM (#13147797)

This is like the fourth instance of computational graphs that I've seen recently. Can someone recommend some resources on the underlying theoretical ideas? It's not just graph theory, it's something like computational graph theory or maybe data flow but neither seems to be at the level of formalism I'd like.

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by PaulHoule on Saturday December 10, 2016 @03:50PM (#13147834)

You can execute that kind of task with a RETE engine: https://en.wikipedia.org/wiki/Rete_algorithm

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by dom0 on Saturday December 10, 2016 @04:33PM (#13148048)

> Rete algorithm (/ˈriːtiː/ REE-tee or /ˈreɪtiː/ RAY-tee, rarely /ˈriːt/ REET or /rɛˈteɪ/ re-TAY)

I guess we all can at least agree that there is a way to pronounce it :)

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by rch on Saturday December 10, 2016 @04:46PM (#13148124)

The first two forms are more correct, but the last two sound better. I say 'REET networks', so that's almost certainly wrong.

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by oblio on Saturday December 10, 2016 @04:50PM (#13148138)

The name seems to come from Latin and courtesy to my native Romanian aka "Slavicized Latin", it should be pronounced: reh-teh, short sounds for both syllables.

Of course, since now it's a loanword in English, you could also just use English rules for pronouncing it (whichever those are :) ).

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by rch on Saturday December 10, 2016 @05:09PM (#13148211)

Thanks - I'll try it out. You're correct that the term comes directly from Latin.

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by adamnemecek on Saturday December 10, 2016 @04:05PM (#13147916)

Is there something more general?

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by cjslep on Saturday December 10, 2016 @04:35PM (#13148064)

What do you mean by more general? Data in nodes in the RETE algorithm can be anything.

I highly recommend reading "Production Matching for Large Learning Systems"[0] as it was accessible enough for me to try to make a basic RETE implementation while learning C++ and playing around with several other technologies I was unfamiliar with[1].

[0]http://reports-archive.adm.cs.cmu.edu/anon/1995/CMU-CS-95-11...

[1]https://github.com/cjslep/cpp-rete-prototype (awful, abandoned prototype)

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by rch on Saturday December 10, 2016 @04:34PM (#13148054)

I've wondered about this as well. I'd want to cover ZDDs in addition to Rete (forward and back chaining).

https://en.wikipedia.org/wiki/Zero-suppressed_decision_diagr...

[ Parent | on HN ]

Re:Simplify Service Dependencies with Nodes by yxhuvud on Sunday December 11, 2016 @05:11AM (#13150417)

Petri nets? Those can be cyclical though - i don't know if there is a special name for acyclical nets.

Yet another instance of this is the Disruptor patter that use it in an event queue.

[ Parent | on HN ]