• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.319-332
• /
• 2008

Data cube, which is multi-dimensional data model, have been successfully applied in many cases of multi-dimensional data analysis, and is still being researched to be applied in data stream analysis. Data stream is being generated in real-time, incessant, immense, and volatile manner. The distribution characteristics of data arc changing rapidly due to those characteristics, so the primary rule of handling data stream is to check once and dispose it. For those characteristics, users are more interested in high support attribute values observed rather than the entire attribute values over data streams. This paper propose dynamic data cube for applying data cube to data stream environment. Dynamic data cube specify user's interested area by the support ratio of attribute value, and dynamically manage the attribute values by grouping each other. By doing this it reduce the memory usage and process time. And it can efficiently shows or emphasize user's interested area by increasing the granularity for attributes that have higher support. We perform experiments to verify how efficiently dynamic data cube works in limited memory usage.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.475-486
• /
• 2009

Data cube plays an important role in multi-dimensional, multi-level data analysis. Meeting on-line analysis requirements of data stream, several cube structures have been proposed for OLAP on data stream, such as stream cube, flowcube, S-cube. Since it is costly to construct data cube and execute ad-hoc OLAP queries, more research works should be done considering efficient data structure, query method and algorithms. Stream cube uses H-cubing to compute selected cuboids and store the computed cells in an H-tree, which form the cuboids along popular-path. However, the H-tree layoutis disorderly and H-cubing method relies too much on popular path.In this paper, first, we propose $H^*$-tree, an improved data structure, which makes the retrieval operation in tree structure more efficient. Second, we propose an improved cubing method, $H^*$-cubing, with respect to computing the cuboids that cannot be retrieved along popular-path when an ad-hoc OLAP query is executed. $H^*$-tree construction and $H^*$-cubing algorithms are given. Performance study turns out that during the construction step, $H^*$-tree outperforms H-tree with a more desirable trade-off between time and memory usage, and $H^*$-cubing is better adapted to ad-hoc OLAP querieswith respect to the factors such as time and memory space.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1381-1394
• /
• 2006

Generation methods of data cube have been studied for many years in data warehouse which supports decision making using stored data. There are two previous studies, one is multi-way array algorithm and the other is H-cubing algorithm which is based on the hyper-tree. The multi-way array algorithm stores all aggregation data in arrays, so if the base data is increased, the size of memory is also grow. The H-cubing algorithm which is based on the hyper-tree stores all tuples in one tree so the construction cost is increased. In this paper, we present an efficient data cube generation method based on hash table using weight mapping table and record hash table. Because the proposed method uses a hash table, the generation cost of data cube is decreased and the memory usage is also decreased. In the performance study, we shows that the proposed method provides faster search operation time and make data cube generation operate more efficiently.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.262-273
• /
• 2002

MOLAP is a technology that accelerates multidimensional data analysis by storing data in a multidimensional array and accessing them using their position information. Depending on a mapping scheme of a multidimensional array onto disk, the sliced of MOLAP operations such as slice and dice varies significantly. [1] proposed a MOLAP cube storage scheme that divides a cube into small chunks with equal side length, compresses sparse chunks, and stores the chunks in row-major order of their chunk indexes. This type of cube storage scheme gives a fair chance to all dimensions of the input data. Here, we developed a variant of their cube storage scheme by placing chunks in a different order. Our scheme accelerates slice and dice operations by aligning chunks to physical disk block boundaries and clustering neighboring chunks. Z-indexing is used for chunk clustering. The efficiency of the proposed scheme is evaluated through experiments. We showed that the proposed scheme is efficient for 3~5 dimensional cubes that are frequently used to analyze business data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.2
• /
• pp.154-173
• /
• 2010

Database outsourcing is unavoidable in the near future. In the scenario of data stream outsourcing, the data owner continuously publishes the latest data and associated authentication information through a service provider. Clients may register queries to the service provider and verify the result's correctness, utilizing the additional authentication information. Research on On-line Stream Analytics (OLSA) is motivated by extending the data cube technology for higher multi-level abstraction on the low-level-abstracted data streams. Existing work on OLSA fails to consider the issue of database outsourcing, while previous work on stream authentication does not support OLSA. To close this gap and solve the problem of OLSA query authentication while outsourcing data streams, we propose MDAHRB and MDAHB, two multi-dimensional authentication approaches. They are based on the general data model for OLSA, the stream cube. First, we improve the data structure of the H-tree, which is used to store the stream cube. Then, we design and implement two authentication schemes based on the improved H-trees, the HRB- and HB-trees, in accordance with the main stream query authentication framework for database outsourcing. Along with a cost models analysis, consistent with state-of-the-art cost metrics, an experimental evaluation is performed on a real data set. It exhibits that both MDAHRB and MDAHB are feasible for authenticating OLSA queries, while MDAHRB is more scalable.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.11
• /
• pp.479-486
• /
• 2014

