[Xapian-tickets] [Xapian] #273: Pairwise query construction is O(N*N)

[Xapian]

#273: Pairwise query construction is O(N*N)
-------------------------+--------------------------------------------------
 Reporter:  richard      |       Owner:  olly    
     Type:  defect       |      Status:  new     
 Priority:  normal       |   Milestone:          
Component:  Library API  |     Version:  SVN HEAD
 Severity:  normal       |    Keywords:          
Blockedby:               |    Platform:  All     
 Blocking:               |  
-------------------------+--------------------------------------------------
 Combination of a list of queries using the pairwise query constructor
 currently takes O(N*N) time in the length of the list.  This is possibly
 due to the end_construction() method in the internals being O(N) in the
 number of subqueries.

 See http://thread.gmane.org/gmane.comp.search.xapian.cvs/6531/focus=1334
 for some more detail

-- 
Ticket URL: <http://trac.xapian.org/ticket/273>
Xapian <http://xapian.org/>
Xapian