What are the applications of Tries
2. Symbol table maintenance: A symbol table is a data structure used in the language translators such as compilers or interpreters. A symbol table consists of the address location, syntax and semantic information of the identifier, type and scope of the identifier. To maintain all the identifiers’ information, the compilers or interpreters use tries procedure in the form of hash tables.
2. Symbol table maintenance: A symbol table is a data structure used in the language translators such as compilers or interpreters. A symbol table consists of the address location, syntax and semantic information of the identifier, type and scope of the identifier. To maintain all the identifiers’ information, the compilers or interpreters use tries procedure in the form of hash tables.
Ans
Tries find numerous applications. Some of them are explained
as follows:
1. Tries in the Web search engines: Tries
can be used to store and maintain the index words and the relevant Web site
address. In the Web search process the users query the index words, the search
engine has to fetch the appropriate links as results. In this process the
search engines maintain the table of index words to the Web link or Web site
address. To maintain a sequence of words as the index, the search engines
follow the tries procedure for quick retrieval of appropriate information.
No comments:
Post a Comment