Fast searches in a recommendation session

Authors:
Yingwei Wang;N. Cercone
Affiliations:
School of Computer Science, University of Waterloo Waterloo, Ontario N2L 3G1, Canada;School of Computer Science, University of Waterloo Waterloo, Ontario N2L 3G1, Canada
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2002

Citing 2
Cited 1

PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Trie memory

Communications of the ACM

A hybrid expert system for equipment failure analysis

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

In this paper, we introduce a recommendation session and propose a data structure (recommendation Patricia) which is used to accomplish fast searches in a recommendation session. The time cost for a search in each recommendation step is O(E * s^2) if a recommendation Patricia is used, where E is the maximal length of words involved and s is the maximal size of each recommendation. In contradistinction, the worst-case time cost for the same goal is @W(n) if a Patricia is used, where n is the number of words involved.