• Digital Contents
• /
• no.5 s.108
• /
• pp.90-95
• /
• 2002

지난 호에서는 정적 SQL(Static SQL)의 장점과 Oracle8i에서 도입된 analytic function이라는 새로운 기능을 이용해서 부분범위처리가 가능한 효율적인 게시판 구현에 대해서 살펴보았다. 이번 호에서는 analytic function, FBI(Function Based Index), 순환관계(connect by ㆍㆍㆍstart with)를 이용한 응답글(속칭 리플)이 있는 게시판의 부분범위처리에 대해서 살펴보고, 게시판의 총글수나 사용자별 마일리지합 정보 등 집계성이나 항상 사용자가 온라인상에 보고자하는 정보들을 효율적으로 관리하기 위해 materialized view를 적용하는 방법에 대해서 알아보겠다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.268-270
• /
• 2001

데이터웨어하우스내에서 실체뷰는 소스 데이터에서 갱신이 발생하였을 경우 질의에 정확한 결과를 제공하기 위하여 릴레이션의 변경사항과 동일하게 갱신되어야 한다. 이 뷰를 갱신할 때 전체 릴레이션이 아닌 갱신된 부분만 이용하여 점진적으로 뷰를 관리하는 것이 효과적이다. 뷰의 점진적인 갱신 방법중에서 부가화일을 이용한 방법은 부가적으로 유지하는 정보의 양이 적고 뷰 관리 비용이 적게 든다는 장점이 있다. 이 논문에서는 이 방법에 의해 뷰를 관리할 때의성능을 평가하기 위하여 이 방법의 비용 모델을 분석적으로 제시하였으며, 이 모델을 기반으로 성능을 비교, 분석하여 부가 파일을 이용한 방법이 다른 기존의 방법보다 성능이 우수함을 보였다.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.1-9
• /
• 1998

Temporal Databases store all of informations by time varying, so the temporal query processor has to process very large information. Therefore, we propose an efficient method of query processing by using the relevance checking algorithm of input query and view definition. The relevance checking algorithm of query investigates relevance between the input query of user about base relation and the execution tree of view definition stored in system catalog. And related input query with view definition have a process of the query translation to the execution tree of view. So temporal query processor is able to increase performance of query processor by reducing the number of tuple.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.41 no.6
• /
• pp.117-128
• /
• 2013

This study aims to examine various discourses of the urban landscape discussed in the fields of new cultural geography, spatial political economy, and landscape architecture in order to propose a theoretical framework for the interpretation of a contemporary urban landscape. The notion of landscape is a modern idea that separates humans, especially the bourgeois subject, from nature, and then achieves the visual possession of nature. New cultural geographers have studied the political aspects of landscape. According to them, landscape as materialized discourse is "a way of seeing" which includes the vision of the upper class, the imperialistic view, and the masculine and voyeuristic gaze. In addition, spatial political economists have paid attention to the economic aspects of landscape. They have emphasized that the material production of landscape is indispensable in the production of surplus values in the capitalistic system. Thus, we insist focusing dialectically on both the materiality and ideology of landscape.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.28-35
• /
• 2000

In order to acquire the precise and fast response for an analytical query, proper selection of the views to materialize in data warehouse is very crucial. In traditional algorithms, the whole relation is considered to be selected as materialized views. However, materializing the whole relation rather than a part of relation results in much worse performance in terms of time and space cost. Therefore, we present a new algorithm for selection of views to materialize using clustering method in order to improve the performance of data warehouse including this problem. In the presented algorithm, ASVMR(Algorithm for Selection of Views to Materialize using Reduced table), we first generate reduced tables in data warehouse using automatic clustering based on attribute-values density, then we consider the combination of reduced tables as materialized views instead of the combination of the original base relations. We also show the experimental results in which both time and space cost are approximately 1.8 times better than the conventional algorithms.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.252-272
• /
• 2003

The view mechanism provides users with appropriate portions of database through data filtering and integration. In the Web era where information proliferates, the view concept is also useful for XML, a future standard for data exchange on the Web. This paper proposes a method of implementing XML views called XML view indexing, whereby XML view xv is represented as an XML view index(XVI) which is a structure containing the identifiers of xv's underlying XML elements as well as the information on xv. Since XVI for xv stores just the identifiers of the XML elements but not the elements themselves, when a user requests to retrieve xv, its XVI should be materialized against xv's underlying XML documents. Also an efficient algorithm to incrementally maintain consistency of XVI given a update of xv's underlying XML documents is required. This paper proposes and implements data structures and algorithms for XML view indexing. The performance experiments on XML view indexing reveal that it outperforms view recomputation for repeated accesses to the view, and requires as much as about 30 times less storage space compared to XML view materialization though the latter takes less time for repeated accesses to the view due to no need of materialization.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.620-632
• /
• 2001

This paper proposes a mediator system which can provide a view management function in the today's heterogeneous computing environment including operating system database management systems and other software. while most mediators use view modification mechanism only, the use of view materialization is also considered in this research. In order to optimize the management cost for materialized views the proposed method applies a decay factor for modeling the access behaviors of views In other words, the most recently access pattern gets the highest attention in the optimization process all the necessary it with the CORBA.

• 한국컴퓨터산업교육학회:학술대회논문집
• /
• 2003.11a
• /
• pp.33-38
• /
• 2003

Reports have a significant meaning in time-constrained large transaction environments, such as airplane control systems or wargame simulations. This is due to the necessity of generating reports within a limited scope of time without restraining the operation performance of large transaction environments. In order to generate reports in large transaction environments while satisfying time - constrained requirements, this paper propose a model which combines the incremental operation mechanism and materialized view mechanism using triggers and stored procedures. Further, the implementation and evaluation of the preposed model provides analysis for model characteristics.

• The Journal of Information Technology and Database
• /
• v.4 no.2
• /
• pp.79-95
• /
• 1998

Useful data being distributed over several systems, we have a problem in accessing and utilizing them. Recognizing this problem, researchers have proposed two concepts as solutions to the problem, multidatabase and data warehouse. The one provides a virtual view over the distributed data, and the latter is a materialized view of it. Recently, more attention has been paid to the latter, which is a single of distributed database, collected along a time dimension. So, the major issues in building a data warehouse are 1) how to define a global schema for the data warehouse, 2) how to capture changes from local databases, and 3) how to represent time-varying values of data item. This paper presents an integrated approach to these issues, borrowing the research results from such areas as multidatabase, active databases and temporal databases.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.97-100
• /
• 2015

Analysis of construction tender documents in overseas projects is a very important issue from a risk management point of view. Unfortunately, majority of construction firms are biased by winning contracts without in-depth analysis of tender documents. As a result, many contractors have incurred loss in overseas projects. Although a lot of risk analysis techniques have been introduced, most of them focus project's external unexpected risks such as country conditions and owner's financial standing. However, because those external risks are difficult to control and take preemptive action, we need to concentrate on project inherent risks. Based on this premise, this paper proposes a project-oriented risk mining approach which could detect and extract project risk factors automatically before they are materialized and assess them. This study presents a methodology regarding how to extract potential risks which exist in owner's project requirements and project tender documents using state of the art data analysis method such as text mining, data mining, and information visualization. The project-oriented risk mining approach is expected to effectively reflect project characteristics to the project risk management and could provide construction firms with valuable business intelligence.