websss
asked on
Dictionary and array of [N] size - performance tuned
Hi All
I have a temperature reading device.
I require to store the last N records of its temperature reading in an object
it will either be 5, 10 or 20 records
I was thinking of a dictionary with ID and array:
it should look like this:
ID, array of [N] records
i.e. in this example, there are 2 ID's and I store the last 5 temperature values
My first question is about the array ordering
Can i define the size of the array, and push to it so it always inserts the latest temperature at top, and discards the oldest record at bottom, always keeping the correct size and order? (if not what other object should i use)
second question, is there a better way to do this, maybe using a different object??
I will be reading and updating it once a second so it needs to be FAST as there could be a million ID's each with 5-20 temperature readings
I have a temperature reading device.
I require to store the last N records of its temperature reading in an object
it will either be 5, 10 or 20 records
I was thinking of a dictionary with ID and array:
it should look like this:
ID, array of [N] records
i.e. in this example, there are 2 ID's and I store the last 5 temperature values
12345, 10.01
10.02
11.05
11.02
11.20
42133, 11.01
12.02
12.05
12.02
12.20
My first question is about the array ordering
Can i define the size of the array, and push to it so it always inserts the latest temperature at top, and discards the oldest record at bottom, always keeping the correct size and order? (if not what other object should i use)
second question, is there a better way to do this, maybe using a different object??
I will be reading and updating it once a second so it needs to be FAST as there could be a million ID's each with 5-20 temperature readings
I'd use a circular rotating array. This is about as fast as possible for the described application.
Circular rotating arrays are most efficiently implemented in sizes that are a power of 2.
Consider an empty array of 6 slots. Initialize head pointer at 0.
Now add a data item to the array at the head pointer. Bump the head pointer forward.
Keep adding data until the array is full.
When the head pointer overflows, reset it to zero. Adding the next item destroys the old data in slot zero.
If it is necessary to know how much data is in the array, also keep a tail pointer. The array can be implemented without a tail pointer if it fills quickly and there is no need to know whether the array is full.
Circular rotating arrays are normally implemented in sizes that are exponents of 2 is because end-of-array pointer checking can be done as an AND with a bitmask, not a conditional.
Circular rotating arrays are most efficiently implemented in sizes that are a power of 2.
Consider an empty array of 6 slots. Initialize head pointer at 0.
0,0,0,0,0 <- head pointer
0,0,0,0,0
0,0,0,0,0
0,0,0,0,0
0,0,0,0,0
0,0,0,0,0
Now add a data item to the array at the head pointer. Bump the head pointer forward.
2,35,387,0,6
0,0,0,0,0 <- head pointer
0,0,0,0,0
0,0,0,0,0
0,0,0,0,0
0,0,0,0,0
Keep adding data until the array is full.
2,35,387,0,6
6,0,80,9,5
2,2,0,3,0
6,0,3,0,13
7,0,40,0,6
93,0,1,6,12
<- head pointer
When the head pointer overflows, reset it to zero. Adding the next item destroys the old data in slot zero.
4,65,1,4,-3
6,0,80,9,5 <- head pointer
2,2,0,3,0
6,0,3,0,13
7,0,40,0,6
93,0,1,6,12
If it is necessary to know how much data is in the array, also keep a tail pointer. The array can be implemented without a tail pointer if it fills quickly and there is no need to know whether the array is full.
Circular rotating arrays are normally implemented in sizes that are exponents of 2 is because end-of-array pointer checking can be done as an AND with a bitmask, not a conditional.
ASKER
Hi Nitin
When we get the data, we first need to persist into an in memory object, and then save to DB
I hope that clarifies ?
Are you saying that this not yet persisted anywhere in db? And you will persist this in db later and you want an intermediate data structure?Yes its also persisted in DB, but we are caching in memory object for performance issues... this is a design decision which is not up for discussion, and has to be in memory
Or, this is already persisted and while fetching you want this structure?We get the value first, then we persist in DB
When we get the data, we first need to persist into an in memory object, and then save to DB
At what level 5, 10 or 20 is decided?UI level, it will be different for each device, and this is already taken care of
I am confused if you want a FIFO or FILO implementation. In either case both are implemented already as Queue class and Stack class.FILO, the function behind this data storage is to take the last N values and output an AVERAGE value of the last N data.
I hope that clarifies ?
ASKER
Hi Dr
is this available in a .Net object?
I'd use a circular rotating array. This is about as fast as possible for the described application.
is this available in a .Net object?
Sorry, I have no idea. (I'm not a Windows programmer.)
You may wish to have a look at Stack<T> class then. Have a custom class having one property for Id and another as Stack for temperatures.
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER
thanks, this is more inline with my thinking
whats the performance of a QUEUE like? i've never used before.
And using the deQueue, and add are efficient?
whats the performance of a QUEUE like? i've never used before.
And using the deQueue, and add are efficient?
Define "performance". What part of this needs to be fast? The read? The write? All of it?
The Queue collection uses a circular array internally and seeming the number of elements being used is small and arrays have direct access performance should not be an issue.
ASKER
awesome!
Glad to help websss. Have a great day.
Or, this is already persisted and while fetching you want this structure?
At what level 5, 10 or 20 is decided?
Arrays will (to my knowledge) not provide a behavior you are expecting inherently. You will need to write one....complicated.
I am confused if you want a FIFO or FILO implementation. In either case both are implemented already as Queue class and Stack class.