On the cost of searching signature trees

DOI10.1016/J.IPL.2005.10.015zbMATH Open1184.68200OpenAlexW2157638725MaRDI QIDQ845663FDOQ845663

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

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.

zbMATH Keywords

indexdata structurescontour integrationsignature filesprobabilistic analysissignature identifierssignature trees

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• On the computational power of pushdown automata
• Comparison of signature file models with superimposed coding
• Title not available (Why is that?)
• 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)