|
|
This is only a preview of the paper
Click here to register and get the full text.
Existing members click here to login
|
|
|
The basic reasons organizations implement data warehouses are: To perform server/disk bound tasks associated with querying and reporting on servers/disks not used by transaction processing systems most firms want to set up transaction processing systems so there is a high probability that transactions will be completed in what is judged to be an acceptable amount of time. Reports and queries, which can require a much greater range of limited server/disk resources than transaction processing, run on the servers/disks used by transaction processing systems can lower the probability that transactions complete in an acceptable amount of time. Or, running queries and reports, with their variable resource requirements, on the servers/disks used by transaction processing systems can make it quite complex to manage servers/disks so there is a high enough probability that acceptable response time can be achieved. Firms therefore may find that the least expensive and/or most organizationally expeditious way to obtain high probability of acceptable transaction processing response time is to implement a data warehousing architecture that uses separate servers/disks for some querying and reporting. To use data models and/or server technologies that speed up querying and reporting and that are not appropriate for transaction processing There are ways of modeling data that usually speed up querying and reporting (e.g., a star schema) and may not be appropriate for transaction processingThe basic reasons organizations implement data warehouses are: To perform server/disk bound tasks associated with querying and reporting on servers/disks not used by transaction processing systems most firms want to set up transaction processing systems so there is a high probability that transactions will be completed in what is judged to be an acceptable amount of time. Reports and queries, which can require a much greater range of limited server/disk resources than transaction processing, run on the servers/disks used by transaction processing systems can lower the probability that transactions complete in an acceptable amount of time. Or, running queries and reports, with their variable resource requirements, on the servers/disks used by transaction processing systems can make it quite complex to manage servers/disks so there is a high enough probability that acceptable response time can be achieved.
Approximate Word count = 1359
Approximate Pages = 5.4
(250 words per page double spaced)
|
|
|
|
|
|