AWhat changed
Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library.
Scientific scope
Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library. The compressed branching structure assumes the stated string/key representation and access operations. Search cost depends on key length and representation; it is not constant-time arbitrary-string lookup or a cryptographic data-integrity scheme. Updates and memory costs must be accounted for. Later trie variants retain separate credit.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Donald R. Morrison · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction