Signature search time evaluation in flat file databases

Kwangil Ko; Thomas G. Robertazzi

doi:10.1109/TAES.2008.4560202

Signature search time evaluation in flat file databases

Kwangil Ko
, Thomas G. Robertazzi

Electrical Engineering

Samsung

Research output: Contribution to journal › Article › peer-review

20 Scopus citations

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.

Original language	English
Pages (from-to)	493-502
Number of pages	10
Journal	IEEE Transactions on Aerospace and Electronic Systems
Volume	44
Issue number	2
DOIs	https://doi.org/10.1109/TAES.2008.4560202
State	Published - Apr 2008

Keywords

Computer architecture
Databases
Equations
Load modeling
Mathematical model
Pediatrics
Timing

Access to Document

10.1109/TAES.2008.4560202

Cite this

@article{6e9b1b4962114064bd62f2b5c5be0f66,

title = "Signature search time evaluation in flat file databases",

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 = "Computer architecture, Databases, Equations, Load modeling, Mathematical model, Pediatrics, Timing",

author = "Kwangil Ko and Robertazzi, \{Thomas G.\}",

year = "2008",

month = apr,

doi = "10.1109/TAES.2008.4560202",

language = "English",

volume = "44",

pages = "493--502",

journal = "IEEE Transactions on Aerospace and Electronic Systems",

issn = "0018-9251",

number = "2",

}

TY - JOUR

T1 - Signature search time evaluation in flat file databases

AU - Ko, Kwangil

AU - Robertazzi, Thomas G.

PY - 2008/4

Y1 - 2008/4

N2 - 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.

AB - 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.

KW - Computer architecture

KW - Databases

KW - Equations

KW - Load modeling

KW - Mathematical model

KW - Pediatrics

KW - Timing

UR - https://www.scopus.com/pages/publications/48749121457

U2 - 10.1109/TAES.2008.4560202

DO - 10.1109/TAES.2008.4560202

M3 - Article

AN - SCOPUS:48749121457

SN - 0018-9251

VL - 44

SP - 493

EP - 502

JO - IEEE Transactions on Aerospace and Electronic Systems

JF - IEEE Transactions on Aerospace and Electronic Systems

IS - 2

ER -

Signature search time evaluation in flat file databases

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this