On 03/28/2012 08:49 PM, Ronny Möbius wrote:
I'm now interested in your general opinion about this: Is it surprising, that the XQuery implementation than the lxml/python one (For me it is, as I thought the indices etc. created when importing the data should decrease computational affords in searching the tree)? Is there some catch in my approach? May the reason be bad designing the query?
I suppose it relies heavily on the query and the query processor, rewritings, cost based analysis and index structures. Thus I suppose it would be the best to write the queries in a reply, such that the BaseX team can make suggestions for similar queries which better utilize index-structures and the query optimizations from the query processor. Maybe you can also create a database in memory which doesn't have to be persisted (plus deactivating certain indexes which are not needed).
kind regards, Johannes