Big O
From: Nashirak Bosk <bluhmcc_at_auburn.edu>
Date: Sat, 26 Jan 2002 00:22:28 -0500
Message-ID: <u54i63m3gt0628_at_corp.supernews.com>
I am writing something on the advantages of Databases over flatfile systems in most Commercial Situations. Does anyone know the search times
(in the order of Big O)?? I am thinking its pretty close to O(1)
(Through hashing) but does anyone know about the average big O for most
Databases? Received on Sat Jan 26 2002 - 06:22:28 CET
Date: Sat, 26 Jan 2002 00:22:28 -0500
Message-ID: <u54i63m3gt0628_at_corp.supernews.com>
I am writing something on the advantages of Databases over flatfile systems in most Commercial Situations. Does anyone know the search times
(in the order of Big O)?? I am thinking its pretty close to O(1)
(Through hashing) but does anyone know about the average big O for most
Databases? Received on Sat Jan 26 2002 - 06:22:28 CET