• DocumentCode
    2500738
  • Title

    A heuristic algorithm for determining a near-optimal set of nodes to access in a partially replicated distributed database system

  • Author

    Mukkamala, Ravi ; Bruell, Steven C. ; Shultz, Roger K.

  • Author_Institution
    Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA
  • fYear
    1988
  • fDate
    1-5 Feb 1988
  • Firstpage
    330
  • Lastpage
    336
  • Abstract
    An O(n2) heuristic algorithm using randomized decisions is developed for determining a near-optimal set of nodes. For small values of n, the authors can determine how close the heuristic solution is to the optimal set of nodes. They also compare their heuristic to other algorithms reported in the literature
  • Keywords
    computational complexity; database theory; distributed databases; graph theory; heuristic programming; optimisation; heuristic algorithm; heuristic solution; near-optimal set; nodes; partially replicated distributed database system; randomized decisions; Cities and towns; Computer science; Concurrency control; Database systems; Delay; Distributed databases; Greedy algorithms; Heuristic algorithms; Linear programming; NP-hard problem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Engineering, 1988. Proceedings. Fourth International Conference on
  • Conference_Location
    Los Angeles, CA
  • Print_ISBN
    0-8186-0827-7
  • Type

    conf

  • DOI
    10.1109/ICDE.1988.105476
  • Filename
    105476
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2500738