On Wednesday 05 September 2007 11:00, Christian Theune wrote: > b) provide a low-level query API that is rich enough to let different > query processors e.g. for SQL, xpath, ... work against them.
Having thought about this problem domain too (see my old work on ZOQLMethod), there is a big difference between relational- and tree-based querying. I wonder whether you can get both covered -- would be awesome though. :-) I would definitely be interested in seeing public discussion about the approach here. Some random thoughts that you probably know already: * The storage of indices should be pluggable like the ZODB. This would allow backends like pyLucene, BTree-based ones or even relational databases. * One of the big problems right now is that there is no efficient way to do inverses of searches. I think some time should be spent doing this. * I really like the API of hurry.query. I would love to see something like it as the backend for querying languages. I am really looking forward to what you will come up with! Regards, Stephan -- Stephan Richter CBU Physics & Chemistry (B.S.) / Tufts Physics (Ph.D. student) Web2k - Web Software Design, Development and Training _______________________________________________ For more information about ZODB, see the ZODB Wiki: http://www.zope.org/Wikis/ZODB/ ZODB-Dev mailing list - ZODB-Dev@zope.org http://mail.zope.org/mailman/listinfo/zodb-dev