Optimal high-performance parallel text retrieval via fat-trees

DOI10.1007/S002240000133MaRDI QIDQ1125796zbMATH OpenOpenAlexFDO

Authors B. Mamalis, B. Tampakas, P. G. Spirakis

Publication date 3 January 2000

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000133

zbMATH Keywords

parallel free-text retrieval method

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 1849121
• Parallel retrieval of dense vectors in the vector space model
• scientific article; zbMATH DE number 1792104
• scientific article; zbMATH DE number 2036272
• Information retrieval on an SCI-based PC cluster

Cited in

(8)

• scientific article; zbMATH DE number 1954442 (Why is no real title available?)
• scientific article; zbMATH DE number 1543031 (Why is no real title available?)
• scientific article; zbMATH DE number 1975055 (Why is no real title available?)
• scientific article; zbMATH DE number 1849121 (Why is no real title available?)
• Sync/Async parallel search for the efficient design and construction of web search engines
• Parallel retrieval of dense vectors in the vector space model
• scientific article; zbMATH DE number 1946281 (Why is no real title available?)
• Information retrieval on an SCI-based PC cluster

This page was built for publication: Optimal high-performance parallel text retrieval via fat-trees

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