On the cost of searching signature trees

  • Authors:
  • Yangjun Chen

  • Affiliations:
  • Department of Applied Computer Science, University of Winnipeg, Winnipeg, Manitoba, Canada

  • Venue:
  • Information Processing Letters
  • Year:
  • 2006

Quantified Score

Hi-index 0.89

Visualization

Abstract

A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatures, which match a given query signature. The methods used include a detailed study of probabilistic analysis in conjunction with suitable contour integration of complex variabled functions.