> only 1 index lookup is needed.
Sorry, must be "only lookups of 1 index are needed".
--
Dilshod Urazov
вт, 20 февр. 2024 г. в 21:09, Dilshod Urazov :
> > I'm not sure why are two indexes not sufficient here?
>
> Did I write that they are not sufficient? The whole point is that in
> relational
> I'm not sure why are two indexes not sufficient here?
Did I write that they are not sufficient? The whole point is that in
relational DBMSs which are widely used
to store graphs we can optimize storage in such cases. Also we can optimize
traversals e.g. if we want to
get all nodes that are
On Mon, 19 Feb 2024 at 18:48, Dilshod Urazov wrote:
>
> - Motivation
>
> A regular B-tree index provides efficient mapping of key values to tuples
> within a table. However, if you have two tables connected in some way, a
> regular B-tree index may not be efficient enough. In this case, you
- Motivation
A regular B-tree index provides efficient mapping of key values to tuples
within a table. However, if you have two tables connected in some way, a
regular B-tree index may not be efficient enough. In this case, you would
need to create an index for each table. The purpose will become
