← Back to catalogue
Research draft

data structure

vr.tr.data-structure · INF.KNW

Let an agent handle data structures by type, operations, complexity and use cases.

Thing Registry Information and virtual systems

Research draft, second pass

A second pass drafted this model: the structure a model of this thing needs, and what is known about it in the world. The line under this one says how the second half was obtained - researched against sources, or recalled without web access, in which case nothing here was read anywhere and every claim is a lead to verify. Unreviewed either way.

written by Claude from model knowledge without web access - no source was read, every claim is a lead to verify

Researched by: Claude

Purpose and description

Let an agent handle data structures by type, operations, complexity and use cases.

A way of organising and storing data in a computer so it can be accessed and modified efficiently, such as arrays, linked lists, trees, graphs, hash tables and semantic networks.

What it is for: Efficient storage and retrieval of data in software.

It can be choose a structure for a task; implement and test it; analyse operation complexity; serialise and persist it.

Distinguishing features

Organises data for operations

Trade-offs in time and memory

Abstract data types versus implementations

Language-independent

What it looks like

Diagrams of nodes and links, tables and code.

How it is recognised

Names such as tree, heap, hash table

Operation complexity tables

Semantic networks are knowledge structures

Related models

is a kind of - category

software component and structure

is used by - counterpart

algorithm

is studied in - field

computer science

implements - concept

abstract data type

In practice

Families and kinds

linear structures: arrays, lists, stacks, queues

trees and heaps

hash tables

graphs and networks

persistent and concurrent structures

Failure modes and hazards

Wrong structure causing slow performance

Memory leaks

Concurrency bugs

Also called

codebookword netsemantic networkdefinitional networkassertional networkperson-persistent databit arrayarray data structuresystem imagevirtual objectdata framecontinuationprocess control blockmappage tablecircular bufferprobabilistic data structurePython tupleindex structureIliffe vectorimplicit data structurehash treedevice treeRetroactive data structuressymbol tablefeature dataconflict-free replicated data typetriangulated irregular networkpersistent data structureintermediate representationgraph data structureUser Electronic SignatureConc-Tree listJudy arraypurely functional data structureLinear Data SetThread control blockBridge Protocol Data Unitspassive data structurebidirectional map

+77

Where this came from

wikidata · CC0 1.0

Source repository Registry entry point

Drafted structure

Bundle to layer to finding to question, as the second pass will find it: 4 bundles · 8 layers · 8 findings · 16 questions.

Type Which structure.

Type decides operations.

Kind

Array, tree, graph.

Kind

Structure type.

  1. Which data structure is it? definition
  2. Which abstract data type does it implement? definition

Operations

Supported operations.

Operations

Operations.

  1. Which operations does it support? definition
  2. At what cost? measurement
Performance Complexity.

Complexity guides choice.

Complexity

Big O.

Complexity

Complexity.

  1. What are the time and space complexities? measurement
  2. Average or worst case? definition

Practice

Benchmarks.

Practice

Real performance.

  1. How does it perform on real data? measurement
  2. What about cache behaviour? boundary
Choice Selecting a structure.

The task decides.

Fit

Use case.

Fit

Fit for task.

  1. Which structure suits this access pattern? action
  2. What are the trade-offs? boundary

Libraries

Implementations.

Libraries

Libraries.

  1. Is there a well-tested library implementation? provenance
  2. In which language? definition
Correctness Bugs.

Structures must be correct.

Invariants

Rules.

Invariants

Invariants.

  1. What invariants must the structure maintain? definition
  2. How are they tested? provenance

Concurrency

Threads.

Concurrency

Concurrency.

  1. Is it safe for concurrent use? boundary
  2. How is access synchronised? definition

What the second pass must settle

  • Should each structure be a separate entry?
  • How should complexity be recorded?
  • How should knowledge structures be split off?
Draft as JSON