2016-09-14 7:23 GMT-03:00 Oleg Ivanov :
>
>
> I hope listed papers will be useful for your master's thesis.
>
>
I'm sure they will!
Thank you, Oleg.
Hi Vinicius,
I recommend you to read this
(http://www.doc.ic.ac.uk/~nb605/IO%20performance%20modeling%20research/Learning-based%20Query%20Performance%20-%202011.pdf)
paper. Authors make a nice classification of different query performance
prediction methods and propose their own solution for t
2016-09-13 17:12 GMT-03:00 Oleg Bartunov :
>
>
> FYI, please check https://pgconf.ru/2016/89977
>
>
Interesting! Was this presentation filmed? Or would you have a post or
something else with more details?
On Tue, Sep 13, 2016 at 2:54 PM, Istvan Soos wrote:
> On Tue, Sep 13, 2016 at 2:06 AM, Vinicius Segalin
> wrote:
>> 2016-09-12 18:22 GMT-03:00 Istvan Soos :
>>> At Heap we have non-trivial complexity in our analytical queries, and
>>> some of them can take a long time to complete. We did analyze
On Tue, Sep 13, 2016 at 2:06 AM, Vinicius Segalin wrote:
> 2016-09-12 18:22 GMT-03:00 Istvan Soos :
>> At Heap we have non-trivial complexity in our analytical queries, and
>> some of them can take a long time to complete. We did analyze features
>> like the query planner's output, our query prope
I’ve been looking for this on postgres too. Does Postgres have something
similar to Oracle’s v$session_longops? It gives info on total unit of work,
units done so far, last update time, and time remaining etc, and I found it
valuable in providing an estimate to how long a certain query would ke
2016-09-12 18:22 GMT-03:00 Istvan Soos :
> Hi Vinicius,
>
> At Heap we have non-trivial complexity in our analytical queries, and
> some of them can take a long time to complete. We did analyze features
> like the query planner's output, our query properties (type,
> parameters, complexity) and tr
2016-09-12 17:01 GMT-03:00 Jeff Janes :
> On Mon, Sep 12, 2016 at 7:03 AM, Vinicius Segalin
> wrote:
>
>> Hi everyone,
>>
>> I'm trying to find a way to predict query runtime (I don't need to be
>> extremely precise). I've been reading some papers about it, and people are
>> using machine learnin
2016-09-12 15:16 GMT-03:00 Merlin Moncure :
> On Mon, Sep 12, 2016 at 9:03 AM, Vinicius Segalin
> wrote:
> > Hi everyone,
> >
> > I'm trying to find a way to predict query runtime (I don't need to be
> > extremely precise). I've been reading some papers about it, and people
> are
> > using machin
Hi Vinicius,
At Heap we have non-trivial complexity in our analytical queries, and
some of them can take a long time to complete. We did analyze features
like the query planner's output, our query properties (type,
parameters, complexity) and tried to automatically identify factors
that contribute
On Mon, Sep 12, 2016 at 7:03 AM, Vinicius Segalin
wrote:
> Hi everyone,
>
> I'm trying to find a way to predict query runtime (I don't need to be
> extremely precise). I've been reading some papers about it, and people are
> using machine learning to do so. For the feature vector, they use what t
On Mon, Sep 12, 2016 at 9:03 AM, Vinicius Segalin wrote:
> Hi everyone,
>
> I'm trying to find a way to predict query runtime (I don't need to be
> extremely precise). I've been reading some papers about it, and people are
> using machine learning to do so. For the feature vector, they use what th
2016-09-12 12:08 GMT-03:00 Oleksandr Shulgin :
> On Mon, Sep 12, 2016 at 4:03 PM, Vinicius Segalin
> wrote:
>
>> Hi everyone,
>>
>> I'm trying to find a way to predict query runtime (I don't need to be
>> extremely precise). I've been reading some papers about it, and people are
>> using machine
On Mon, Sep 12, 2016 at 4:03 PM, Vinicius Segalin
wrote:
> Hi everyone,
>
> I'm trying to find a way to predict query runtime (I don't need to be
> extremely precise). I've been reading some papers about it, and people are
> using machine learning to do so. For the feature vector, they use what t
14 matches
Mail list logo
