You are viewing a plain text version of this content. The canonical link for it is here.

Posted to derby-dev@db.apache.org by "Mamta A. Satoor (JIRA)" <ji...@apache.org> on 2013/06/25 06:09:20 UTC

[jira] [Updated] (DERBY-6134) Faster, incremental implementation of DISTINCT in presence of FETCH NEXT clause

     [ https://issues.apache.org/jira/browse/DERBY-6134?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Mamta A. Satoor updated DERBY-6134:
-----------------------------------

    Urgency: Low
     Labels: derby_triage10_11  (was: )
    
> Faster, incremental implementation of DISTINCT in presence of FETCH NEXT clause
> -------------------------------------------------------------------------------
>
>                 Key: DERBY-6134
>                 URL: https://issues.apache.org/jira/browse/DERBY-6134
>             Project: Derby
>          Issue Type: Improvement
>          Components: SQL
>            Reporter: Dag H. Wanvik
>            Priority: Minor
>              Labels: derby_triage10_11
>
> DISTINCT queries with a FETCH NEXT clause can be made faster
> by using a hash table rather than the current sorting of all rows, cf. the slow query seen by a user in DERBY-6132, at least if the number of rows fetched by the clause is a (low) fraction of the total number of rows and the has table would fit in memory.

--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira