On Oct 2, 2:55 am, Ross Gayler <r.gay...@gmail.com> wrote: > I am looking at the possibility of finding/building a declarative data > aggregation language operating on a small relational representation. > Each query identifies a set of rows satisfying some relational > predicate and calculates some aggregate function of a set of values > (e.g. min, max, sum). There might be ~20 input tables of up to ~1k > rows. The data is immutable - it gets loaded and never changed. The > results of the queries get loaded as new rows in other tables and are > eventually used as input to other computations. There might be ~1k > queries. There is no requirement for transaction management or any > inherent concurrency (there is only one consumer of the results). > There is no requirement for persistent storage - the aggregation is > the only thing of interest. I would like the query language to map as > directly as possible to the task (SQL is powerful enough, but can get > very contorted and opaque for some of the queries).
Two things probably worth mentioning in case you weren't aware of them. With most clojure build tools you can pull in a full relational database system such as H2, HSQLDB or Apache Derby and run an in memory database. Incanter (a R like platform for clojure) supports select and group-by on its datasets. With Incanter you can also plot pretty graphs etc. Saul -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
