Known-item search¶
Known-item search is retrieval undertaken with a particular target item already in mind and identifiable by attributes such as author or title.
Core Idea¶
A known-item search is an information-retrieval task in which the searcher already has a particular target item in mind and seeks to locate its record or accessible instance. The target's identity is prior to the query, even when the searcher remembers only some identifying attributes. In a library catalog, an author, title, publication detail, or combination of partial bibliographic cues can be used to recover the intended book, article, or other work.
Scope of Application¶
Known-item search applies to retrieval episodes in which a searcher has a determinate information object in mind before querying and success requires recovering that particular record or accessible instance, even when its identifying cues are incomplete or inaccurate. - Library catalogs. Searches by known author, title, edition detail, or partial bibliographic combination are the concept's originating habitat. - Bibliographic databases. Article, book, proceedings, and report records can be recovered from remembered creator, title, venue, date, or citation fragments. - Web search. A user may seek one previously encountered page, document, image, or site using remembered phrases, creator names, URLs, or content details. - Digital libraries and archives. Known manuscripts, recordings, photographs, datasets, or other collection objects are sought through descriptive metadata and indexed content.
Clarity¶
Known-item search makes success item-specific rather than merely topical. A result can be highly relevant to the remembered subject and still fail if it is not the particular book, article, page, or file intended before the query began. Partial author, title, phrase, date, site, or content cues are evidence used to recover that identity; they need not themselves be exact or complete.
Manages Complexity¶
A catalog or web index may contain millions of topically related records, while the searcher may remember only fragments of one intended item. Known-item search reduces that retrieval problem to a target identity, a set of recalled discriminating cues, the fields or representations against which those cues can match, and an item-specific success condition. A searcher or evaluator can then read off whether reformulation is resolving an author, title, phrase, creator, date, or site variation—and whether the intended record was recovered rather than merely a relevant neighbor.
Abstract Reasoning¶
Diagnostic inference moves from a determinate intended item, the searcher's recalled cues, and the returned records to the kind and likely location of a retrieval failure. Results about the right subject but not the intended item show failure under the item-specific criterion; a recognizable target absent under one spelling, title form, or creator name directs attention toward cue variation, metadata, or indexing rather than toward topical relevance alone. Interventionist inference moves from changing the query's identifying cues to a prediction about the candidate records exposed by the retrieval system.
Knowledge Transfer¶
Within information retrieval, known-item search transfers across catalogs, archives, websites, and file systems when the searcher has a target before querying. Prior identity, recalled cues, searchable fields, representations, reformulation, candidates, and item-specific success carry intact; diagnostics distinguish cue mismatch, metadata or indexing failure, access failure, and merely topical relevance. Locating a known person or object shares target recovery, but indexed collections, query interfaces, records, and document identity remain home-bound. Exploratory or topical search is not a weak instance: if any useful item about a topic can satisfy the search, known-item metrics and reformulation diagnostics no longer transfer.
Relationships to Other Abstractions¶
Current abstraction Known-item search Domain-specific
Parents (1) — more general patterns this builds on
-
Known-item search is a kind of Search and Retrieval Prime
The remembered item supplies a determinate information need; the catalog, archive, web index, or file system supplies the search space; recalled author, title, phrase, date, or other cues supply the matching criteria; indexes and query reformulation perform traversal; ranked records form the candidate set; and access to the intended record is the retrieval outcome.
Hierarchy paths (4) — routes to 3 parentless roots
- Known-item search → Search and Retrieval → Problem Space → Representation → Abstraction
- Known-item search → Search and Retrieval → Trade-offs → Constraint
- Known-item search → Search and Retrieval → Problem Space → State and State Transition → Phase Space
- Known-item search → Search and Retrieval → Problem Space → Problem Representation → Representation → Abstraction
Neighborhood in Abstraction Space¶
Known-item search sits in a sparse region of the domain-specific corpus (73rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Memory Encoding & Retrieval Effects (20 abstractions)
Nearest neighbors
- Google Effect — 0.84
- Recall (Memory) — 0.84
- Transfer-Appropriate Processing — 0.84
- Telescoping Effect — 0.83
- Latent Learning — 0.83
Computed from structural-signature embeddings · 2026-10-08