StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
14277416
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-01-11T11:39:01.803
FavoriteCount
0
LastActivityDate
2013-01-11T11:52:26.600
LastEditDate
2013-01-11T11:52:26.600
LastEditorUserId
1009831
OwnerUserId
1009831
ParentId
14274154
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
There is only one difference between implicit suffix tree and explicit suffix tree: it does not contain end-of-string markers (and does not contain any branches corresponding to these end-of-string markers). This means there is no difference where to search for a substring - in implicit suffix tree or in explicit suffix tree. Since implicit suffix tree contains less unnecessary branches, this guarantees even more efficient (but still linear-time) algorithm for substring search. So requirement #1 is satisfied automatically: just search suffix tree from the root and choose branches that match given word. As for requirement #2, I think, you cannot satisfy it with the same implicit suffix tree. Because you need end-of-string markers to work with suffixes. But you could do it in <code>O(|U|)</code> time with separate (explicit) suffix tree for given word <code>U</code>. The trick is to reverse this word prior to constructing its suffix tree. To find the longest suffix of <code>S</code> that is also a prefix of <code>U</code>, use this separate suffix tree to find the longest prefix of the reversed string <code>S</code> that is also a suffix of the reversed string <code>U</code>. Just search this suffix tree from the root, choose branches that match the reversed string <code>S</code>, and remember the latest node with end-of-string marker. Then reverse the string on the path from root to this node (or determine length of this path and copy substring of the same length from the tail of <code>S</code>).
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POSearch in implicit suffix tree constructed by Ukkonen algorithm
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USEvgeny Kluev
UserOwnerUserId
1. USEvgeny Kluev
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POSearch in implicit suffix tree constructed by Ukkonen algorithm
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
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.