• Title/Summary/Keyword: Data schema

Search Result 687, Processing Time 0.04 seconds

A Nonunique Composite Foreign Key-Based Approach to Fact Table Modeling and MDX Query Composing (비유일 외래키 조합 복합키 기반의 사실테이블 모델링과 MDX 쿼리문 작성법)

  • Yu, Han-Ju;Lee, Duck-Sung;Choi, In-Soo
    • KSCI Review
    • /
    • v.14 no.2
    • /
    • pp.185-197
    • /
    • 2006
  • A star schema consists of a central fact table, which is surrounded by one or more dimension tables. Each row int the fact table contains a multi-part primary key(or a composite foreign key) along with one or more columns containing various facts about the data stored in the row Each of the composit foreign key components is related to a dimensional table. The combination of keys in the fact table creates a composite foreign key that is unique to the fact table record. The composite foreign key, however, is rarely unique to the fact table record in real-world applications, particularly in financial applications. In order to make the composite foreign key be the determinant in real-world application, some precalculation might be performed in the SQL relational database, and cached in the OLAP database. However, there are many drawbacks to this approach. In some cases, this approach might give users the wrong results. In this paper, an approach to fact table modeling and related MDX query composing, which can be used in real-world applications without performing any precalculation and gives users the correct results, is proposed.

  • PDF

Development of an Integrated Retrieval System on Distributed KRISTAL-2002 Systems with Metadata Information (메타데이터 정보를 이용한 분산 KRISTAL-2002 시스템의 통합 검색 시스템 개발)

  • Choe Gui-ja;Kim Jae-Gon;Seo Jung-Hyun;Cho Han-Hyung;Lee Min-Ho;Jung Chang-Hu;Park Dong-In;Nam Young-Kwang
    • The KIPS Transactions:PartD
    • /
    • v.12D no.1 s.97
    • /
    • pp.135-150
    • /
    • 2005
  • In this paper, we propose an integrated information retrieval system for distributed multiple KRISTAL-2002 systems by using the metadata information. This system integrates current systems for different areas or systems for the same area with the different schemas so that the users can get the answers by once from the whole systems. The proposed system composes of the Source Server Manager(SSM) supporting the mapping between the integrated metadata database and source server, the Integrated Metadata Manager(ISM) for registering and managing the metadata and schema mapping, the Distributed Query Processor (DQP) for processing the user query into the source server query, the Distributed Data Set Integrated Manager(DDSIM) for transforming the total retrieval results by merging to the HTML format, and the integrated retrieval engine for managing the query results. It is assumed that the integrated metadata follows ISO/IEC 11179 metadata registration procedure with the metadata registry system which is a subsystem of the proposed system. There are two kinds of queries for users; the basic query and the detailed query. The users may select the databases or organizations for results by their own choices before giving the queries. The proposed system has been developed over KRISTAL-2002 systems with $Visual C^{++}\;and\;C^{++}-CGI$ and tested and verified with the six database systems.

The Use of Analogy in Teaching and Learning Geography (효과적인 지리 교수.학습을 위한 유추의 이해와 활용)

  • Lee, Jong-Won;Harm, Kyung-Rim
    • Journal of the Korean Geographical Society
    • /
    • v.46 no.4
    • /
    • pp.534-553
    • /
    • 2011
  • Analogical thinking is a problem-solving strategy to use a familiar problem (or base analog) to solve a novel problem of the same type (the target problem). The purpose of this study is to provide new insight into geography teaching and learning by connecting cognitive science research on analogical thinking with issues of geography education and suggest that teaching with analogies can be a productive instructional strategy for geography. In this study, using the various examples of analogical thinking used in geography we defined analogical thinking, addressed the theoretical models on analogical transfer, and discussed conditions that make an effective analogical transfer. The major research findings include the following: a) the spatial analogy, indicating skills to find places that may be far apart but have similar locations, and therefore have other similar conditions and/or connections, can provide a useful way to design contents for place learning; b) representational transfer, specifying a common representation for two problems, can play a key role in solving geographic problems requiring data visualization and spatialization processes; and c) either asking learners to compare/analyze similar examples sharing common structure or providing them examples bridging the gap between concrete, real-life phenomena and the ideas and models can contribute to learning in geographic concepts and skills. The spatial analogy requiring both geographic content knowledge and visual/spatial thinking has the potential to become a content-specific problem-solving strategy. We ended with recommendations for future research on analogy that is important in geography education.

