StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
10472705
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-05-06T17:37:07.803
FavoriteCount
0
LastActivityDate
2012-05-07T23:12:45.887
LastEditDate
2012-05-07T23:12:45.887
LastEditorUserId
46190
OwnerUserId
83805
ParentId
10471290
PostTypeId
2
Score
4
ViewCount
0
LastEditorDisplayName
text
Body
You'll need to measure the operations to really quantify how inefficient any given implementation of the queue operations are. That said, there are alternative data structures for different queue scenarios. Particularly if you're interested in either persistent or pure queues, or concurrent queues, then you have a few options. Pure data structures <ul> <li>finger tree-based queues: <a href="http://hackage.haskell.org/package/fingertree-psqueue" rel="nofollow">http://hackage.haskell.org/package/fingertree-psqueue</a></li> <li>pure priority queues: <a href="http://hackage.haskell.org/package/pure-priority-queue" rel="nofollow">http://hackage.haskell.org/package/pure-priority-queue</a></li> <li>asymptotically optimal, provably correct queues, <a href="http://hackage.haskell.org/package/meldable-heap" rel="nofollow">http://hackage.haskell.org/package/meldable-heap</a></li> <li>queues based on binomial heaps, <a href="http://hackage.haskell.org/package/pqueue" rel="nofollow">http://hackage.haskell.org/package/pqueue</a></li> </ul> Concurrent queues <ul> <li>STM-based queues, <a href="http://hackage.haskell.org/package/bounded-tchan" rel="nofollow">http://hackage.haskell.org/package/bounded-tchan</a></li> <li>STM-based bounded queues, <a href="http://hackage.haskell.org/package/rolling-queue" rel="nofollow">http://hackage.haskell.org/package/rolling-queue</a></li> </ul> Publish subscribe If you're looking at a publish/subscribe mechanism, perhaps consider a binding to zeromq: <ul> <li><a href="http://www.zeromq.org/" rel="nofollow">http://www.zeromq.org/</a></li> </ul> it definitely is aimed at high freq operations, and even has backs the FP community, <a href="http://www.zeromq.org/bindings:haskell" rel="nofollow">http://www.zeromq.org/bindings:haskell</a> There are two different OCaml bindings to ZeroMQ: <a href="http://www.zeromq.org/bindings:ocaml" rel="nofollow">http://www.zeromq.org/bindings:ocaml</a>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow can I build a faster implementation of Queue?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USaneccodeal
UserOwnerUserId
1. USDon Stewart
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
 VTDownMod
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.