Page History

...

Data Structure Approaches

colourRedtitleno colourRedtitleno colourRednocolourRedno

		In-memory Processing
Triple Store Data Structure	In-memory Data Structure	Direct access at loaded position	Direct access URI as ID	Iteration foward	Iteration backward	Append after last loaded	Append after global last	Insert after proxyloaded item	Insert before loaded proxyitem	Insert after loaded position	Insert before loaded position	Delete loaded proxyitem	Delete from loaded position	Fetch one by global position	Fetch one by URI	Fetch range	Fetch next range	Persist one at global position	Persist one by URI	Persist range	Issues	ORE Compliance	Comments
singly linked list
	singly linked liststatus	NO	NO	FAST	NO	SLOW	SLOW	FAST	SLOW	NO	NO	SLOW	NO	NO	FAST	SLOW	SLOW	NO	FAST	SLOW
		convert to array on fetch																	FAST	NO	FAST	FAST	FAST	SLOW	FAST	FAST	FAST	FAST	FAST	FAST	NO	FAST	SLOW	SLOW	NO	FAST	SLOW
	convert to hash (key=proxy URI key) on fetchstatus	NO	FAST	FAST	NO	FAST	SLOW	FAST	FAST	NO	NO	FAST	NO	NO	FAST	SLOW	SLOW	NO	FAST		SLOW
	header info + singly linked list
	header info + convert to array on fetch
	header info + convert to hash (URI key) on fetch
singly linked list + order index
	singly linked liststatus	NO			title
	convert to array on fetch
	convert to hash (URI key) on fetchstatus				title
	header info + singly linked list
	header info + convert to array on fetch
	header info + convert to hash (URI key) on fetch
doubly linked list
	doubly linked list
	convert to array on fetch
	convert to hash (URI key) on fetch
	header info + singly linked list
	header info + convert to array on fetch
	header info + convert to hash (URI key) on fetch
doubly linked list + order index
	doubly linked list
	convert to array on fetch
	convert to hash (URI key) on fetch
	header info + singly linked list
	header info + convert to array on fetch
	header info + convert to hash (URI key) on fetch

List Header Info

Lists with headers will hold the following information.

		example value types
key	description of value	singly linked	singly linked + order	doubly linked	doubly linked + order	array	hash
first	pointer to first item in list	URI of first proxy	URI of first proxy	URI of first proxy	URI of first proxy	URI of first proxy	URI of first proxy
last	pointer to last item in list	X	X	URI of last proxy	URI of last proxy	URI of last proxy	URI of last proxy
count	count of all items in list	X	X	X	X	X	X
first_loaded	pointer to first item in loaded range of items	item	item	item	item	array[0]	URI of proxy
last_loaded	pointer to last item in loaded range of items	X	X	item	item	array[size of array]	URI of proxy
count_loaded	count of items in currently loaded range	X	X	X	=position of last - position of first	size of array	size of hash
resume_token	pointer to item after last_loaded	URI of proxy	URI of proxy	URI of proxy	URI of proxy	URI of proxy	URI of proxy
loaded_items	pointer to loaded items	use first_loaded	use first_loaded	use first_loaded	use first_loaded	array	hash

...

		example value types
key	description of value	singly linked	singly linked + order	doubly linked	doubly linked + order	array	hash	Comments
uri	URI of proxy for this item	URI of this proxy	URI of this proxy	URI of this proxy	URI of this proxy	URI of this proxy	URI of this proxy	This is the hash key for loaded_items when the list is implemented as a hash.
prev	pointer to previous item in list	X	X	URI of prev proxy	URI of prev proxy	= p - 1	URI of prev proxy
next	pointer to next item in list	URI of next proxy	URI of next proxy	URI of next proxy	URI of next proxy	= p + 1	URI of next proxy
prev_loaded	pointer to previous item in loaded range of items	X	X	prev item	prev item	= pl - 1	URI of prev proxy
next_loaded	pointer to next item in loaded range of items	next item	next item	next item	next item	= pl + 1	URI of next proxy
proxyFor	URI of list item being aggregated	URI	URI	URI	URI	URI	URI
proxyIn	URI of list aggregation	URI of aggregation	URI of aggregation	URI of aggregation	URI of aggregation	URI of aggregation	URI of aggregation
proxyIn_loaded	pointer to List Header	header	header	header	header	header	header
position (p)	position in full list	X	p	X	p	p	X
position_loaded (pl)	position in loaded range of items	X	pl	X	pl	pl	X

...

Page tree

Versions Compared

Old Version 4

New Version 5

Key

Data Structure Approaches

List Header Info