What are the types of data structure and the access time in the best / average / worst cases? In a list is pretty simple, I need to run through all items until I find the specific one I wanted. What happens with facts? How do they store? Assume I have N facts: color(red). color(blue). . . . …

You should measure it for your use case I guess. There is quite a bit on the topic of how clauses are indexed here: https://www.swi-prolog.org/pldoc/man?section=jitindex

Access time and data structures

Help! Data Structure

EricGT August 31, 2020, 3:07pm 3

See:
Database micro-benchmark
Obtaining Runtime Statistics

1 Like

Topic		Replies	Views
Clause lookup with Reference vs term lookup w/ first argument Help!	5	346	November 25, 2019
Retrieval by clause reference -- is it faster than retrieval by fact index Help!	2	278	May 24, 2019
Insight -- meta programming Help!	3	482	March 6, 2019
Improving performance for fact lookup of graph data; through a simple extension Request For Comments	3	430	January 29, 2020
Database micro-benchmark (Discussion) Discussion	22	838	April 25, 2020

Access time and data structures

Related topics