Plenary Lecture

Multi-Key Search Algorithms - A new Paradigm in Algorithm Design

Professor Ahmed Tarek
Department of Math & Computer Science
CUP (California University of Pennsylvania)
PA 15419, USA
E-mail: tarek@cup.edu

Abstract: This talk is a consolidated representation of my recent research findings. Search algorithms are fundamental to the computing sciences with intensive database applications. So far, a significant amount of efforts has been set forth to improving the computer-based search strategies. Multi-element search techniques are relatively new in computer science. I have introduced this concept at the 8th World Multi-Conference on Systemics, Cybernetics and Informatics back in 2004. The multiple key search algorithms may effectively be combined with the traditional concepts prevailing in the data structure literature to optimize the computer-based resource requirements for certain applications. Further research in this area has appeared to be appealing in integrating these concepts with the traditional designs prevailing in the algorithmic. Among the most useful search algorithms, interpolation search uses the concept of projection for equally separated elements inside a given list. An extended multiple key interpolation search algorithm is developed and implemented, which has time and computational memory requirements much less than the other algorithms in this class with multiple key search criteria and equally separated list of elements. The idea of Block Search is to subdivide a given list of sorted elements into equally sized blocks, and then restrict the search effort into one of these blocks. The concept pertaining to multiple search elements fits nicely with the idea prevailing in Block Search. This hybrid algorithm has the best performance whenever an element to search for exists at each division point of each independent block within the current tier. In that event, the time required by the new algorithm is linear, and proportional to the number of elements to look for. It is also possible to sub-divide each independent block into multiple numbers of sub-blocks and then reapply the multiple element block search strategy to each independent block containing a number of sub-blocks. Though this increases the complexity of algorithm design, but due to the improved efficiency, the algorithm will require substantially less computational resources. The optimum number of tiers for the computational resources requirements is also investigated. The basic binary search technique may be combined with the multi-tier multiple key block search strategy.

Brief Biography of the Speaker:
Dr. Ahmed Tarek is an Associate Professor of Computer Science, Computer Science Program Chair and the B.S. in Computer Science Accreditation Leader at California University of Pennsylvania (also called the Cal U). He is currently affiliated with Cal U’s Department of Math and Computer Science in the Eberly College of Science & Technology. Prior to joining the Cal U faculty, Dr. Tarek has taught Computer Science to both the graduate and the undergraduate programs at Eastern Kentucky University for a number of years.
Dr. Tarek’s research interests include but are not limited to design and analysis of algorithms, data structures, discrete computational structures, computational complexity, software engineering, real-time software systems and operating systems. So far he has published more than 20 papers in different international journals and conference proceedings. Besides, he has also made a number of presentations to different international conferences and symposiums, and served as the Session Chair to a number of conference sessions.
Right from the beginning of his professional career till today, Dr. Tarek has taught a number of graduate and undergraduate Computer Science, Computing Sciences and Information Sciences courses to different US and British universities abroad. For his achievements, he has been recognized by the Marquis Publications in the United States of America. His biography has regularly appeared in Marquis Publications’ Who’s Who in Science and Engineering since it’s 9th edition, Who’s Who in the World since the 25th Silver Anniversary Edition and also in the Who’s Who in America since the 61st edition.
For his contributions to the education and the academia, he has been recognized by the editorial board of the International Biographical Centre (IBC) at Cambridge in England by providing Membership to the IBC in 2008. IBC has decreed him as the IBC’s Leading Educator of the World, 2008 and the IBC’s Leading Scientist of the World, 2008. IBC has also granted him the 21st Century Award for Achievement. His biography has been included in the IBC’s Cambridge Blue Book, 2000 Outstanding Intellectuals of the 21st Century, and also in the Dictionary of International Biography.
He is a faculty member of the Upsilon-Pi-Epsilon (UPE), the National Honor Society in Computing Sciences, which is the Texas A & M University, College Station, Texas-based computing sciences society.