t; On Thu, Dec 18, 2008 at 7:21 PM, Clint Morgan >>>
>>>>
>>>>> wrote:
>>>>>
>>>>>
>>>>
>>>>
>>>>
>>>>> You could maintain an index, and then use the index to jump right to
>>
int Morgan
wrote:
You could maintain an index, and then use the index to jump right to rows
for the column value(s) in question. See the tableindexed package for
more
info..
cheers,
-clint
On Thu, Dec 18, 2008 at 4:37 AM, Slava Gorelik
wrote:
Hi.I'm trying to implem
>> for the column value(s) in question. See the tableindexed package for
>>> more
>>> info..
>>>
>>> cheers,
>>> -clint
>>>
>>> On Thu, Dec 18, 2008 at 4:37 AM, Slava Gorelik >>
>>>
>>>> wrote:
>>>
Morgan wrote:
You could maintain an index, and then use the index to jump right to rows
for the column value(s) in question. See the tableindexed package for more
info..
cheers,
-clint
On Thu, Dec 18, 2008 at 4:37 AM, Slava Gorelik
wrote:
Hi.I'm trying to implement U
nt
>
> On Thu, Dec 18, 2008 at 4:37 AM, Slava Gorelik >wrote:
>
> > Hi.I'm trying to implement Unique constraint on some column, but it looks
> > like there no other solution than to scan all data.
> > This solution is problematic from the performance perspectiv
You could maintain an index, and then use the index to jump right to rows
for the column value(s) in question. See the tableindexed package for more
info..
cheers,
-clint
On Thu, Dec 18, 2008 at 4:37 AM, Slava Gorelik wrote:
> Hi.I'm trying to implement Unique constraint on some column
Hi.I'm trying to implement Unique constraint on some column, but it looks
like there no other solution than to scan all data.
This solution is problematic from the performance perspective. Is it
possible to implement this in the better way ?
Best Regards.