StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
350168
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2008-12-08T17:01:26.507
FavoriteCount
0
LastActivityDate
2008-12-08T17:01:26.507
LastEditDate
LastEditorUserId
0
OwnerUserId
44330
ParentId
234560
PostTypeId
2
Score
12
ViewCount
0
LastEditorDisplayName
text
Body
My understanding is that they're not so much a useful alternative to binary trees (e.g. red-black trees) as they are to B-trees for database use, so that you can keep the # of levels down to a feasible minimum and deal w/ base-K logs rather than base-2 logs for performance characteristics. The algorithms for probabilistic skip-lists are (IMHO) easier to get right than the corresponding B-tree algorithms. Plus there's some literature on lock-free skip lists. I looked at using them a few months ago but then abandoned the effort on discovering the <a href="http://en.wikipedia.org/wiki/Hierarchical_Data_Format" rel="noreferrer">HDF5</a> library. literature on the subject: Papers by Bill Pugh: <ul> <li><a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.524" rel="noreferrer">A skip list cookbook</a></li> <li><a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.9380" rel="noreferrer">Skip lists: A probabilistic alternative to balanced trees</a></li> <li><a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.8201" rel="noreferrer"> Concurrent Maintenance of Skip Lists </a></li> </ul> non-academic papers/tutorials: <ul> <li><a href="http://www.eternallyconfuzzled.com/tuts/datastructures/jsw_tut_skip.aspx" rel="noreferrer">Eternally Confuzzled</a> (has some discussion on several data structures)</li> <li><a href="http://www.csee.umbc.edu/courses/undergraduate/341/fall01/Lectures/SkipLists/skip_lists/skip_lists.html" rel="noreferrer">"Skip Lists"</a> by Thomas A. Anastasio</li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POSkip Lists -- ever used them?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USJason S
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
3. 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.