claim
Prefix tries and inverted indexing are scalable data structures used for efficient dictionary lookups in large Web search engines.

Authors

Sources

Referenced by nodes (1)