in reply to Re: search data structures using SQL (upd: FP, LINQ, int vs ext DSL)
in thread search data structures using SQL

Cool. Thanks. By "basic", I mean SELECTs of not more than moderate complexity. No inserts/updates/deletes. What I'm imagining is that what I want can be done by any SQL engine available in Perl.

The data I have is definitely relationally structured; it's well normalized, and there are relation tables for many-to-many relationships.

So if I could do relational calculus using something other than SQL, that would be fine; but remember that I'm limited to whatever is available in a standard perl installation. ActiveState, I believe, though I'm not sure which version. Probably 5.12 or so.

  • Comment on Re^2: search data structures using SQL (upd: FP, LINQ, int vs ext DSL)

Replies are listed 'Best First'.
Re^3: search data structures using SQL ( FP, int DSL)
by LanX (Saint) on Nov 16, 2013 at 15:50 UTC
    Still don't know if you want an external or internal DSL.

    External means you need an interpreter (parser + compiler) for a string holding SQL.

    Internal means chaining/cascading Perl functions/methods with "SQL-like" names and semantics in combination with Perl builtins like shown before.

    I prefer the latter.

    > I mean SELECTs of not more than moderate complexity.

    Please gimme some explicit examples of those SQLs of "moderate complexity" and I'll be pleased to show an internal DSL approach built on FP.

    Cheers Rolf

    ( addicted to the Perl Programming Language)

[reply]

In Section Seekers of Perl Wisdom