Database Location in Computer Networks
From MaRDI portal
Publication:3890141
DOI10.1145/322217.322226zbMATH Open0445.68071OpenAlexW1977879268MaRDI QIDQ3890141FDOQ3890141
Authors: Marshall L. Fisher, Dorit S. Hochbaum
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322217.322226
Recommendations
Information storage and retrieval of data (68P20) Network design and communication in computer systems (68M10) Theory of software (68N99)
Cited In (33)
- A constrained nonlinear 0-1 program for data allocation
- Optimal allocation for partially replicated database systems on tree- based networks
- Locating replicas of a database on a network
- Models for planning capacity expansion in local access telecommunication networks
- Title not available (Why is that?)
- A dual ascent approach for steiner tree problems on a directed graph
- Facility location models for distribution system design
- A coordinated planning model for the design of a distributed database system
- Title not available (Why is that?)
- Dynamic replication of web contents
- Optimization of resource location in hierarchical computer networks
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
- Efficient algorithms for the capacitated concentrator location problem
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
- Title not available (Why is that?)
- Exact approaches for static data segment allocation problem in an information network
- Valid inequalities and facets of the capacitated plant location problem
- Facility location models to locate data in information networks: a literature review
- Lagrangean relaxation. (With comments and rejoinder).
- Designing cost-effective content distribution networks
- Location of Software in Distributed Computing Systems
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- Modeling and Managing Uncertainty in Process Planning and Scheduling
- Parallel general prefix computations with geometric, algebraic, and other applications
- The multicovering problem
- Groupings of nodes for distributed databases
- Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique
- Title not available (Why is that?)
- An integer programming model for the allocation of databases in a distributed computer system
- Title not available (Why is that?)
- Title not available (Why is that?)
- On page migration and other relaxed task systems
- Distributed Computing – IWDC 2005
This page was built for publication: Database Location in Computer Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3890141)