EXTENDING THE PERFORMANCE AND QUALITY OF SEARCHENGINE VIA SOFTWARE TEST CASE GENERATION.
Keywords:
Search Engine, Class Level Testing, Specification Based Class Specification, state-space partition, Test Model, Test Case GenerationAbstract
Nowadays, millions of millions of information has been uploaded through the web in different specialization. Such huge amount of information makes difficult for the normal search methods to be effective. This paper discusses search engine in general perception, refinement of search, software components of search engine and finally the detailed way of working of a search engine by an extensive modular architecture of the Search engine and how it can be improved through software testing. The paper suggests new technique for the search engine based on the object oriented architecture. Procedural oriented, structural oriented and object oriented are the general techniques, which are adopted to solve the given statements of the problem. Out of these three techniques, object oriented techniques are broadly used, as they better describe the objects and flexibility to maintain. This paper attempts to demonstrate the power of object oriented software testing at class level, a disciplined approach to improve the product search engine, which is very powerful tool of knowledge engineering and management. In this paper the modular architecture of a search engine is analyzed in an extensive manner with its working. The object oriented technique is analyzed to implement the SearchQueryProcessing class of the search engine. A technique based on class specification is also developed that can be used to generate the test cases at class level testing for object oriented programs. The paper explained how to get the best out of the Internet, working of a search engine in general perception, refinement of search, software components of search engine and finally the detailed way of working of a search engine by an extensive modular architecture of the Search engine. Based on this technique a test model is also developed for generation of test cases. The actual intended behavior is represented by the test model because it is based on the class specification.Although this paper includes discussion of all the test cases of the most crucial class of the search engine, the rest of the classes need to be tested and improvised by the methodology discussed in the paper. Through this paper an attempt is made to implement Object Oriented Approach to improve the performance of the search engine class.
References
B¨uttcher, S., Clarke, C. L. A. (2006), “A document-centric approach to static index pruning in text retrieval systems”, In Proceedings of the 15th ACM International Conference on Information and Knowledge Management (CIKM’06), (pp. 182–189), ACM, New York, NY
Bernot, G., Gaudel, M.C., & Marre, B. (1991), “Software testing based on formal specifications: a theory and a tool”, Software Engineering Journal, 6(6), 387-405
Brin, S., Lawrence (2000), “The Anatomy of a Large-Scale Hyper textual Web Search Engine” Sergey, page@cs.stanford.edu, Computer Science Department, Stanford University, Stanford, CA 94305}
Cameron, R.D. (2001), “Information Retrieval and Search” Retrieved on 01st April,2009, Available at: http://www.cs.sfu.ca/~cameron/Teaching/D-Lib/IR.html
Carrington, D., & Stocks, P. (1994), “A tale of two paradigms: formal methods and software testing”, Proceedings of 8th Annual Z User Meeting (ZUM ‘94), J.P. Bowen and J.A. Hall (eds.), Workshops in Computing (pp. 51-68). Springer-Verlag, Berlin
Chen, T.Y., & Yu, Y.T. (2002), “A decision-theoretic approach to the test allocation problem in partition testing”, IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 32(6), 733-745
Crnkovic, F., J. K., Larsson, M., & Lau, K. K. (2000), “Object-oriented design frameworks: Formal specification and some implementation issues”, Proceedings of 4th IEEE International Baltic Workshop, Vol. 2, (pp. 63—77)
Doong, R.K., & Frankl, P. (1991), “Case Studies in Testing Object-Oriented Software”, Testing, Analysis, and Verification Symposium, Association for Computing Machinery, (pp. 165 – 177). New York
Doong, R.K., & Frankl, P. (1994), “The ASTOOT approach to testing object-oriented programs”, ACM Transactions on Software Engineering and Methodology,3(2), 101-130
Enge, E. (2009), “Search Engine Visibility and Site Crawlability, Part 1”, on 1st April, 2009, Available at: http://searchenginewatch.com/3627930.
Guttag, J. V., & Horning, J. J., Garland, S.J., Jones, K.D., Modet, A., & Wing, J.M. (1993), “Larch: languages and tools for formal specification”, Texts and Monographs, Computer Science series NY: Springer-Verlag
Harrold, M.J., McGregor, J.D., & Fitzpatrick, K.J. (1992), “Incremental testing of object-oriented class structures”, Proceedings of the 14th International Conference on Software Engineering (pp. 68 – 80
Hoare, C. A. R. (1969), “An axiomatic basis for computer programming”, Comm. ACM, 12(10), 576-583
Long, X., Suel, T. (2005), “Three-level caching for efficient query processing in large web search engines”, In Proceedings of the 14th International World Wide Web Conference (WWW’05). ACM, New York, NY, 257–266
McCown, F., Nelson,M. L. (2007), “Agreeing to disagree: Search engines and their public interfaces”, In JCDL ’07: Proceedings of the 2007 Conference on Digital Libraries. 309–318
McGregor, J.D., & Korson, T.D. (1994), “Testing the polymorphic interactions of classes” Technical Report No- TR-94-103, Clemson University
Murphy, G.C., Townsend, P., & Wong, P.S. (1994), “Experiences with cluster and class testing”, Communications of the ACM, 37(9), 39 – 47
Nirmal Gupta, Dinesh Saini, Hemraj Sain (2008), “ Class Level Test Case Generation in Object Oriented Software Testing”, Int. J. of Information Technology and Web Engineering, 3(2), 18-26, April-June 2008
Tomkins, A., Xu, Y. (2006), “Estimating corpus size via queries”, In Proceedings of the 15th ACM International Conference on Information and Knowledge Management (Arlington, VA), (pp. 594–603), ACM. New York
Tsegay, Y., Turpin, A., Zobel, J. (2007), “Dynamic index pruning for effective caching”, In Proceedings of the 16th ACM conference on Conference on Information and Knowledge Management (CIKM’07). ACM, New York, NY, 987–990
VanderBrug, G. J., & Minker, J. (1975), “State-space problem-reduction, and theorem proving—some relationships”, Commun. ACM, 18(2), 107-119
Weyuker, E. J., & Jeng, B. (1991), “Analyzing partition testing strategies”, IEEE Trans. Softw. Eng., 17(7), 703-711
Wieringa, R. (1998), “A survey of structured and object-oriented software specification methods and techniques”, ACM Comput. Surv., 30(4), 459-527
Wing, J.M. (1983), “A two-tiered approach to specifying programs”, Technical Report TR-299, Mass. Institute of Technology, Laboratory for Computer Science.
Zhang, J., Long, X., Suel, T. (2008), “Performance of compressed inverted list caching in search engines”, In Proceedings of the 17th International World Wide Web Conference (WWW’08). ACM, New York, NY, 387–396.
Downloads
Published
Issue
Section
License
Copyright (c) 2011 International Journal of Computer Science and Engineering Research and Development (IJCSERD)

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.




