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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Signature search time evaluation in flat file databases


    Contributors:


    Publication date :

    2008-04-01


    Size :

    1577133 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    False Hits of Tri-Syllabic Queries in a Chinese Signature File

    Liang, T. / Lee, S.-Y. / Yang, W.-P. | British Library Conference Proceedings | 1995


    Organizing image databases as visual-content search trees

    Schweitzer, H. | British Library Online Contents | 1999


    Efficient search scheme for very large image databases [3964-08]

    Pramanik, S. K. / Li, J. / Ruan, J. et al. | British Library Conference Proceedings | 2000