Signature search time evaluation in flat file databases |
| |
Authors: | Kwangil Ko Robertazzi TG |
| |
Institution: | Stony Brook Univ., Stony Brook, NY; |
| |
Abstract: | For the first time, divisible load scheduling theory is used to solve for the expected time for searching for both single and multiple signatures in certain multiple processor database architectures. The target architectures examined for illustrative purposes are linear daisy chains and single level tree networks with single and multiple installment load distribution. The use of divisible load modeling and analysis yields elegant expressions for expected search time. |
| |
Keywords: | |
|
|