#273 closed defect (fixed)
Pairwise query construction is O(N*N)
| Reported by: | Richard Boulton | Owned by: | Olly Betts |
|---|---|---|---|
| Priority: | normal | Milestone: | 1.3.0 |
| Component: | Library API | Version: | SVN trunk |
| Severity: | normal | Keywords: | |
| Cc: | Blocked By: | ||
| Blocking: | Operating System: | All |
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
Change History (5)
comment:1 by , 16 years ago
| Milestone: | → 1.1.1 |
|---|
comment:3 by , 15 years ago
| Milestone: | 1.1.4 → 1.2.0 |
|---|
Bumping, a little reluctantly. But this isn't an issue unless you have a lot of subqueries, and there's a workaround (build a vector or similar of the subqueries and construct the Query from those).
comment:4 by , 13 years ago
| Milestone: | 1.2.x → 1.3.0 |
|---|
This should get fixed as part of the Query::Internal rewrite.
comment:5 by , 13 years ago
| Resolution: | → fixed |
|---|---|
| Status: | new → closed |
Note:
See TracTickets
for help on using tickets.
If this is still the case we should try to address it in the 1.1.x series, but it doesn't have to be done for 1.1.0.