I've added some Datalog material to the wiki:
http://code.google.com/p/clojure-contrib/wiki/DatalogOverview
On Wed, Feb 18, 2009 at 4:55 PM, Jeffrey Straszheim <
straszheimjeff...@gmail.com> wrote:
> Makes sense. That would work. It certainly looks cleaner.
>
>
> On Wed, Feb 18, 2009 at 4:51 P
Makes sense. That would work. It certainly looks cleaner.
On Wed, Feb 18, 2009 at 4:51 PM, Rich Hickey wrote:
>
>
>
> On Feb 18, 4:32 pm, Jeffrey Straszheim
> wrote:
> > Easy enough to do. The only drawback is I'd probably want to force it
> into
> > a hash during the query. For large datas
On Feb 18, 4:32 pm, Jeffrey Straszheim
wrote:
> Easy enough to do. The only drawback is I'd probably want to force it into
> a hash during the query. For large datasets (say 100,000 records) this
> might get expensive.
>
What I envisioned was that while this was the logical db, 'inserting'
a
Easy enough to do. The only drawback is I'd probably want to force it into
a hash during the query. For large datasets (say 100,000 records) this
might get expensive.
On Wed, Feb 18, 2009 at 4:13 PM, Rich Hickey wrote:
>
>
>
> On Feb 18, 3:51 pm, Jeffrey Straszheim
> wrote:
> > Yes. I've bee
On Feb 18, 3:51 pm, Jeffrey Straszheim
wrote:
> Yes. I've been thinking about a database layer that would support indexing,
> constraints, and so on. One step at a time.
Maybe I wasn't clear, I'm talking about the foundational layer.
Instead of:
(def data {
:table-1 #{ { :x 34 :y 33 } { :
Yes. I've been thinking about a database layer that would support indexing,
constraints, and so on. One step at a time.
(logic-rule (:fred :x ?x :y ?y) - (:sally :x ?x :z ?z) ("becky" :y ?y)
(not! :janet :qqq ?z) (if < ?x ?y))
Translated into positional notatio
On Feb 9, 8:46 am, Jeffrey Straszheim
wrote:
> No, but I'm really learning as I go here. I'll look into it.
>
> On Mon, Feb 9, 2009 at 7:58 AM, Rich Hickey wrote:
>
> > Looks like you're moving apace!
>
> > Have you considered query/subquery optimization instead of magic sets?
>
> > Rich
>
>
No, but I'm really learning as I go here. I'll look into it.
On Mon, Feb 9, 2009 at 7:58 AM, Rich Hickey wrote:
>
> Looks like you're moving apace!
>
> Have you considered query/subquery optimization instead of magic sets?
>
> Rich
>
> On Feb 8, 7:51 pm, Jeffrey Straszheim
> wrote:
> > By the
Looks like you're moving apace!
Have you considered query/subquery optimization instead of magic sets?
Rich
On Feb 8, 7:51 pm, Jeffrey Straszheim
wrote:
> By the way, if anyone on this list has experience implementing bottom-up
> optimizations for logic programs, particularly from the magic se
By the way, if anyone on this list has experience implementing bottom-up
optimizations for logic programs, particularly from the magic set family,
and is willing to assist, please contact me.
On Sun, Feb 8, 2009 at 7:47 PM, Jeffrey Straszheim <
straszheimjeff...@gmail.com> wrote:
>
> Stratified n
Stratified negation is working and in trunk.
I have some cool ideas of a simple, but powerful, way to implement
evaluable predicates. They'll likely make it in by midweek.
The the hard part (magic sets) begins.
On Feb 8, 11:43 am, Jeffrey Straszheim
wrote:
> I now have recursive queries worki
I now have recursive queries working. My next 3 milestones are stratified
negation, evaluable predicates, and then some version of magic sets
optimization. But now, as long as your queries are non-negated it is
working.
http://code.google.com/p/clojure-datalog/
--~--~-~--~~-
12 matches
Mail list logo
