[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:  closed
 Priority:  normal       |         Milestone:  1.3.0
Component:  Library API  |           Version:  SVN trunk
 Severity:  normal       |        Resolution:  fixed
 Keywords:               |        Blocked By:
 Blocking:               |  Operating System:  All
-------------------------+------------------------------
Description changed by mariakatosvich:

Old description:

> 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

New description:

 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
 http://www.qwiknumbers.com/vodafone-customer-service-number

--

--
Ticket URL: <https://trac.xapian.org/ticket/273#comment:6>
Xapian <//xapian.org/>
Xapian