MapReduce is a programing model used for parallelly processing a large amount of data. To analyze a large amount data, the data cube is widely used, which is an operator that computes group-bys for all possible combinations of given dimension attributes. When the number of dimension attributes is n, the data cube computes $2^n$ group-bys. In this paper, we propose an efficient method for computing data cubes using MapReduce. The proposed method partitions $2^n$ group-bys into $_nC_{{\lceil}n/2{\rceil}}$ batches, and computes those batches in stages using ${\lceil}n/2{\rceil}$ MapReduce jobs. Compared to the existing methods, the proposed method significantly reduces the amount of intermediate data generated by mappers, so that the cost of sorting and transferring those intermediate data is reduced significantly. Consequently, the total processing time for computing a data cube is reduced. Through experiments, we show the efficiency of the proposed method over the existing methods.

• Journal of the Korea Fashion and Costume Design Association
• /
• v.22 no.4
• /
• pp.93-104
• /
• 2020

This paper focuses on the spatial changes that create a three-dimensional or deep feeling on the surface of a scarf centering on the cube shape. Through this, consumers with various tastes were able to satisfy their image presentation. The cube form has simplicity and order and is likely to be used as a formative object. The cube shapes can be expressed in various forms through visual and perceptual spatial changes by presenting various shape changes based on the viewpoint of the two-dimensional silk surface, that is, by changing the eyes' position and orientation. Various visual theorists' discussions about cube-shaped visual changes were discussed. In addition, the three-dimensional spatial illusion caused by the shape and color of Victor Bazaarelli's cube was examined. The cube shape was printed silk surfaces to give a three-dimensional sense of space on a two-dimensional scarf design using the size change, the difference in the length of the line, and the color change. As such, the cube shape has infinite possibilities as a method that can express three-dimensional depth and space on the flat surface of a scarf. Therefore, it is hoped that this study will be applied to various aspects as the basic data for the scarf design that expresses the spatial changes in the form of cubes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.650-653
• /
• 2002

In this paper, a methodology to assess machine tool errors quickly is suggested using a touch probe and a cube array artifact. Parameterized error models derived are expressed of model coefficient vectors and backlash errors to be determined. To determine the unknown model coefficient vectors, a cube array artifact is proposed. Considering CMM measurement data of cube vertex coordinates. error vectors for all axes ate obtained and used to complete the error model. Some simulation results show that the suggested error model can follow the true values within 10$\mu\textrm{m}$. To verify the error model, a circular part with two concentric circles is measured and simulated. The results show that the differences between CMM and OMM radius errors are smaller than 15$\mu\textrm{m}$.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.97-104
• /
• 2015

An 'associative cube', a class of auto-associative memories, is revisited here, in which training data and hidden orthogonal basis functions such as wavelet packets or Fourier kernels, are combined in the weight cube. This weight cube has hidden units in its depth, represented by a three dimensional cubic structure. We develop an unsupervised incremental learning mechanism based upon the adaptive least squares method. Training data are mapped into orthogonal basis vectors in a least-squares sense by updating the weights which minimize an energy function. Therefore, a prescribed orthogonal kernel is incrementally assigned to an incoming data. Next, we show how a decoding procedure finds the closest one with a competitive network in the hidden layer. As noisy test data are applied to an associative cube, the nearest one among the original training data are restored in an optimal sense. The simulation results confirm robustness of associative cubes even if test data are heavily distorted by various types of noise.

• Advances in aircraft and spacecraft science
• /
• v.9 no.3
• /
• pp.195-215
• /
• 2022

The increasing interest in CubeSat platforms ant their capability of enlarging the frontier of possible missions impose technology improvements. Miniaturized electrical propulsion (EP) systems enable new mission for multi-unit CubeSats (6U+). While electric propulsion systems have achieved important level of knowledge at equipment level, the investigation of the mutual impact between EP system and CubeSat technology at system level can provide a decisive improvement for both the technologies. The interaction between CubeSat and EP system should be assessed in terms of electromagnetic emissions (both radiated and conducted), thermal gradients, high electrical power management, surface chemical deposition, and quick and reliable data exchanges. This paper shows how a versatile CubeSat Test Platform (CTP), together with standardized procedures and specialized facilities enable the acquisition fundamental and unprecedented information. Measurements can be taken both by specific ground support equipment placed inside the vacuum facility and by dedicated sensors and subsystems installed on the CTP, providing a completely new set of data never obtained before. CTP is constituted of a 6U primary structure hosting the EP system, representative CubeSat avionics and batteries. For the first test campaign, CTP hosts the ambipolar plasma propulsion system, called Regulus and developed by T4I. After the integration and the functional test in laboratory environment, CTP + Regulus performed a Test campaign in relevant environment in the vacuum chamber at CISAS, University of Padua. This paper is focused on the test campaign description and the main results achieved at different power levels for different duration of the firings.