0

I am new to Java . My problem is I have to select the rows of an entire file (Size less than 70MB) to match my pattern (e.g.<subject> <Predicate> <Object>). Currently I am using basic string matching algorithm bit it takes time so I want to use "Boyer-Moore algorithm". Is it good to use? Do we have some other better solution? If yes Please let me know and the code also in Java.

Improve this question
1
  • 1
    Try to put some sample code so we can suggest improvements Commented May 11, 2011 at 8:24

3 Answers 3

Reset to default
2

A quick Google returned:

Maybe you simply give it a try and see the results.

Improve this answer
Sign up to request clarification or add additional context in comments.

Comments

2

I did some work on this a long time ago.I found the Knuth-Morris-Pratt algorithm faster than Boyer-Moore.

Improve this answer

Comments

0

JEval is an advanced library for adding high-performance, mathematical, Boolean and functional expression parsing and evaluation to your Java applications

Improve this answer

1 Comment

Thanks for your reply...Do you think it will perform better string matching with a big file from its counter part like "Boyer-Moore algorithm"?

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.