<div>
<a href="http://en.wikipedia.org/wiki/Suffix_tree" rel="ugc">http://en.wikipedia.org/wiki/Suffix_tree</a>
</div>


http://en.wikipedia.org/wiki/Suffix_tree [http://en.wikipedia.org/wiki/Suffix_tree]

<div>
Forced accept.<br />
<br />
Computer101<br />
EE Admin
</div>


<div>
<div class="content wysiwyg-content">
I am looking for any component/algorithm/method<wbr /> which i can use in my VB2005 application for quick Text searching from a Text file.<br />
Right now i am using some typical functions like string comparison and seek but their response time is too much.I want to search the text with every letter the user type in without causing so much burden to the processor.<br />
Please do guide me in this matter. <br />
<br />
Reagards,<br />
HR
</div>
</div>


I am looking for any component/algorithm/method which i can use in my VB2005 application for quick Text searching from a Text file.
Right now i am using some typical functions like string comparison and seek but their response time is too much.I want to search the text with every letter the user type in without causing so much burden to the processor.
Please do guide me in this matter. 

Reagards,
HR

Component/method for text searching

The .NET Framework is not specific to any one programming language; rather, it includes a library of functions that allows developers to rapidly build applications. Several supported languages include C#, VB.NET, C++ or ASP.NET.

.NET Programming

Programming includes both the specifics of the language you’re using, like Visual Basic, .NET, Java and others, but also the best practices in user experience and interfaces and the management of projects, version control and development. Other programming topics are related to web and cloud development and system and hardware programming.

Programming

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.