There are proposed method of acceleration of large string search in database of learning management system.

We present a linear-space data structure that maintains a dynamic set of n points with coordinates of real numbers on the plane to support orthogonal range counting, as well as insertions and deletions, in O(( lgn lg lgn )) time. This provides faster support for updates than previous results with the same bounds on space cost and query time. We also obtain two other new results by considering t...

Phrase browsing interfaces based on hierarchies of phrases extracted automatically from document collections offer a useful compromise between automatic full-text searching and manually-created subject indexes. The literature contains descriptions of such systems that many find compelling and persuasive. However, evaluation studies have either been anecdotal, or focused on objective measures of...

A set of n colored objects (points/hyperboxes) lie in IR and given a query orthogonal range q, we need to report the distinct colors of the objects in S ∩ q. In a scenarto where these colored objects also come associated with a weight, for each distinct color c of the objects in S ∩ q, the tuple < c, F(c) > where F(c) is the object of color c with the maximum weight is reported.

We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in , we achieve query time using space , where denotes the number of stored points and the number of points to be reported. For the range reporting problem on an ! " grid, we achieve query time # $ % & using space ' ( . For the two-dimensional se...

Citation searching has been available for decades, although in a limited form. This article discusses the advantages and limitations of searching by cited references, and also some alternatives in searching for cited references, before presenting a case study involving citation searching in full-text indexes.

In this paper we consider range-aggregate query problems wherein we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain aggregation function on the objects S′ = S ∩ q can be answered efficiently. Range-aggregate version of point enclosure queries, 1-d segment intersection, 2-d orthogonal segment intersection (with/without distance constraint) ar...