14 resultados para 3PL-warehouse
em University of Queensland eSpace - Australia
Resumo:
View of exterior wall to warehouse.
Resumo:
Detailed view of downpipes and drainage grill.
Resumo:
View past tiered amphitheatre and offices above to air strip beyond.
Resumo:
View past timber blinds to balcony and timber sunscreens.
Resumo:
View of post being hoisted into position during construction.
Resumo:
View of warehouse exterior.
Resumo:
Detailed view of poles used in construction. Poles were spliced in their length with steel bars (like 3 pin plugs) and these joints were restrained from splitting with steel strap belts. The belts were tightened with opposing wedges like the old Greene & Greene wrought iron detail.
Resumo:
View of warehouse exterior.
Resumo:
View to underside of roof with steel beam and insulation.
Resumo:
Detailed view of cast iron brackets connecting beams and posts.
Resumo:
View of front elevation with entrance from exterior.
Resumo:
Detailed view of cast iron brackets connecting beams and posts.
Resumo:
A data warehouse is a data repository which collects and maintains a large amount of data from multiple distributed, autonomous and possibly heterogeneous data sources. Often the data is stored in the form of materialized views in order to provide fast access to the integrated data. One of the most important decisions in designing a data warehouse is the selection of views for materialization. The objective is to select an appropriate set of views that minimizes the total query response time with the constraint that the total maintenance time for these materialized views is within a given bound. This view selection problem is totally different from the view selection problem under the disk space constraint. In this paper the view selection problem under the maintenance time constraint is investigated. Two efficient, heuristic algorithms for the problem are proposed. The key to devising the proposed algorithms is to define good heuristic functions and to reduce the problem to some well-solved optimization problems. As a result, an approximate solution of the known optimization problem will give a feasible solution of the original problem. (C) 2001 Elsevier Science B.V. All rights reserved.