StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
1765616
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2009-11-19T18:42:53.233
FavoriteCount
0
LastActivityDate
2016-11-26T21:55:52.013
LastEditDate
2016-11-26T21:55:52.013
LastEditorUserId
59087
OwnerUserId
77507
ParentId
1765579
PostTypeId
2
Score
25
ViewCount
0
LastEditorDisplayName
text
Body
Read up on the <a href="http://en.wikipedia.org/wiki/Aho-Corasick_algorithm" rel="nofollow noreferrer">Aho-Corasick algorithm</a> and the <a href="https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm" rel="nofollow noreferrer">Rabin-Karp algorithm</a>. If the input is not too large, you don't want to repeat the search many times and you do not have many patterns, it might be a good idea to use a single pattern algorithm several times. The <a href="http://en.wikipedia.org/wiki/String_searching_algorithm" rel="nofollow noreferrer">Wikipedia article on search algorithms</a> gives many algorithms with running and preprocessing times. Implementations: <ul> <li><a href="https://hkn.eecs.berkeley.edu/~dyoo/java/index.html" rel="nofollow noreferrer">https://hkn.eecs.berkeley.edu/~dyoo/java/index.html</a></li> <li><a href="http://algs4.cs.princeton.edu/53substring/RabinKarp.java.html" rel="nofollow noreferrer">http://algs4.cs.princeton.edu/53substring/RabinKarp.java.html</a></li> <li><a href="https://github.com/hankcs/AhoCorasickDoubleArrayTrie" rel="nofollow noreferrer">https://github.com/hankcs/AhoCorasickDoubleArrayTrie</a></li> <li><a href="https://github.com/RokLenarcic/AhoCorasick" rel="nofollow noreferrer">https://github.com/RokLenarcic/AhoCorasick</a></li> <li><a href="https://github.com/robert-bor/aho-corasick" rel="nofollow noreferrer">https://github.com/robert-bor/aho-corasick</a></li> </ul> Presentations: <ul> <li><a href="http://www.slideshare.net/taka111/ahocorasick-string-matching-algorithm-15078438" rel="nofollow noreferrer">http://www.slideshare.net/taka111/ahocorasick-string-matching-algorithm-15078438</a></li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POFast algorithm for searching for substrings in a string
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USDave Jarvis
UserOwnerUserId
1. USDaniel Brückner
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POFast algorithm for searching for substrings in a string
 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
 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.