Metacat

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.