Fundamental limits for information retrieval

DOI10.1109/18.887844MaRDI QIDQ2705958zbMATH OpenOpenAlexFDO

Authors John T. Coffey, Matthew Klimesh

Publication date 19 March 2001

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7d07e20ba424479401fb42c5ec484130b4114ab3

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Information theory (general) (94A15)

Recommendations

• Information storage and search complexity theory
• Rate–Distortion Approach to Databases: Storage and Content-Based Retrieval
• Estimation of the required-to-actual time ratio of information storage in databases with limited memory size
• On the capacity of permanent memory
• Optimal information retrieval when queries are not random

Cited in

(9)

• Information retrieval with unambiguous output
• Information storage and search complexity theory
• Foundation of information retrieval
• Memory versus error trade-offs in binary-valued retrieval problems
• Rate–Distortion Approach to Databases: Storage and Content-Based Retrieval
• scientific article; zbMATH DE number 1984564 (Why is no real title available?)
• scientific article; zbMATH DE number 2065269 (Why is no real title available?)
• Information retrieval and the average number of input clues
• Estimation of the required-to-actual time ratio of information storage in databases with limited memory size

This page was built for publication: Fundamental limits for information retrieval

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