• ETRI Journal
• /
• v.22 no.2
• /
• pp.32-42
• /
• 2000

The existing multi-dimensional index structures are not adequate for indexing higher-dimensional data sets. Although conceptually they can be extended to higher dimensionalities, they usually require time and space that grow exponentially with the dimensionality. In this paper, we analyze the existing index structures and derive some requirements of an index structure for content-based image retrieval. We also propose a new structure, for indexing large amount of point data in a high-dimensional space that satisfies the requirements. in order to justify the performance of the proposed structure, we compare the proposed structure with the existing index structures in various environments. We show, through experiments, that our proposed structure outperforms the existing structures in terms of retrieval time and storage overhead.

• East Asian Economic Review
• /
• v.18 no.4
• /
• pp.367-394
• /
• 2014

In this study, we examined the fractal structure of the Nikkei225, HangSeng, Shanghai Stock Exchange and Straits Times Index of Singapore. Empirical analysis was performed via non-parametric, semi-parametric long memory tests and also fractal dimension calculations. In order to avoid spurious long memory features, besides the Detrended Fluctuations Analysis (DFA), we also used Smith's (2005) modified GPH method. As for fractal dimension calculations, they were conducted via Box-Counting and Variation (p=1) tests. According to the results, while there is no long memory property in log returns of any index, we found evidence for long memory properties in the volatility of the HangSeng, the Shanghai Stock Exchange and the Straits Times Index. However, we could not find any sign of long memory in the volatility of Nikkei225 index using either the DFA or modified GPH test. Fractal dimension analysis also demonstrated that all raw index prices have fractal structure properties except for the Nikkei225 index. These findings showed that the Nikkei225 index has the most efficient market properties among these markets.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.328-342
• /
• 2007

We propose a new cache conscious indexing structure for processing frequently updated data efficiently. Our proposed index structure is based on a KDB-Tree, one of the representative index structures based on space partitioning techniques. In this paper, we propose a data compression technique and a pointer elimination technique to increase the utilization of a cache line. To show our proposed index structure's superiority, we compare our index structure with variants of the CR-tree(e.g. the FF CR-tree and the SE CR-tree) in a variety of environments. As a result, our experimental results show that the proposed index structure achieves about 85%, 97%, and 86% performance improvements over the existing index structures in terms of insertion, update and cache-utilization, respectively.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.675-683
• /
• 2004

In main-memory resident index structures, secondary cache misses considerably have an effect on the performance of index structures. Recently, several main-memory resident index structures that consider cache have been proposed to reduce the impact of secondary cache misses. However they still suffer from full secondary cache misses whenever visiting each level of a index tree. In this paper, we propose a new index structure that eliminates cache misses even when visiting each level of index tree. The proposed index structure prefetches the grandchildren of a current node. The basic structure of the proposed index structure is from CSB+-tree that uses the concepts of the node group to increase fan-out. However the insert algorithm of the proposed index structure reduces the cost of a split significantly. Also, we show the superiority of our algorithm through various performance evaluation.

• Journal of the Korean Society of Industry Convergence
• /
• v.6 no.4
• /
• pp.315-324
• /
• 2003

The purpose of this is to evaluate Hakui Stream Naturalness Index(S.N.I). and to find out stats, problems and opportunities of the Hakui stream by assessment standard. Assessment standard is mainly based on physical structure of stream environment. The purpose evaluating sectors and elements are physical form and structure restoration of stream. To find out assessment standard of stream naturalness index, conceptual frame of assessment standard has been established, for which four sections, for example, longitudinal section, lateral section, stream bottom structure and water environment, have been selected. Overall stream naturalness index of the Hakui stream has been distributed at 3rd to 4th grade, and its assessment index accounted for 3.2 to be 3rd grade, and its mode also did 3rd grade. Stream naturalness index of each section was as follows: Longitudinal section index accounted for 3.6 in average to be 4th grade, and later section index did 3.0 to be 3rd grade, and stream bottom structure index did 3.0 to be 3rd grade, and water environment index did 2.7 to be 3rd grade. Analysis of assessment outcome of stream naturalness index has checked status, Problems and opportunities of corresponding stream. Assessment of stream naturalness index of the study provides useful information for restoration of close-to-nature stream, and furthermore has its meaning in checking problems and opportunities of Hakui stream.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.141-152
• /
• 2004

In this paper, we propose the index structure supporting the future position retrievals with efficiently updating continuous positions of moving objects in location based services. For reducing update costs of moving objects, our index structure directly accesses to the leaf node with moving objects using secondary index structure and performs bottom up update when node information is changed. Positions of moving objects are stored in primary index structure. In primary index structure, the split information similar to kd-tree is stored to internal node for increasing node's fanout. And the proposed index structure supports the future position retrievals using velocity of moving objects in the child node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.624-640
• /
• 2004

Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

• Journal of the Korean Society for information Management
• /
• v.20 no.3
• /
• pp.277-297
• /
• 2003

This study was conducted upon the premise that index terms display the intellectual structure of a specific subject field. In this study, and attempt was made to grasp the intellectual structure of Library and Information. Science by clustering the index terms of the journals of the related academic societies at the Library of National Assembly - such as the Journal of the Korean Society for Information Management, the Journal of the Korean Library and Information Science Society, and the Journal of the Korean Society for Library and Information Science. Through the course of the study, index term clusters were generated based on the linkage of the index terms and the frequency of co-occurrence, and moreover, time periods analysis was conducted along with studies on first-appearing terms, in order to clarify the trend and development process of the Library and Information Science. This study also analysed the difference between two intellectual structure by comparing the structure generated by index term clusters with the existing structure of traditional classification systems.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.48-60
• /
• 2004

XML documents consist of elements that are basic units of information. When the structure of XML documents is changed dynamically, we need to update structure information efficiently without changing the information of the index structure for fast retrieval. In this paper, we propose a dynamic indexing model scheme that updates the index structure in real time as the structure of XML documents is changed by insertion and deletion of elements. Our dynamic indexing model consists of a structure information representation method and a dynamic index structure. The structure information representation method supports various types of structure retrievals. Our dynamic index structure processes various structural queries efficiently. We show through various experiments that our method outperforms existing ones in processing various types of queries such as content based queries, structural queries and hybrid queries.