, but it was inactive. Therefore, I decided to start a new one.
[1] - http://pgfoundry.org/projects/optimizer/
Anyway, good work for all of you.
--
Adriano Lange
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http
this kind of algorithm, as stars, cliques,
chains and cycles. Beyond these queries I have no idea how can I further
test it.
Regards,
Adriano Lange
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref
On Fri, Jul 30, 2010 at 7:02 AM, Jan Urbański wulc...@wulczer.org wrote:
On 24/07/10 15:20, Adriano Lange wrote:
Hi,
Hi!
I'd like to release the last version of my experimental join order
algorithm (TwoPO - Two Phase Optimization [1]):
http://git.c3sl.ufpr.br/gitweb?p=lbd/ljqo.git
Em 25-07-2010 17:44, Robert Haas escreveu:
On Sat, Jul 24, 2010 at 9:20 AM, Adriano Lange alange0...@gmail.com wrote:
I'd like to release the last version of my experimental join order
algorithm (TwoPO - Two Phase Optimization [1]):
http://git.c3sl.ufpr.br/gitweb?p=lbd/ljqo.git;a=summary
Em 25-07-2010 19:17, Robert Haas escreveu:
On Sun, Jul 25, 2010 at 6:45 PM, Adriano Lange alange0...@gmail.com wrote:
Yes, I know. This is only a notice, not a patch.
As I said, this algorithm is experimental, which do not match with the
CommitFest life cycle.
It matches just fine - you
Engineering and Applications Symposium, pages
296-302, Washington, DC, USA, 2007. IEEE Computer Society.
[4] Florian Waas e Arjan Pellenkoft. Join order selection - good enough
is easy. BNCOD, pages 51-67, 2000.
Att,
Adriano Lange
--
Sent via pgsql-hackers mailing list (pgsql-hackers
?doid=1559845.1559889
Att
Adriano Lange
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers
Tom Lane escreveu:
Adriano Lange alange0...@gmail.com writes:
I need to control the size of a memory context on the fly and take
some actions when
the used memory exceeds a defined size.
The existing places that do that sort of thing do their own counting
of how much they've allocated.
I
On Fri, Aug 28, 2009 at 5:18 AM, Greg Smithgsm...@gregsmith.com wrote:
On Fri, 28 Aug 2009, Tom Lane wrote:
MemoryContextStats() might help. It just dumps the info to stderr
though.
Which means it ends up in the database log files in the common configuration
where where the database's
Hi,
How can I get the used memory of a memory context?
Is there some function like:
int getMemoryUsage( MemoryContext )
?
I still working in a subplan cache for a query optimizer and I need to know
whether a temporary memory context is in certain limits.
Thanks
Adriano
--
Sent via
Hi
Tobias Zahn escreveu:
Hello Adriano,
thank you very much for posting your patch. I think it will help to make
further work easier, too. I hope you don't mind when I ask you some
questions.
When you said that this new approach is worse or equal than GEQO, did
you refer to performance or to
reading more
about the compressed annealing, cited in TODO list. Anyway, I think that
to build another annealing-like algorithm might be easier if some
structures and functions in 2PO source code are correct.
Sincerely,
Adriano Lange
--
Sent via pgsql-hackers mailing list (pgsql-hackers
Adriano Lange escreveu:
I implemented the 2PO algorithm last month but I didn't have much time
to do an extensive test and to comment all code. The code was posted in
this list in a previous thread. In that occasion, I was interested in a
kind of cache structure to avoid the constructing
this lack of optimization. I
remember that the geqo used a memory context switch for each plan
evaluation.
The source code of 2PO (twopo) is attached for any test.
(Sorry by any (many) grammatical mistake)
---
Adriano Lange
/*
* twopo.c
*Two Phase Optimization
*
* Portions Copyright (c
and navigability in the
graph. I think that a good solution for this would be a dynamic
navigability in their nodes and a rearrange their positions by focused
node. I'm not remembering now, but I've saw a tool like this.
Thanks
--
Adriano Lange
C3SL/UFPR - www.c3sl.ufpr.br
--
Sent via pgsql-hackers
Tom Lane escreveu:
Gregory Stark st...@enterprisedb.com writes:
Adriano Lange adri...@c3sl.ufpr.br writes:
I've changed the debug functions of allpaths.c to make a graphviz-like output
of RelOptInfo structure.
However I have to say this graph you've generated is amazingly hard to
decipher
the pathkeys.
Several attributes and objects are missing yet, but I will add them.
Thanks,
Adriano Lange
C3SL/UFPR - www.c3sl.ufpr.br
RelOptInfo_graph.dot
Description: application/crossover-dot
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your
Hi all,
I'm looking for materials explaining GEQO module. I've found
something related in
http://www.mail-archive.com/pgsql-hackers@postgresql.org/msg40584.html
and PostgreSQL's documentation.
Nevertheless, is there some other cientific publication about it?
I've tried also send email to
18 matches
Mail list logo
