delorie.com/archives/browse.cgi | search |
Nicklas Karlsson (nicklas DOT karlsson17 AT gmail DOT com) [via geda-user AT delorie DOT com] wrote: >An N:N grow to the square of number of items. A sorted table for example may be searched log(N) iterations which make a huge different then number of items grow. An N:N table does not imply that you have that many entries. The number of entries in an N:N table is equal to the number relations between objects. Relations only need to be stored in there once, even for bidirectional ones. So searches in this N:N table will be log(N). -- Stephen.
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |