A high-speed dynamic full-text search method by using memory management

DOI10.1080/00207160412331296643MaRDI QIDQ4652853zbMATH OpenOpenAlexFDO

Authors

Publication date 28 February 2005

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160412331296643

zbMATH Keywords

Adaptive block managementBi-gram indexFull-text searchInverted file searchUni-gram index

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1003303
• scientific article; zbMATH DE number 1979483
• Breaking a time-and-space barrier in constructing full-text indices
• An improved query time for succinct dynamic dictionary matching
• Proximity full-text searches of frequently occurring words with a response time guarantee
• A time and space efficient data structure for string searching on large texts

Cites work

• A fast string searching algorithm
• An approximate string-matching algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 872102 (Why is no real title available?)
• On the balance property of Patricia tries: External path length viewpoint

This page was built for publication: A high-speed dynamic full-text search method by using memory management

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