StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
8130363
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-11-15T01:14:42.950
FavoriteCount
0
LastActivityDate
2011-11-15T01:14:42.950
LastEditDate
LastEditorUserId
0
OwnerUserId
377270
ParentId
8130235
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
I believe you've chosen the incorrect data structure for your hash tables: <pre><code>typedef struct hashTable { char key[MAX_NAME]; int index; struct hashTable *next; struct hashTable *prev; }; </code></pre> One of the primary benefits of a hash table is being able to jump directly to the bucket that contains the element you're searching for. This is part of a linked list of hash buckets -- which means you must iterate through an average of 4098/2 buckets on every lookup or insertion. That will not provide you with the performance you need. Your hash table should instead be an array of <code>structs</code>; each <code>struct</code> should have a pointer to a string (or direct storage for short strings) and a pointer to the next <code>struct</code> in the bucket. (While this <code>struct hashTable</code> could also be the in-bucket structure, it is a rare hash table that needs <code>next</code> and <code>prev</code> links within the buckets. Which is why I guessed this data structure is instead intended for the table itself.) You also need to select a good <a href="http://en.wikipedia.org/wiki/Hash_function" rel="nofollow">hash function</a>. There is a ton of research into good hash functions, but you're really looking for something better than horrible for a homework assignment. The input to the hash function is your strings, and the output should be an integer. You'll need to <code>%</code> the output with the size of your array (pick a prime near 5000) to figure out which bucket to use. Here's a hash function from the <a href="http://nothings.org/stb/stb_h.html" rel="nofollow"><code>stb.h</code> library of convenient functions</a>: <pre><code>unsigned int stb_hash(char *str) { unsigned int hash = 0; while (*str) hash = (hash << 7) + (hash >> 25) + *str++; return hash + (hash >> 16); } </code></pre> A short hint that while the <code>stb.h</code> code is in the public domain, it would be very wise to reference the source in the program -- professors, lawyers, and in the future, your co-workers, will thank you for including the source of things you didn't do yourself.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POC bucket of strings
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USsarnold
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. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
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.