Subject: Re: OT: geometrical algorithm design
From: rpw3@rpw3.org (Rob Warnock)
Date: Sat, 16 Apr 2005 07:13:21 -0500
Newsgroups: comp.lang.lisp
Message-ID: <SeednbHeAez8nPzfRVn-1w@speakeasy.net>
Christopher C. Stacy <cstacy@news.dtpq.com> wrote:
+---------------
| But Prograph wasn't about ideograms, anyway; it's about diagrams.
+---------------

And dataflow & databases. One of the people working on it once
explained it to me as (at least partly) an attempt to create
a functional, dataflow version of relational algebra. That is
[if I'm remembering correctly], you could take a "Select" object
and plumb it into a database relation object and then plumb the
output of that into another database relation object and get a
wire coming out that had the query results of the "join" of the
relations (or something along those lines). The idea was to use
high-enough level models for the dataflow that you could get
significant parallelism going, just as another poster was asking for.
[I don't know if they ever got that far...]


-Rob

-----
Rob Warnock			<rpw3@rpw3.org>
627 26th Avenue			<URL:http://rpw3.org/>
San Mateo, CA 94403		(650)572-2607