Performance optimality enhancement algorithm in DDBS (POEA).

Highlights: [•] A new dynamic data allocation algorithm for non-replicated DDBS (POEA) is presented. [•] POEA improves fragments reallocation to different sites. [•] POEA adopts the shortest path between the old location and the new anticipated location. [•] Experimental results show that POEA has e...

Descripción completa

Detalles Bibliográficos
Publicado en:Computers in Human Behavior Vol. 30; pp. 419 - 427
Autores principales: Abdallaha, Hassan I., Amer, Ali A., Mathkour, Hassan
Formato: Artículo
Publicado: Elsevier B.V. Jan2014
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=92513829&site=ehost-live
header:
  @attributes:
    shortDbName: ssf
    uiTerm: 92513829
    longDbName: Social Sciences Full Text (H.W. Wilson)
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        07475632
        JC4
      jtl: Computers in Human Behavior
      issn: 07475632
      maglogo: N
    pubinfo:
      dt: Jan2014
      vid: 30
      pid: 2410
      pub: Elsevier B.V.
    artinfo:
      ui:
        92513829
        10.1016/j.chb.2013.04.026
      ppf: 419
      ppct: 8
      formats:
      tig:
        atl: Performance optimality enhancement algorithm in DDBS (POEA).
      aug:
        au:
          Abdallaha, Hassan I.
          Amer, Ali A.
          Mathkour, Hassan
        affil: Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia
      su:
        Database management
        Algorithms
        Database management software
      sug:
        subj:
          Data Processing, Hosting, and Related Services
          Database management
          Algorithms
          Database management software
      keyword:
        Algorithm
        Allocation
        DDBS
        Fragment
        Redistribution
        Algorithm
        Allocation
        DDBS
        Fragment
        Redistribution
      ab: Highlights: [•] A new dynamic data allocation algorithm for non-replicated DDBS (POEA) is presented. [•] POEA improves fragments reallocation to different sites. [•] POEA adopts the shortest path between the old location and the new anticipated location. [•] Experimental results show that POEA has efficiently reduced the transmission cost. [•] Minimizes frequency and time spent on fragment migration over the network sites.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: N
    holdings:
      @attributes:
        islocal: N