A Nonunique Composite Foreign Key-Based Approach to Fact Table Modeling and MDX Query Composing (비유일 외래키 조합 복합키 기반의 사실테이블 모델링과 MDX 쿼리문 작성법)

  • Yu, Han-Ju;Lee, Duck-Sung;Choi, In-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.177-188
    • /
    • 2007
  • A star schema consists of a central fact table, which is surrounded by one or more dimension tables. Each row in the fact table contains a multi-part primary key(or a composite foreign key) along with one or more columns containing various facts about the data stored in the row. Each of the composit foreign key components is related to a dimensional table. The combination of keys in the fact table creates a composite foreign key that is unique to the fact table record. The composite foreign key, however, is rarely unique to the fact table retold in real-world applications, particularly in financial applications. In order to make the composite foreign key be the determinant in real-world application, some precalculation might be performed in the SQL relational database, and cached in the OLAP database. However, there are many drawbacks to this approach. In some cases, this approach might give users the wrong results. In this paper, an approach to fact table modeling and related MDX query composing, which can be used in real-world applications without performing any precalculation and gives users the correct results, is proposed.

  • PDF

On Method for LBS Multi-media Services using GML 3.0 (GML 3.0을 이용한 LBS 멀티미디어 서비스에 관한 연구)

  • Jung, Kee-Joong;Lee, Jun-Woo;Kim, Nam-Gyun;Hong, Seong-Hak;Choi, Beyung-Nam
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2004.12a
    • /
    • pp.169-181
    • /
    • 2004
  • SK Telecom has already constructed GIMS system as the base common framework of LBS/GIS service system based on OGC(OpenGIS Consortium)'s international standard for the first mobile vector map service in 2002, But as service content appears more complex, renovation has been needed to satisfy multi-purpose, multi-function and maximum efficiency as requirements have been increased. This research is for preparation ion of GML3-based platform to upgrade service from GML2 based GIMS system. And with this, it will be possible for variety of application services to provide location and geographic data easily and freely. In GML 3.0, it has been selected animation, event handling, resource for style mapping, topology specification for 3D and telematics services for mobile LBS multimedia service. And the schema and transfer protocol has been developed and organized to optimize data transfer to MS(Mobile Stat ion) Upgrade to GML 3.0-based GIMS system has provided innovative framework in the view of not only construction but also service which has been implemented and applied to previous research and system. Also GIMS channel interface has been implemented to simplify access to GIMS system, and service component of GIMS internals, WFS and WMS, has gotten enhanded and expanded function.

  • PDF

Does Brand Experience Affect Consumer's Emotional Attachments? (브랜드의 총체적 체험이 소비자-브랜드의 정서적 유대관계에 미치는 영향)

  • Lee, Jieun;Jeon, Jooeon;Yoon, Jaeyoung
    • Asia Marketing Journal
    • /
    • v.12 no.2
    • /
    • pp.53-81
    • /
    • 2010
  • Brand experience has received much attention from considerable marketing research. When consumers consume and use brands, they are exposed to various specific brand-related stimuli. These brand-related stimuli include brand identity and brand communications(e.g., colors, shapes, designs, slogans, mascots, brand characters) components. Brakus, Schmitt, and Zarantonello(2009) conceptualized brand experience as subjective and internal consumer responses evoked by brand-related stimuli. They demonstrated that brand experience can be broken down into four dimensions(sensory, affective, intellectual, and behavioral). Because experiences result from stimulations and lead to pleasurable outcomes, we expect consumers to want to repeat theses experiences. That is, brand experiences, stored in consumer memory, should affect brand loyalty. Consumers with positive experiences should be more likely to buy a brand again and less likely to buy an alternative brand(Fournier 1998; Oliver 1997). Brand attachment, one of dimensions of the consumer-brand relationship, is defined as an emotional bond to the specific brand(Thomson, MacInnis, and Park 2005). Brand attachment is target-specific bond between the consumer and the specific brand. Thus, strong attachment is attended by a rich set of schema that link the brand to the consumer. Previous researches propose that brand attachments should affect consumers' commitment to the brand. Brand experience differs from affective construct such as brand attachment. Brand attachment is based on interaction between a consumer and the brand. In contrast, brand experience occurs whenever there is a direct and indirect interaction with the brand. Furthermore, brand experience is not an emotional relationship concept. Brakus et al.(2009) suggest that brand experience may result in brand attachment. This study aims to distinguish brand experience dimensions and investigate the effects of brand experience on brand attachment and brand commitment. We test research problems with data from 265 customers having brand experiences in various product categories by using multiple regression and structural equation model. The empirical results can be summarized as follows. First, the paths from affective, behavior, and intellectual experience to the brand attachment were found to be positively significant whereas the effect of sensory experience to brand attachment was not supported. In the consumer literature, sensory experiences for consumers are often equated with aesthetic pleasure. Over time, these pleasure experiences can affect consumer satisfaction. However, sensory pleasures are not linked to attachment such as consumers' strong emotional bond(i.e., hot affect). These empirical results confirms the results of previous studies. Second, brand attachment including passion and connection influences brand commitment positively but affection does not influence brand commitment. In marketing context, consumers with brand attachment have intention to have a willingness to stay with the relationship. The results also imply that consumers' emotional attachment is characterized by a set of brand experience dimensions and consumers who are emotionally attached to the brand are committed. The findings of this research contribute to develop differences between brand experience and brand attachment and to provide practical implications on the brand experience management. Recently, many brand managers have focused on short-term view. According to this study, we suggest that effective brand experience management requires taking a long-term view of marketing decisions.

  • PDF

