SHERP

분산 데이터 베이스의 효율적 설계를 위한 모델과 알고리즘

Cited 0 time in webofscience Cited 0 time in scopus
Authors
노상규
Issue Date
1995
Publisher
서울대학교 경영정보연구소
Citation
Journal of information and operations management, vol.05 pp.159-188
Abstract
Distributed database systems can yield significant cost and perfonnance advantages over centralized systems for geographically distributed organizations. The efficiency of a distributed database depends primarily on the data allocation (data replication and placement) and the operating strategies (where and how retrieval and update query processing operations are perfonned). We develop a comprehensive distributed database design model that treats data allocation and operating strategies in an integrated manner, explicitly modeling their interdependencies for both retrieval and update processing. Our model includes data replication, a concurrency control mechanism, data reduction by sem끼oin, join node selection, and join ordering. We include two evaluation criteria, minimization of total operating cost and minimization of average response time. To address tractability, we develop a nested genetic algorithm to solve this problem fonnulation.
Language
Korean
URI
http://hdl.handle.net/10371/53020
Files in This Item:
Appears in Collections:
College of Business Administration/Business School (경영대학/대학원)Institute of Information and Operation Management (경영정보연구소)Journal of information and operations management (경영정보논총)Journal of information and operations management vol.05 (1995) (경영정보논총)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse