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.
Signature search time evaluation in flat file databases
IEEE Transactions on Aerospace and Electronic Systems ; 44 , 2 ; 493-502
2008-04-01
1577133 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Signature Search Time Evaluation in Flat File Databases
Online Contents | 2008
|False Hits of Tri-Syllabic Queries in a Chinese Signature File
British Library Conference Proceedings | 1995
|Organizing image databases as visual-content search trees
British Library Online Contents | 1999
|Efficient search scheme for very large image databases [3964-08]
British Library Conference Proceedings | 2000
|