Data and Information

Databases, information retrieval, and data science.


foundation tier

Data and Information addresses databases, information retrieval, and data science. It sits within Computer Science and inherits that area’s core questions about correctness, scale, and tractability. This page surveys the conceptual axes of the topic and points to the references that frame ongoing research and teaching. The intent is to be useful both as an entry point for newcomers and as an index for practitioners cross-checking their mental model against the field’s primary sources.

Work on data and information can be organised around a few interlocking concerns: the formal objects under study, the algorithms or systems that compute over them, the resource trade-offs (time, memory, communication, statistical efficiency), and the empirical or theoretical guarantees that practitioners rely on. The sources cited below approach the topic from a mix of these angles.

Foundational references

Silberschatz, Database System Concepts (2019) is a standard reference for this material and is used both as a curriculum anchor and as a long-form survey of techniques. Manning, Introduction to Information Retrieval (2008) is a standard reference for this material and is used both as a curriculum anchor and as a long-form survey of techniques.

Open methodological questions in data and information cluster around how to compose the techniques above under realistic constraints — scale, adversarial inputs, partial observability, and shifting workloads. The cited references give the precise statements, proofs, and empirical evaluations that this overview only sketches; downstream topic pages drill into specific subfields.

Prerequisites

Sources

In context

Where this topic sits in the prerequisite graph. Click any node to jump.

Open in full atlas →

Explore

  1. 01

    Databases

    Database systems, query languages, and storage engines.

  2. 02

    Information Retrieval

    Indexing, ranking, and search systems.

  3. 03

    Vector Search

    Index structures and query algorithms for approximate nearest neighbor search over high-dimensional embedding vectors, the methodological core of modern vector databases and dense retrieval systems.

  4. 04

    Data Science

    Methods and tools for extracting knowledge from data.


Review this topic

This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.