, it doesn't get a
recheck argument. It is just assumed that if the consistent function sets
the recheck flag, then the distance needs to be rechecked as well. We might
want to add the recheck argument, like you Alexander did in your patch, but
it's not important right now.
I didn't get how
ORDER BY
ST_Distance(
geom,
'SRID=26918;POINT(583571.905921312 4506714.34119218)'::geometry
)
LIMIT 1;
See blog posts:
http://blog.light42.com/wordpress/?p=102
http://workshops.boundlessgeo.com/postgis-intro/knn.html
--
With best regards,
Alexander Korotkov.
On Mon, Dec 15, 2014 at 6:20 PM, Tom Lane t...@sss.pgh.pa.us wrote:
Alexander Korotkov aekorot...@gmail.com writes:
On Mon, Dec 15, 2014 at 4:12 PM, Heikki Linnakangas
hlinnakan...@vmware.com
wrote:
Right. I also looked at it briefly, but I wasn't sure if we really want
it. AFAICT
On Mon, Dec 15, 2014 at 7:47 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 12/15/2014 05:22 PM, Alexander Korotkov wrote:
On Mon, Dec 15, 2014 at 6:20 PM, Tom Lane t...@sss.pgh.pa.us wrote:
Alexander Korotkov aekorot...@gmail.com writes:
On Mon, Dec 15, 2014 at 4:12 PM, Heikki
| GUC_LIST_QUOTE
+ GUC_LIST_INPUT | GUC_LIST_QUOTE | GUC_REPORT
},
namespace_search_path,
\$user\,public,
What do you think?
Regards,
--
Alexander Kukushkin
it in following code.
if (GinPageIsCompressed(page))
freespace = GinDataLeafPageGetFreeSpace(page);
+ else if (btree-isBuild)
+ freespace = BLCKSZ * (100 - fillfactor) / 100;
--
With best regards,
Alexander Korotkov.
On Sat, Nov 22, 2014 at 2:20 AM, Peter Geoghegan p...@heroku.com wrote:
On Mon, Jan 13, 2014 at 9:17 AM, Alexander Korotkov
aekorot...@gmail.com wrote:
This patch was split from thread:
http://www.postgresql.org/message-id/CAPpHfdscOX5an71nHd8WSUH6GNOCf=V7wgDaTXdDd9=gon-...@mail.gmail.com
Hi, Heikki!
Thank you for summarizing. In general, I agree with your notes with
some exceptions.
On Mon, Nov 24, 2014 at 1:52 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 11/10/2014 10:30 PM, Alexander Korotkov wrote:
Don't allowing CREATE ACCESS METHOD command seems problematic
it work with pg_upgrade? pg_dump wouldn't dump extra pg_am records.
So, pg_upgrade would break at creating operator classes on new cluster. So,
I agree with dropping create am command only if we let pg_dump to dump
extra pg_am records...
--
With best regards,
Alexander Korotkov.
of users instead of GIN.
--
With best regards,
Alexander Korotkov.
than record lsn
Usually, xlog record is filled in critical sections when memory allocations
is prohibited. Thus, user have to previously initialize it with knowledge
of pages count, total operations count and total length of data.
--
With best regards,
Alexander Korotkov.
create-am.1
On Mon, Sep 29, 2014 at 6:16 AM, Bruce Momjian br...@momjian.us wrote:
On Fri, Sep 26, 2014 at 10:49:42AM +0400, Alexander Korotkov wrote:
Does this also fix the identical PostGIS problem or is there
something
PostGIS needs to do?
This patch provides general infrastructure
On Fri, Sep 26, 2014 at 5:18 AM, Bruce Momjian br...@momjian.us wrote:
On Sun, Sep 14, 2014 at 11:34:26PM +0400, Alexander Korotkov wrote:
Cost estimation of GiST is a big problem anyway. It doesn't care
(and
can't) about amount of recheck for regular operators. In this
patch
: replace RB-tree to heap in KNN-GiST. It's
not related to recheck stuff.
--
With best regards,
Alexander Korotkov.
.
--
With best regards,
Alexander Korotkov.
On Mon, Sep 15, 2014 at 11:45 PM, Tom Lane t...@sss.pgh.pa.us wrote:
Peter Geoghegan p...@heroku.com writes:
On Mon, Sep 15, 2014 at 8:28 AM, Alexander Korotkov
aekorot...@gmail.com wrote:
Rename such opclasses and make them not default.
Create new default opclasses with bitwise
to come with a patch for this.
Can you explain it a bit more detail? I didn't get it.
--
With best regards,
Alexander Korotkov.
no option to dump names
of default opclasses. Since we can't change behaviour of old postgres
version, we have to make pg_dump form index definition by itself.
--
With best regards,
Alexander Korotkov.
On Sun, Sep 14, 2014 at 7:39 AM, Peter Geoghegan p...@heroku.com wrote:
On Fri, Sep 12, 2014 at 2:19 PM, Alexander Korotkov
aekorot...@gmail.com wrote:
Actually, higher cardinality skip columns is better. Sorting of smaller
groups is faster than sorting larger groups of same size. Also
the cases. There could be other
planner nodes between the partial sort and LIMIT.
--
With best regards,
Alexander Korotkov.
to
declare them returns int2.
--
With best regards,
Alexander Korotkov.
tri-consistent-catalog.patch
Description: Binary data
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers
:
1. Rename such opclasses and make them not default.
2. Create new default opclasses with bitwise comparison functions.
3. Write recommendation to re-create indexes with default opclasses into
documentation.
--
With best regards,
Alexander Korotkov.
On Mon, Sep 15, 2014 at 10:51 PM, Peter Geoghegan p...@heroku.com wrote:
On Mon, Sep 15, 2014 at 8:28 AM, Alexander Korotkov
aekorot...@gmail.com wrote:
some GIN opclasses uses collation-aware comparisons while they don't
need to
do especially collation-aware comparison. Examples are text
function implementation.
--
With best regards,
Alexander Korotkov.
knn-gist-recheck-4.patch
Description: Binary data
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers
then statistics over x+y will be collected. So, in case
of expression index estimation will be fine.
--
With best regards,
Alexander Korotkov.
partial-sort-basic-2.patch
Description: Binary data
partial-sort-merge-2.patch
Description: Binary data
--
Sent via pgsql-hackers mailing list (pgsql
JsonbDeepContains does
same fast check when it deals with nested objects?
--
With best regards,
Alexander Korotkov.
.
Agree. I just tried to explain how current behaviour could look for user
who sees it for the first time.
--
With best regards,
Alexander Korotkov.
On Sun, Jul 13, 2014 at 6:45 AM, Peter Geoghegan p...@heroku.com wrote:
On Mon, Feb 10, 2014 at 10:59 AM, Alexander Korotkov
aekorot...@gmail.com wrote:
Done. Patch is splitted.
I took a quick look at this.
Have you thought about making your new cmpSortSkipCols() function not
use real
similar to b-tree.
--
With best regards,
Alexander Korotkov.
On Mon, Sep 8, 2014 at 12:08 PM, Alexander Korotkov aekorot...@gmail.com
wrote:
On Mon, Sep 8, 2014 at 11:13 AM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
On 09/07/2014 05:11 PM, Костя Кузнецов wrote:
hello.
i recode vacuum for gist index.
all tests is ok.
also i test vacuum
On Mon, Sep 8, 2014 at 12:51 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 09/08/2014 11:19 AM, Alexander Korotkov wrote:
On Mon, Sep 8, 2014 at 12:08 PM, Alexander Korotkov aekorot...@gmail.com
wrote:
On Mon, Sep 8, 2014 at 11:13 AM, Heikki Linnakangas
hlinnakan
.
--
With best regards,
Alexander Korotkov.
.
--
With best regards,
Alexander Korotkov.
knn-gist-recheck-3.patch
Description: Binary data
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers
)
dy = point-y - box-high.y;
return HYPOT(dx, dy);
I feel myself quite tangled.
Could anybody clarify it for me? Did I miss something? Thanks.
--
With best regards,
Alexander Korotkov.
then nearest point is on horizontal line of box, so distance to it is dy.
Same when dy = 0. When both of them are 0 then point is in the box.
--
With best regards,
Alexander Korotkov.
, this answers question #1, but not #2 and #3 :)
--
With best regards,
Alexander Korotkov.
with recheck. Also, I think
partial sort need a look of somebody more aware of planner than me and
Marti.
--
With best regards,
Alexander Korotkov.
On Tue, May 20, 2014 at 4:50 AM, Alexander Korotkov aekorot...@gmail.comwrote:
I found that sometimes larger maintenance_work_mem leads to larger GIN
index. That is quite strange. ISTM that it's related to posting lists
compression but I can't figure out how exactly it is.
It appears
+-+---++---++-
public | js_idx1 | index | smagen | js| 432 MB |
public | js_idx2 | index | smagen | js| 309 MB |
(2 rows)
--
With best regards,
Alexander Korotkov.
row)
Time: 63,142 ms
set work_mem = '64kB';
select count(*) from test where v 0.9;
The last query hangs. I've debugged it. It's another bug in this cursed
loop in entryGetItem. Fix is attached.
--
With best regards,
Alexander Korotkov.
gin_lossy_bitmap_fix.patch
Description: Binary data
can get dataset here:
http://mira.sai.msu.ru/~megera/tmp/js.copy.gz
--
With best regards,
Alexander Korotkov.
already) and
pins it.
--
With best regards,
Alexander Korotkov.
integer, data jsonb) returns void, search_postgres(query jsonb) returns
setof postgres. search_postgres will have semantics of @ jsonb operator
3) Background workers which provides HTTP wrapper over those functions.
--
With best regards,
Alexander Korotkov.
* from test where val between 0.1 and 0.9;
Attached patch fixes bugs in entryGetItem function.
I would especially point that continue; checks while condition even if
it's postfix while. That's why I surrounded tbm_iterate with another
while.
--
With best regards,
Alexander Korotkov
On Thu, Apr 10, 2014 at 8:22 PM, Fabrízio de Royes Mello
fabriziome...@gmail.com wrote:
On Thu, Apr 10, 2014 at 11:09 AM, Alexander Korotkov aekorot...@gmail.com
wrote:
Hi,
GIN partial match appears to be broken after fast scan. Following simple
test case raises assertion failure
understand how we ended up with the current dichotomy of json_ops
and json_hash_ops...
+1 for parameterizable opclasses
--
With best regards,
Alexander Korotkov.
of queries to be equivalent.
--
With best regards,
Alexander Korotkov.
On Wed, Apr 2, 2014 at 2:22 PM, Alexander Korotkov aekorot...@gmail.comwrote:
On Tue, Apr 1, 2014 at 2:23 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
The BIRCH algorithm as described in the paper describes building a tree
in memory. If I understood correctly, you're suggesting
On Thu, Apr 3, 2014 at 11:21 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 04/03/2014 04:15 PM, Alexander Korotkov wrote:
On Wed, Apr 2, 2014 at 2:22 PM, Alexander Korotkov aekorot...@gmail.com
wrote:
On Tue, Apr 1, 2014 at 2:23 PM, Heikki Linnakangas
hlinnakan...@vmware.com
the operator
class to specify exactly when a node is split etc.
Hmmm, it's likely I've imagined something quite outside of this paper, and
even already suggested it to Ivan... :)
I need a little time to rethink it.
--
With best regards,
Alexander Korotkov.
with euclidean,
taxicab and chebyshev distances.
What is the status of this patch?
Referring to our private conversation with Alexander Korotkov, the
patch is in WIP state currently, and, hopefully, will be ready by 9.5.
I'm ready to actively participate in its testing on a real world
production set
some logic to gin. If it sees:
1) Query contain both col const1 and col const2 restrictions.
2) There is a range type for this type and comparison operator.
3) opclass supports col @ range
then rewrite this two restrictions as col @ range(const1, const2)
--
With best regards,
Alexander
. However, alternative is heap (in-memory
structure, not table heap). I don't know why GiST doesn't use heap instead
of RB-tree.
With best regards,
Alexander Korotkov.
corresponding query
no more.
--
With best regards,
Alexander Korotkov.
.
With best regards,
Alexander Korotkov.
Josh,
Anastasia has already consulted to me in person. It is not big proposal.
But for newbie who is not familiar with PostgreSQL code base and especially
GiST it seems fair enough.
With best regards,
Alexander Korotkov.
On Tue, Mar 18, 2014 at 9:16 PM, Josh Berkus j...@agliodbs.com wrote
.
--
With best regards,
Alexander Korotkov.
queries too. We can
preserve one bit in hash as flag indicating whether it's a hash of key or
hash of path to value. For sure, such index would be a bit larger. Also,
jsonb_hash_ops can be split into two: with and without keys.
--
With best regards,
Alexander Korotkov.
On Thu, Mar 13, 2014 at 8:58 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 03/12/2014 07:52 PM, Alexander Korotkov wrote:
* I just noticed that the dummy trueTriConsistentFn returns GIN_MAYBE,
rather than GIN_TRUE. The equivalent boolean version returns 'true'
without
recheck
the query keys by
frequency, and call consistent function to split the keys intao required
and additional sets. And then model that the additional entries only
need to be fetched when the other keys match. That's doable in principle,
but requires a bunch of extra code.
Alexander, any thoughts
On Wed, Mar 12, 2014 at 8:02 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 02/26/2014 11:25 PM, Alexander Korotkov wrote:
On Thu, Feb 27, 2014 at 1:07 AM, Alexander Korotkov aekorot...@gmail.com
wrote:
On Thu, Feb 20, 2014 at 1:48 PM, Heikki Linnakangas
hlinnakan
On Tue, Mar 11, 2014 at 5:19 AM, Peter Geoghegan p...@heroku.com wrote:
On Mon, Mar 10, 2014 at 4:19 AM, Alexander Korotkov
aekorot...@gmail.com wrote:
Here it is.
So it looks like what you have here is analogous to the other problems
that I fixed with both GiST and GIN. That isn't
?
--
With best regards,
Alexander Korotkov.
On Mon, Mar 10, 2014 at 2:19 PM, Peter Geoghegan p...@heroku.com wrote:
On Mon, Mar 10, 2014 at 3:00 AM, Alexander Korotkov
aekorot...@gmail.com wrote:
I din't get comment about leftmost element. There is absolutely no
distinguish between array elements. All elements are extracted into same
On Mon, Mar 10, 2014 at 3:04 PM, Peter Geoghegan p...@heroku.com wrote:
On Mon, Mar 10, 2014 at 3:47 AM, Alexander Korotkov
aekorot...@gmail.com wrote:
Fix is attached.
Could you post a patch with regression tests, please?
Here it is.
--
With best regards,
Alexander Korotkov.
jsonb
On Mon, Feb 10, 2014 at 1:01 AM, Tom Lane t...@sss.pgh.pa.us wrote:
Alexander Korotkov aekorot...@gmail.com writes:
On Thu, Jan 16, 2014 at 3:34 AM, Tom Lane t...@sss.pgh.pa.us wrote:
I looked at this patch a bit. It seems like this:
+ *BLANK_COLOR_SIZE - How much blank character
On Thu, Feb 20, 2014 at 1:48 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 02/09/2014 12:11 PM, Alexander Korotkov wrote:
I've rebased catalog changes with last master. Patch is attached. I've
rerun my test suite with both last master ('committed') and attached
patch ('ternary
On Thu, Feb 27, 2014 at 1:07 AM, Alexander Korotkov aekorot...@gmail.comwrote:
On Thu, Feb 20, 2014 at 1:48 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
On 02/09/2014 12:11 PM, Alexander Korotkov wrote:
I've rebased catalog changes with last master. Patch is attached. I've
rerun
it
as is.
--
With best regards,
Alexander Korotkov.
On Wed, Feb 12, 2014 at 2:58 AM, Bruce Momjian br...@momjian.us wrote:
On Sun, Feb 9, 2014 at 02:17:12PM +0400, Alexander Korotkov wrote:
On Thu, Feb 6, 2014 at 8:31 PM, PostgreSQL - Hans-J rgen Sch nig
postg...@cybertec.at wrote:
i think there is one more thing which would
On Mon, Feb 10, 2014 at 2:33 PM, Marti Raudsepp ma...@juffo.org wrote:
On Sun, Feb 9, 2014 at 7:37 PM, Alexander Korotkov aekorot...@gmail.com
wrote:
This is not only place that worry me about planning overhead. See
get_cheapest_fractional_path_for_pathkeys. I had to estimate number
this year? And are there any project
ideas folk would like to suggest?
I would like to be mentor.
--
With best regards,
Alexander Korotkov.
On Fri, Feb 7, 2014 at 5:33 PM, Heikki Linnakangas
hlinnakan...@vmware.comwrote:
On 02/06/2014 01:22 PM, Alexander Korotkov wrote:
Difference is very small. For me, it looks ready for commit.
Great, committed!
Now, to review the catalog changes...
I've rebased catalog changes with last
does)
the subsequent sort will kill you.
This is not intended to be a small change. However, some solution might be
possible in post 9.4 gin improvements or in new secret indexing project
which will be presented at PGCon :-)
--
With best regards,
Alexander Korotkov.
based on costs. However, I'm not sure about design.
Because it's like a planning feature. How correct to do this inside of GIN?
--
With best regards,
Alexander Korotkov.
times because I didn't wait until first
plan execution ends up :-)
But anyway costs are extraordinary and inner sequential scan of 100
rows is odd.
--
With best regards,
Alexander Korotkov.
On Thu, Jan 16, 2014 at 3:34 AM, Tom Lane t...@sss.pgh.pa.us wrote:
Alexander Korotkov aekorot...@gmail.com writes:
Revised version of patch with necessary comments.
I looked at this patch a bit. It seems like this:
+ *BLANK_COLOR_SIZE - How much blank character is more frequent than
On Thu, Feb 6, 2014 at 2:21 PM, Heikki Linnakangas
hlinnakan...@vmware.comwrote:
On 02/05/2014 12:42 PM, Alexander Korotkov wrote:
Attached patch is light version of fast scan. It does extra consistent
function calls only on startScanKey, no extra calls during scan of the
index.
It finds
On Wed, Feb 5, 2014 at 1:23 AM, Alexander Korotkov aekorot...@gmail.comwrote:
On Mon, Feb 3, 2014 at 6:31 PM, Alexander Korotkov
aekorot...@gmail.comwrote:
On Mon, Jan 27, 2014 at 7:30 PM, Alexander Korotkov aekorot...@gmail.com
wrote:
On Mon, Jan 27, 2014 at 2:32 PM, Alexander Korotkov
On Sat, Feb 1, 2014 at 7:50 AM, Bruce Momjian br...@momjian.us wrote:
Where are we on this?
I found myself to have empty draft letter from November with new version of
patch attached. I'll return here when we have some solution in gin fast
scan challenge.
--
With best regards,
Alexander
On Mon, Feb 3, 2014 at 6:31 PM, Alexander Korotkov aekorot...@gmail.comwrote:
On Mon, Jan 27, 2014 at 7:30 PM, Alexander Korotkov
aekorot...@gmail.comwrote:
On Mon, Jan 27, 2014 at 2:32 PM, Alexander Korotkov aekorot...@gmail.com
wrote:
On Sun, Jan 26, 2014 at 8:14 PM, Heikki Linnakangas
On Mon, Jan 27, 2014 at 7:30 PM, Alexander Korotkov aekorot...@gmail.comwrote:
On Mon, Jan 27, 2014 at 2:32 PM, Alexander Korotkov
aekorot...@gmail.comwrote:
On Sun, Jan 26, 2014 at 8:14 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
On 01/26/2014 08:24 AM, Tomas Vondra wrote
consistent function algorithm will be slightly
different: only m values close to n should be checked.
I'm going to implement this heuristic against last version of your patch.
--
With best regards,
Alexander Korotkov.
On Tue, Jan 28, 2014 at 9:32 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 01/28/2014 04:12 PM, Alexander Korotkov wrote:
On Tue, Jan 28, 2014 at 5:54 PM, Heikki Linnakangas
hlinnakan...@vmware.com
wrote:
4. (as you mentioned in the other thread: ) It's a modularity
On Mon, Feb 3, 2014 at 7:24 PM, Tomas Vondra t...@fuzzy.cz wrote:
On 3 Únor 2014, 15:31, Alexander Korotkov wrote:
I found my patch 0005-Ternary-consistent-implementation.patch to be
completely wrong. It introduces ternary consistent function to opclass,
but
don't uses it, because I
, right?
Everything is absolutely correct. :-) It just may be not what do you expect
if you aren't getting into details.
--
With best regards,
Alexander Korotkov.
On Tue, Jan 28, 2014 at 5:54 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 01/13/2014 07:17 PM, Alexander Korotkov wrote:
Here goes a desription of this patch same as in original thread.
KNN-GiST provides ability to get ordered results from index, but this
order
is based only
───
627
(1 row)
Time: 3,382 ms
I'm trying to get deeper into it.
--
With best regards,
Alexander Korotkov.
to use with two-state consistent
function. However, I don't think it's a reason to refuse from three-state
consistent function because number of entries could be large.
--
With best regards,
Alexander Korotkov.
Hi!
On Tue, Jan 21, 2014 at 3:24 AM, Marti Raudsepp ma...@juffo.org wrote:
On Tue, Jan 14, 2014 at 5:49 PM, Alexander Korotkov
aekorot...@gmail.com wrote:
On Tue, Jan 14, 2014 at 12:54 AM, Marti Raudsepp ma...@juffo.org wrote:
I've been trying it out in a few situations. I implemented a new
On Tue, Jan 28, 2014 at 7:41 AM, Marti Raudsepp ma...@juffo.org wrote:
On Mon, Jan 27, 2014 at 9:26 PM, Alexander Korotkov
aekorot...@gmail.com wrote:
For now, I have attempt to fix extra columns in mergejoin problem. It
would
be nice if you test it.
Yes, it solves the test cases I
On Thu, Jan 23, 2014 at 9:27 AM, Alexander Korotkov aekorot...@gmail.comwrote:
On Wed, Jan 22, 2014 at 9:28 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
On 01/22/2014 02:17 PM, Alexander Korotkov wrote:
We already spent a lot of time with compression. Now we need to figure
out
On Fri, Jan 24, 2014 at 12:50 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
On 01/24/2014 10:03 AM, Alexander Korotkov wrote:
ITSM I found this bug. ginVacuumPostingTreeLeaf re-encodes only some
segments. Others are not even re-palloced. They are moved left
On Fri, Jan 24, 2014 at 1:19 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 01/24/2014 10:53 AM, Alexander Korotkov wrote:
OK. What about previous fix in assert?
Ah right, fixed that too now.
Good, now my test-suite passed. Results are so.
Time of operations
event
On Thu, Jan 23, 2014 at 8:22 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 01/14/2014 05:35 PM, Alexander Korotkov wrote:
Attached version is rebased against last version of packed posting lists.
Thanks!
I think we're missing a trick with multi-key queries. We know that when
.
--
With best regards,
Alexander Korotkov.
On Wed, Jan 22, 2014 at 12:30 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
On 01/22/2014 09:25 AM, Alexander Korotkov wrote:
On Wed, Jan 22, 2014 at 1:21 AM, Heikki Linnakangas
hlinnakan...@vmware.com
wrote:
On 01/21/2014 11:35 AM, Heikki Linnakangas wrote:
Oh, I see
On Wed, Jan 22, 2014 at 9:28 PM, Heikki Linnakangas hlinnakan...@vmware.com
wrote:
On 01/22/2014 02:17 PM, Alexander Korotkov wrote:
We already spent a lot of time with compression. Now we need to figure out
the result we want see. I spent quite long time debugging varbyte encoding
without
On Mon, Jan 20, 2014 at 10:30 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
On 01/17/2014 08:49 PM, Alexander Korotkov wrote:
On Fri, Jan 17, 2014 at 10:38 PM, Heikki Linnakangas
hlinnakan...@vmware.com wrote:
On 01/17/2014 01:05 PM, Alexander Korotkov wrote:
Seems to be fixed
On Tue, Jan 21, 2014 at 4:28 PM, Alexander Korotkov aekorot...@gmail.comwrote:
I noticed that the gin vacuum redo routine is dead code, except for the
data-leaf page handling, because we never remove entries or internal nodes
(page deletion is a separate wal record type). And the data-leaf
501 - 600 of 1172 matches
Mail list logo
