A coordinated planning model for the design of a distributed database system

DOI10.1016/j.ins.2003.03.010zbMath1094.68553OpenAlexW1985696684MaRDI QIDQ707350

Ali Amiri

Publication date: 9 February 2005

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2003.03.010

zbMATH Keywords

Mathematical programmingPlanningHeuristicDatabase serversDistributed database system

Mathematics Subject Classification ID

Database theory (68P15) Distributed systems (68M14)

Related Items (1)

A near-optimal database allocation for reducing the average waiting time in the grid computing environment

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Efficient algorithms for the capacitated concentrator location problem
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• File Allocation Problem: Comparison of Models with Worst Case and Average Communication Delays
• Optimal and efficient integration of heterogeneous summary tables in a distributed database
• Database Allocation in a Distributed Environment: Incorporating a Concurrency Control Mechanism and Queuing Costs
• Optimal placement of data replicas in distributed database with majority voting protocol

This page was built for publication: A coordinated planning model for the design of a distributed database system