On the cost of searching signature trees

DOI10.1016/J.IPL.2005.10.015MaRDI QIDQ845663zbMATH OpenOpenAlexFDO

Authors Yangjun Chen

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.10.015

zbMATH Keywords

indexdata structurescontour integrationsignature filesprobabilistic analysissignature identifierssignature trees

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Improved methods for signature-tree construction
• Partial match retrieval of multidimensional data
• Digital Search Trees Revisited
• Comparing inverted files and signature files for searching a large lexicon
• Signature files and signature trees.

Cites work

• scientific article; zbMATH DE number 3119559 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Comparison of signature file models with superimposed coding
• On the computational power of pushdown automata
• Partial match retrieval of multidimensional data
• Signature files and signature trees.

Cited in

(5)

• A method for improving full text search using signature files
• The Optimization of Signed Trees
• On connected graphs having the maximum connective eccentricity index
• Signature files and signature trees.
• Improved methods for signature-tree construction

This page was built for publication: On the cost of searching signature trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845663)