determine the running time of algorithm suffixtriematchwe make the following observationswe process at most nodes of the trie each node processed has at most children at each node processedwe perform at most one character comparison for each child of to determine which child of needs to be processed next (which may possibly be improved by using fast dictionary to index the children of vwe perform at most character comparisons overall in the processed nodes we spend ( time for each character comparison performance we conclude that algorithm suffixtriematch performs pattern matching queries in (dmtime (and would possibly run even faster if we used dictionary to index children of nodes in the suffix trienote that the running time does not depend on the size of the text alsothe running time is linear in the size of the patternthat isit is ( )for constant-size alphabet hencesuffix tries are suited for repetitive pattern matching applicationswhere series of pattern matching queries is performed on fixed text we summarize the results of this section in the following proposition proposition let be text string with characters from an alphabet of size we can perform pattern matching queries on in (dmtimewhere is the length of the patternwith the suffix trie of xwhich uses (nspace and can be constructed in (dntime we explore another application of tries in the next subsection search engines the world wide web contains huge collection of text documents (web pagesinformation about these pages are gathered by program called web crawlerwhich then stores this information in special dictionary database web search engine allows users to retrieve relevant information from this databasethereby identifying relevant pages on the web containing given keywords in this sectionwe present simplified model of search engine