Boolean Methods in High-Performance Text Search

Modern information retrieval systems build large indices that support search queries with Boolean operators. Performance optimization raises interesting challenges in terms of processing Boolean formulas, while the evolution of search applications calls for new features. In this talk, we briefly review how modern search systems operate and discuss some of the Boolean challenges encountered in production-bound work.

Bio: Igor L. Markov is a professor of Electrical Engineering and Computer Science at the University of Michigan on leave at Google. He received a Ph.D. in Computer Science from UCLA, is currently an IEEE Fellow, and an ACM Distinguished Scientist. He served on editorial boards of several ACM and IEEE Transactions, and chaired tracks at DAC, ICCAD, ICCD, DATE and GLSVLSI. Prof. Markov's research is in applied algorithms, large-scale optimization, and computers that make computers. He has co-authored five books, four US patents, and over 200 refereed publications. During the 2011 redesign of the ACM Computing Classification System, Prof. Markov led the effort on the Hardware tree. He is the recipient of the NSF CAREER award, IEEE CEDA Early Career Award and ACM SIGDA Outstanding New Faculty Award.