Project

General

Profile

Bug #34

text matches in query algorithm don't span TEXT nodes

Added by Matt Jones over 19 years ago. Updated over 17 years ago.

Status:
Resolved
Priority:
Low
Assignee:
Category:
metacat
Target version:
Start date:
06/27/2000
Due date:
% Done:

0%

Estimated time:
Bugzilla-Id:
34

Description

When text sequences formthe document exceed the max field length of the database
filed (4000 characters for Oracle), we break the text into multiple, adjacent
TEXT nodes of 4000 characters each, with the last node containing the
remainder.Our current search algorithms only will find phrases within a single
TEXT nodes, so if the search term spans the node boundary, the search algorithm
will not return a hit. I expect this is extremely rare, basically
inconsequential, because text nodes > 4000 characters will be rare, and then the
search phrase has to cross the node boundary, both of which are improbable.

History

#1 Updated by Matt Jones over 19 years ago

Because it is improbable, will require major query algorithm changes to fix it,
and will have minor impact when encountered, I am not planning on fixing this
bug unless it becomes evident it is more significant than my initial assessment.

#2 Updated by Redmine Admin over 6 years ago

Original Bugzilla ID was 34

Also available in: Atom PDF