Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
chanks
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
1.
▲
by
chanks
3y ago
You can, but that won't protect you against invalid dates like an actual date type will.
2.
▲
by
chanks
4y ago
I'm very curious how well this is working for you in practice, since I've been thinking about what it would look like to share a single Rust UI implementation across a webapp and native apps.
3.
▲
by
chanks
8y ago
And Roda ( https://github.com/jeremyevans/roda ) beats Gin, if you include it: https://www.techempower.com/benchmarks/#section=data-r15&hw=...
4.
▲
Tech Startup Fires Engineers Amid Union Organizing Effort
(bna.com)
9 points
by
chanks
9y ago
|
0 comments
5.
▲
by
chanks
9y ago
If you have a table that undergoes frequent updates and this is a concern of yours, look into setting a fillfactor on it. This will help Postgres keep writes in the same page, which means it doesn't need to touch indexes for non-indexe
6.
▲
by
chanks
10y ago
Looking at your PR for it ( https://github.com/LuaJIT/LuaJIT/pull/149 ) it sounds as if there are a few issues remaining, but I'm not enough of an expert to know how problematic they are in practice. Do yo
7.
▲
by
chanks
10y ago
A small tree-based router for Ruby apps. https://github.com/jeremyevans/roda
8.
▲
by
chanks
11y ago
That is, indeed, what Sequel does. You can query the database object directly (for example, `DB[:posts].where{comments_count > 5}.exclude(poster_name: "Bob").order(:comments_count.desc).limit(10).all`) and get back an array of
9.
▲
by
chanks
11y ago
Thank you!
10.
▲
by
chanks
11y ago
(I'm the author of Que, the job queue discussed in the post most extensively) This isn't terribly surprising to me, since I have an appreciation for what long-running transactions will do to a system, and I try to design systems t
11.
▲
by
chanks
12y ago
My point is that the only way to wrap your jobs in the same transactions as the rest of your data is to have your job queue in your RDBMS. If you don't have that, you can't guarantee that they are consistent, that your backups hav
12.
▲
by
chanks
12y ago
It can only be consistent with the rest of your data if the rest of your data is also in Redis.
13.
▲
by
chanks
12y ago
The major benefit of putting your queue in your RDBMS, which isn't commonly brought up in these discussions, is that it lets you protect your jobs with the same ACID guarantees as the rest of your data. This is very valuable for some u
14.
▲
by
chanks
12y ago
Hi, I'm the author of Que. It's true that you can't really completely solve the idempotence problem for jobs that write to external web services (unless those web services provide ways for you to check whether you've alr
15.
▲
by
chanks
12y ago
Frontline has an excellent episode on the Norfolk Four, a similar case that happened in Virginia: http://www.pbs.org/wgbh/pages/frontline/the-confessions/
16.
▲
by
chanks
13y ago
You have some valid criticisms of the implementation, though pgsql-hackers has their reasons ( http://www.postgresql.org/message-id/CAHyXU0ybwZZUbuQQVFQMK3... ) for the way things are. Regardless, my point is that the si
17.
▲
by
chanks
13y ago
PL/pgSQL function plans are cached. Functions written in other languages may not be, I don't know, but in my experience PL/pgSQL is the most widely used. http://www.postgresql.org/docs/9.3/static
18.
▲
Show HN: Que, a crazy-fast Ruby-PostgreSQL job queue
(github.com)
2 points
by
chanks
13y ago
|
0 comments
19.
▲
Show HN: Que, a Ruby-PostgreSQL job queue with ~20x the throughput of DelayedJob
6 points
by
chanks
13y ago
|
0 comments
20.
▲
Turning PostgreSQL into a queue serving 10,000 jobs per second
(gist.github.com)
5 points
by
chanks
13y ago
|
0 comments
21.
▲
by
chanks
13y ago
I'm really interested in suggestions or comments about Que - I'm trying to make it as durable as possible while retaining its speed. I'm also looking for a steady job using Ruby, if anyone is hiring in Seattle. My email'
22.
▲
Que: A fast, concurrent job queue for Ruby and PostgreSQL
(github.com)
3 points
by
chanks
13y ago
|
2 comments
23.
▲
U.S. intelligence agencies have their own Twitter. It’s called eChirp
(washingtonpost.com)
2 points
by
chanks
13y ago
|
0 comments
24.
▲
by
chanks
13y ago
What I would find helpful is some sort of operator to merge two JSON values. I use a JSON field to collect various statistics relating to a table's rows, and it'd be nice to not have to worry about overwriting old values. Something like: js
25.
▲
Extra security measures for next week's releases
(postgresql.org)
197 points
by
chanks
13y ago
|
41 comments
26.
▲
PostgreSQL 9.3: Current Feature Status
(databasesoup.com)
9 points
by
chanks
14y ago
|
0 comments
27.
▲
How Zappos' User Agreement Failed In Court and Left Zappos Legally Naked
(forbes.com)
11 points
by
chanks
14y ago
|
3 comments
28.
▲
by
chanks
14y ago
One thing people don't mention that often with Postgres, but is worth some attention, is the Heap-Only Tuples (HOT) optimization that was added in 8.3. During an UPDATE, Postgres will try to fit the new version of the row on the same page a
29.
▲
by
chanks
14y ago
I strongly recommend Sequel for Ruby: http://sequel.rubyforge.org It provides an ActiveModel-compliant interface, so it works fine with Rails. It also has a lot less magic (associations don't use proxy objects, for example) and has a lot
30.
▲
by
chanks
14y ago
That's nice to hear, I guess. I play with a lot of this stuff and still feel intermediate.
More ›