Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

NAIVE APPROACH TO SEARCH NEGATIVE CONTENT

Annotation

Were discussed the possibility of full-text search algorithms inappropriate content on Web pages. It shown, for average size of web pages and random visits to sites with negative content effectively search should be organized with the naive approach.

Keywords

search; content

Full-text in one file

Download

UDC

004.056

Pages

457-461

References

1. Knuth D.E., Morris (Jr) J.H., Pratt V.R. Fast pattern matching in strings // SIAM Journal on Computing. 1977. V. 6. № 1. R. 323-350. 2. Boyer R.S., Moore J.S. A Fast String Searching Algorithm // Commu-nications of the ACM. 1977. V. 20. P. 762-772. 3. Horspool R.N. Practical fast searching in strings // Software – Practice and Experience. 1980. V. 10. P. 501-506. 4. Baeza-Yates R.A. Algorithms for string searching // ACM SIGIR Forum. 1989. V. 23. № 3-4. R. 34-58. 5. Sunday D.M. A very fast substring search algorithm // Communications of the ACM. 1990. V. 33. № 8. R. 132-142. 6. Smith P.D. Experiments with a very fast substring search algorithm // Softw. Pract. & Exper. 1991. V. 21. № 10. R. 1065-1074. 7. Cantone D., Faro S. Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm // Second International Workshop on Experimental and Efficient Algorithms. 2003. V. 2647. R. 47-58. 8. Shan Y., Jiang Y., Tian S. Improved Pattern Matching Algorithm of BMHS for Intrusion Detection // Computer Engineering. 2009. V. 35. R. 170-173. 9. Akhtar R., Nilay K. Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value) // International Journal of Computer Applications. 2013. V. 72. R. 1-6. 10. Jaiswal M. Accelerating Enhanced Boyer-Moore String Matching Algorithm on Multicore GPU for Network Security // International Journal of Computer Applications. 2014. V. 97. № 1b. R. 30-35. 11. Smith G. de V. A comparison of three string matching algorithms // Softw. Prat. & Exper. 1982. V. 12. R. 57-66. 12. Davies G., Bowsher S. Algorithms for pattern matching // Software-Practice and Experience. 1986. V. 16. № 6. R. 575-601. 13. Pirklbauer K. A study of pattern-matching algorithms // Structured Programming. 1992. V. 13. R. 89-98. 14. Apostolico Z.A. Galil Pattern Matching Algorithms. Oxford: Oxford University Press, 1997. 377 p. 15. Charras C., Lecroq T. Hanbook exact string matching algorithms // College Publications. 2004. 256 r. 16. The Fastcode Challenges. URL: http://fastcode.sourceforge.net/ (data obrashhenija: 01.02.2015). 17. Http Archive // Interesting stats. Choose a run: 1 Feb 2015. URL: http://httparchive.org/interesting.php?a=All&l=Feb%201%202015 (data obrashhenija: 01.02.2015) 18. Stein M.L. Interpolation of Spatial Data: Some Theory for Kriging. Springer-Verlag, 1999. 249 r.

Received

2015-03-05

Section of issue

Physics and production engineering

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.