StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
19933457
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-11-12T15:40:39.220
FavoriteCount
0
LastActivityDate
2013-11-12T15:47:21.567
LastEditDate
2013-11-12T15:47:21.567
LastEditorUserId
2843157
OwnerUserId
2843157
ParentId
19932388
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
I'm guessing the reason why it is faster when you are writing into a dataset of 20x2000x2000 is because there are less comparisons and increment/decrements being done. Think of it as a for loop just like the following (2000x2000x20): <pre><code>for (int i = 0; i < 2000; i++) { for (int j = 0; j < 2000; j++) { for (int k = 0; k < 20; k++) { dataset[i][j][k] = data; } } } </code></pre> Number of comparison operations: 88,004,001 Number of increment operations: 84,002,000 While in the next loop (20x2000x2000): <pre><code>for (int i = 0; i < 20; i++) { for (int j = 0; j < 2000; j++) { for (int k = 0; k < 2000; k++) { dataset[i][j][k] = data; } } } </code></pre> Number of comparison operations:80,040,020 Number of increment operations: 80,080,041 Thanks to this handy function I made because of this link <a href="http://umencs.blogspot.com/2013/04/optimization-of-nested-for-loops.html" rel="nofollow">http://umencs.blogspot.com/2013/04/optimization-of-nested-for-loops.html</a> <pre><code>void ComparisonAndIncrementCount(int nOuterLoop, int nMiddleLoop, int nInnerLoop) { int nComparisonCount = 0; int nIncrementCount = 0; for (int i = 0; (++nComparisonCount) && i < nOuterLoop; i++, ++nIncrementCount) { for (int j = 0; (++nComparisonCount) && j < nMiddleLoop; j++, ++nIncrementCount) { for (int k = 0; (++nComparisonCount) && k < nInnerLoop; k++, ++nIncrementCount) {} } } printf("\n#No. of Increment Operations of Nested For Loop: %d", nIncrementCount); printf("\n#No. of Comparison Operations of Nested For Loop: %d", nComparisonCount); } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POThree dimensional datasets
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USJohn Odom
UserOwnerUserId
1. USJohn Odom
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.