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
Retrieval by clause reference -- is it faster than retrieval by fact index Help!	2	284	May 24, 2019
Clause lookup with Reference vs term lookup w/ first argument Help!	5	347	November 25, 2019
Fast Hash Tables Resources request	10	1443	August 18, 2019
Linking from clause store to terms on the stack Discussion	48	1533	April 29, 2021
First and second argument indexing -- which should be a first argument Help!	21	1173	July 21, 2021

Access time and data structures

Related topics