• The KIPS Transactions:PartD
• /
• v.19D no.4
• /
• pp.271-280
• /
• 2012

Currently, contents generated by SNS services are increasing exponentially, as the number of SNS users increase. The SNS is commonly used to post personal status and individual interests. Also, the SNS is applied in socialization, entertainment, product marketing, news sharing, and single person journalism. As SNS services became available on smart phones, the users of SNS services can generate and spread the social issues and controversies faster than the traditional media. The existing indexing methods for web contents have limitation in terms of real-time indexing for SNS contents, as they usually focus on diversity and accuracy of indexing. To overcome this problem, there are real-time indexing techniques based on RDBMSs. However, these techniques suffer from complex indexing procedures and reduced indexing targets. In this regard, we introduce the TK-Indexing method to improve the previous indexing techniques. Our method indexes the generation time of SNS contents and keywords by way of NoSQL to indexing SNS contents in real-time.

• Journal of the Korean Society for information Management
• /
• v.10 no.1
• /
• pp.97-124
• /
• 1993

This study was undertaken in order to develop practical automatic indexing techniques suitable for Korean natural language texts. It has taken a modest step toward this goal by developing an automatic syntactico-statistical indexing method and evaluating the method by comparing the resutls with manual indexing. For this experimental study, the Korean text database was constructed manually based on 300 abstracts covering business subject. The experimental results showed that the performance of the automatic syntactico-statistical indexing system was comparable to that of other studies which have compared automatic indexing with manual indexing.

• Journal of Korea Multimedia Society
• /
• v.14 no.8
• /
• pp.1050-1060
• /
• 2011

With increasing need for indexing of persons in a large video database, automatic indexing has been attracting great interest which takes advantage of automatic tagging instead of the time-consuming and costly manual tagging. However, automatic indexing approach should provide a degree of recognition proximity because it cannot identify the persons with accuracy of 100%. In this paper, we propose an efficient storage method for storing posting lists efficiently and a novel ranking technique of ordering relevant videos for efficient retrieval. Through experiment evaluations we have shown that our storage method exhibits good performance in compressing the posting list. We have also shown that the proposed ranking method is effective for finding relevant videos.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1570-1578
• /
• 2000

Object motion is an important feature of content in video sequences. By now, various methods to exact feature about the object motion have been reported[1,2]. However they are not suitable to index video using the motion, since a lot of bits and complex indexing parameters are needed for the indexing [3,4] In this paper, we propose object motion map which could provide efficient indexing method for object motion. The proposed object motion map has both global and local motion information during an object is moving. Furthermore, it requires small bit of memory for the indexing. to evaluate performance of proposed indexing technique, experiments are performed with video database consisting of MPEG-1 video sequence in MPEG-7 test set.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.7
• /
• pp.1840-1867
• /
• 2024

In this study, we focus on addressing the functional domain of research related to indexing XML data in wireless networks, emphasizing ensuring data confidentiality. The abstract outlines a novel indexing method designed for broadcasting encrypted XML data over wireless networks. The proposed technique involves two channels: one for indexing and another for transmitting the actual XML data. The method ensures data security by encrypting the XML stream, allowing mobile devices to access only authorized bits based on their access permissions. Despite an increase in data access time and device tuning time, the study concludes that the proposed indexing technique significantly enhances the security of transmitting XML data over mobile wireless networks.

• Journal of the Korean Society for information Management
• /
• v.13 no.1
• /
• pp.47-63
• /
• 1996

Conventional automatic indexing methods for Hangul texts can be classified into two groups as follows: One is to extract index terms by removing non-indexable segments from word-phrases, and the other is to generate index terms from the morphemes of word-phrases. The former suffers from the problem of word boundaries when documents contain many compound nouns. The latter can overcome the word boundary problem by extracting simple nouns, but has many overheads to develop a lot of linguistic knowledges needed in the indexing procedure. In this paper we propose a new indexing method based on n-grams. This method alleviates the problems of previous indexing methods related with word boundaries and linguistic knowledges. We also compare the effectiveness of the n-gram based indexing method with that of the previous ones.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.521-531
• /
• 2003

Multi-level geographic data can be mainpulated by a window query such as a zoom operation. In order to handle multi-level geographic data efficiently, a spatial indexing method supporting a window query is needed. However, the conventional spatial indexing methods are not efficient to access multi-level geographic data quickly. To solve it, other a few spatial indexing methods for multi-level geographic data are known. However these methods do not support all types of multi-level geographic data. This paper presents a new efficient spatial indexing method, the MLR-tree for window query of multi-level geographic data. The MLR-tree offers both high search performance and no data redundancy. Experiments show them. Moreover, the MLR-tree supports all types of multi-level geographic data.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.691-693
• /
• 2007

Existing methods to process continuous range queries are not scalable. In particular, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We propose a novel query indexing method called the projected attribute bit (PAB)-based query index. We project a two-dimensional continuous range query on each axis to get two one-dimensional bit lists. Since the queries are transformed to bit lists and query evaluation is performed by bit operations, the storage cost of indexing and query evaluation time are reduced significantly. Through various experiments, we show that our method outperforms the containment-encoded squares-based indexing method, which is one of the most recently proposed methods.

• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.1-13
• /
• 2002

Recently, Internet GIS(Geographic Information System) is increasing. From the results, more efficient spatial data retrieval is needed. For more efficient retrieval, a spatial indexing method is needed. This paper proposes an efficient spatial indexing method for levelized geometric data retrieval. Previous indexing methods are not adequate to retrieve levelized geometric data. For the effects, a few indexing methods for levelized geometric data, are known. But these methods support only a tew kinds of levelized geometric data. The proposed method supports all kind of levelized geometric data and outperforms to the previous method both in retrieval time and memory capacity.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.23-32
• /
• 2006

In this paper, we propose indexing method to manage large amount of XML documents efficiently, using the range of node and Pre-Oder List. The most of XML indexing methods are based on path or numbering method. However, the method of path-based indexing method shows disadvantages of performance degradation for join operations of ancestor-descendent relationships, and searching for middle and lower nodes. The method of numbers-scheme based indexing has to number all nodes of XML documents, since search overhead increased and the disk space for indexes was wasted. Therefore, in this paper, we propose a novel indexing method using node ranges and Preorder-Lists to overcome these problems. The proposed method more efficiently stores similar structured XML documents. In addition, our method supports flexible insertion and deletion of XML documents.