• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.870-884
• /
• 2000

Among OLAP(On-Line Analytical Processing) approaches, ROLAP(Relational OLAP) based on the star, snowflake schema which offer the multidimensional analytical method has performance problem and MOLAP (Multidimensional OLAP) based on Multidimensional Database System has scalability problem. In this paper, to solve the limitaions of previous approaches, design and implementation of multidimensional data model based on Object-Relation DBMS was proposed. With the extensibility of Object-Relation DBMS, it is possible to advent multidimensional data model which more expressively define multidimensional concept and analysis functions that are optimized for the defined multidimensional data model. In addition, through the hierarchy between data objects supported by Object-Relation DBMS, the aggregated data model which is inherited from the super-table, multidimensional data model, was designed. One these data models and functions are defined, they behave just like a built-in function, w th the full performance characteristics of Object-Relation DBMS engine.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.10a
• /
• pp.47-48
• /
• 2005

Multidimensional scaling is a multivariate technique for constructing a configuration of n points in Euclidean space using information about the distances between the objects. This can be done by the singular value decomposition of the data matrix. But it is known that the singular value decomposition is not resistant. In this study, we provide a resistant version of the multidimensional scaling.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.637-639
• /
• 2000

다차원 정보 가시화(multidimensional information visualization)의 목적은 복잡하고 차원이 많은 정보 데이터(information data)를 이해하기 쉽게 그림이나 도표와 같은 특정한 형식을 이용하여 효과적으로 나타내고 비교하는데 있다. 그동안 제시되어 온 다차원 정보 가시화 기법의 대표적인 것으로는 Scatterplots, Perspective Wall, Parallel Coordinates, Glyph를 들 수 있다. 본 논문에서 소개하는 multidimensional rotating visualizer (MRV)이란 기존의 다차원 정보 가시화 기법들을 보완하여 다차원 데이터(multidimensional data)를 3차원 형식으로 보여주는 방법이다. MRV는 그중에서 특히 Glyph와 Parallel Coordinate의 특징을 혼합하여 화면상에 다차원 정보 데이터를 보여주는 새로운 시도라고 하겠다.

• East Asian Economic Review
• /
• v.27 no.3
• /
• pp.243-269
• /
• 2023

The multidimensional poverty index is an indicator system established for defining and evaluating poverty, to understand poverty in dimensions beyond just monetary scarcity. Based on income, education, health, living standards, and social dimensions, this article measures and analyzes the level of multidimensional poverty in Xinjiang using the AlkireFoster method, with cross-sectional data obtained from a 2022 survey. Probit model is constructed for regression analysis, further considering the impact of education on enhancing feasible capabilities and alleviating multidimensional poverty at the post-poverty alleviation era. The data shows that many people still face significant challenges from the perspective of multidimensional poverty; the decomposition results of each dimension show that education contributes more to the multidimensional poverty; the regression analysis results show that the higher the education level, the lower the multidimensional poverty; heterogeneity analysis revealed that the inhibitory effect of education on multidimensional poverty is greater for females than males, and the poverty reduction effect of education mainly concentrates on middle-aged and older individuals. This article is meaningful for exploring strategies to alleviate multidimensional poverty in ethnic minority regions in frontier areas in the new era, accelerating regional economic development, and achieving shared prosperity.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12spc
• /
• pp.643-647
• /
• 2021

The use of data analysis on large volumes of data constitutes a challenge for deducting knowledge and new information. Data can be heterogeneous and complex: Semi-structured data (Example: XML), Data from social networks (Example: Tweets) and Factual data (Example: Spreading of Covid-19). In this paper, we propose a generic multidimensional model in order to analyze complex data, according to several dimensions.

• The Journal of Information Technology and Database
• /
• v.8 no.2
• /
• pp.91-101
• /
• 2001

Previous research efforts on performance evaluation of multidimensional indexes typically have used synthetic data sets distributed uniformly or normally over multidimensional space. However, recent research research result has shown that these hinds of data sets hardly reflect the characteristics of multimedia database applications. In this paper, we discuss issues on generating high dimensional data and query sets for resolving the problem. We first identify the features of the data and query sets that are appropriate for fairly evaluating performances of multidimensional indexes, and then propose HDDQ_Gen(High-Dimensional Data and Query Generator) that satisfies such features. HDDQ_Gen supports the following features : (1) clustered distributions, (2) various object distributions in each cluster, (3) various cluster distributions, (4) various correlations among different dimensions, (5) query distributions depending on data distributions. Using these features, users are able to control tile distribution characteristics of data and query sets. Our contribution is fairly important in that HDDQ_Gen provides the benchmark environment evaluating multidimensional indexes correctly.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.547-554
• /
• 2010

In this paper, we extend the work by Lee et al. (2010) to multidimensional di usion processes. A test statistic analogous to the one-dimensional case is proposed to inves-tigate the joint stability of covariance matrix parameters and, under certain regularity conditions, is shown to have a limiting distribution of the sup of a multidimensional Brownian bridge. A simulation result is provided for illustration.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.7
• /
• pp.925-934
• /
• 2017

R-tree is index structure which is frequently used for handling spatial data. However, if the number of dimensions increases, or if only partial dimensions are used for searching the certain data according to user preference, the time for indexing is greatly increased and the efficiency of the generated R-tree is greatly reduced. Hence, it is not suitable for the multidimensional data, where dimensions are continuously increasing. In this paper, we propose a multidimensional hash index, a new multidimensional index structure based on a hash index. The multidimensional hash index classifies data into buckets of euclidean space through a hash function, and then, when an actual search is requested, generates a hash search tree for effective searching. The generated hash search tree is able to handle user preferences in selected dimensional space. Experimental results show that the proposed method has better indexing performance than R-tree, while maintaining the similar search performance.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.50-58
• /
• 2005

Generally, multidimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amounts of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel multidimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-nxmD(disk) architecture which is the hybrid type of nP-nD and 1P-nD. Its node structure in-creases fan-out and reduces the height of an index. Also, a range search algorithm that maximizes I/O parallelism is devised, and it is applied to k-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.2
• /
• pp.60-67
• /
• 2011

Since the non-metric Multidimensional scaling (nMDS), a data visualization technique, provides with insights about engineering, economic, and scientific applications, it is widely used for analyzing large non-metric multidimensional data sets. The nMDS requires a fitness function to measure fit of the proximity data by the distances among n objects. Most commonly used fitness functions are nonlinear and have a difficulty to find a good configuration. In this paper, we propose a new fitness function, an absolute value type, and show its advantages.