A Ranking Algorithm for Semantic Web Resources: A Class-oriented Approach (시맨틱 웹 자원의 랭킹을 위한 알고리즘: 클래스중심 접근방법)

  • Rho, Sang-Kyu;Park, Hyun-Jung;Park, Jin-Soo
    • Asia pacific journal of information systems
    • /
    • v.17 no.4
    • /
    • pp.31-59
    • /
    • 2007
  • We frequently use search engines to find relevant information in the Web but still end up with too much information. In order to solve this problem of information overload, ranking algorithms have been applied to various domains. As more information will be available in the future, effectively and efficiently ranking search results will become more critical. In this paper, we propose a ranking algorithm for the Semantic Web resources, specifically RDF resources. Traditionally, the importance of a particular Web page is estimated based on the number of key words found in the page, which is subject to manipulation. In contrast, link analysis methods such as Google's PageRank capitalize on the information which is inherent in the link structure of the Web graph. PageRank considers a certain page highly important if it is referred to by many other pages. The degree of the importance also increases if the importance of the referring pages is high. Kleinberg's algorithm is another link-structure based ranking algorithm for Web pages. Unlike PageRank, Kleinberg's algorithm utilizes two kinds of scores: the authority score and the hub score. If a page has a high authority score, it is an authority on a given topic and many pages refer to it. A page with a high hub score links to many authoritative pages. As mentioned above, the link-structure based ranking method has been playing an essential role in World Wide Web(WWW), and nowadays, many people recognize the effectiveness and efficiency of it. On the other hand, as Resource Description Framework(RDF) data model forms the foundation of the Semantic Web, any information in the Semantic Web can be expressed with RDF graph, making the ranking algorithm for RDF knowledge bases greatly important. The RDF graph consists of nodes and directional links similar to the Web graph. As a result, the link-structure based ranking method seems to be highly applicable to ranking the Semantic Web resources. However, the information space of the Semantic Web is more complex than that of WWW. For instance, WWW can be considered as one huge class, i.e., a collection of Web pages, which has only a recursive property, i.e., a 'refers to' property corresponding to the hyperlinks. However, the Semantic Web encompasses various kinds of classes and properties, and consequently, ranking methods used in WWW should be modified to reflect the complexity of the information space in the Semantic Web. Previous research addressed the ranking problem of query results retrieved from RDF knowledge bases. Mukherjea and Bamba modified Kleinberg's algorithm in order to apply their algorithm to rank the Semantic Web resources. They defined the objectivity score and the subjectivity score of a resource, which correspond to the authority score and the hub score of Kleinberg's, respectively. They concentrated on the diversity of properties and introduced property weights to control the influence of a resource on another resource depending on the characteristic of the property linking the two resources. A node with a high objectivity score becomes the object of many RDF triples, and a node with a high subjectivity score becomes the subject of many RDF triples. They developed several kinds of Semantic Web systems in order to validate their technique and showed some experimental results verifying the applicability of their method to the Semantic Web. Despite their efforts, however, there remained some limitations which they reported in their paper. First, their algorithm is useful only when a Semantic Web system represents most of the knowledge pertaining to a certain domain. In other words, the ratio of links to nodes should be high, or overall resources should be described in detail, to a certain degree for their algorithm to properly work. Second, a Tightly-Knit Community(TKC) effect, the phenomenon that pages which are less important but yet densely connected have higher scores than the ones that are more important but sparsely connected, remains as problematic. Third, a resource may have a high score, not because it is actually important, but simply because it is very common and as a consequence it has many links pointing to it. In this paper, we examine such ranking problems from a novel perspective and propose a new algorithm which can solve the problems under the previous studies. Our proposed method is based on a class-oriented approach. In contrast to the predicate-oriented approach entertained by the previous research, a user, under our approach, determines the weights of a property by comparing its relative significance to the other properties when evaluating the importance of resources in a specific class. This approach stems from the idea that most queries are supposed to find resources belonging to the same class in the Semantic Web, which consists of many heterogeneous classes in RDF Schema. This approach closely reflects the way that people, in the real world, evaluate something, and will turn out to be superior to the predicate-oriented approach for the Semantic Web. Our proposed algorithm can resolve the TKC(Tightly Knit Community) effect, and further can shed lights on other limitations posed by the previous research. In addition, we propose two ways to incorporate data-type properties which have not been employed even in the case when they have some significance on the resource importance. We designed an experiment to show the effectiveness of our proposed algorithm and the validity of ranking results, which was not tried ever in previous research. We also conducted a comprehensive mathematical analysis, which was overlooked in previous research. The mathematical analysis enabled us to simplify the calculation procedure. Finally, we summarize our experimental results and discuss further research issues.