On the cost of searching signature trees

https://doi.org/10.1016/j.ipl.2005.10.015Get rights and content

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.

References (16)

  • Y. Chen

    Signature files and signature trees

    Inform. Process. Lett.

    (March 2002)
  • D. Dervos et al.

    Comparison of signature file models with superimposed coding

    J. Inform. Process. Lett.

    (1998)
  • S. Abiteboul et al.

    Querying documents in object databases

    Internat. J. Digital Libraries

    (Jan. 1997)
  • A.V. Aho et al.

    The Design and Analysis of Computer Algorithms

    (1974)
  • S. Christodoulakis et al.

    Design consideration for a message file server

    IEEE Trans. Software Eng.

    (1984)
  • W.W. Chang, H.J. Schek, A signature access method for the STARBURST database system, in: Proc. 19th VLDB Conf., 1989,...
  • R.V. Churchill

    Operational Mathematics

    (1958)
  • P. Ciaccia et al.

    Declustering of key-based partitioned signature files

    ACM Trans. Database Systems

    (1996)
There are more references available in the full text version of this article.

Cited by (3)

1

The author is supported by NSERC 239074-01 (242523) (Natural Sciences and Engineering Council of Canada).

View full text