• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.315-325
• /
• 1999

Indexing techniques for distributed resources have much effect on an information service system based on distributed environment like digital library. There is a centralized indexing technique, a distributed technique, and a mixed technique for distributed indexing techniques. In this paper, we propose new distributed indexing technique using EIF(extended Inverted File) structure that mix the centralized technique and t도 distributed technique. And we propose management techniques using EIF structure and retrieval technique using EIF structure. This distributed indexing technique proposed is able to fast process retrieval request and reduce network overload and select servers relevant to query terms. This paper investigated performance of a proposed distributed indexing technique.

• 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 Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.10-14
• /
• 2006

To effectively manage a very large amount of music data, we need an indexing technique based on audio features. But the indexing techniques for audiofeatures have not been studied completely. In this paper, we describe a content-based music information retrieval technique for audio features using the TIP-indexing file. In addition, we develop and experiment the TIP-indexing files using various blocking factors to present performance comparisons for effective indexing. Experimental results show the effectiveness of the proposed techniques.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.87-96
• /
• 2021

The demand for e-learning through video lectures is rapidly increasing due to its diverse advantages over the traditional learning methods. This led to massive volumes of web-based lecture videos. Indexing and retrieval of a lecture video or a lecture video topic has thus proved to be an exceptionally challenging problem. Many techniques listed by literature were either visual or audio based, but not both. Since the effects of both the visual and audio components are equally important for the content-based indexing and retrieval, the current work is focused on both these components. A framework for automatic topic-based indexing and search depending on the innate content of the lecture videos is presented. The text from the slides is extracted using the proposed Merged Bounding Box (MBB) text detector. The audio component text extraction is done using Google Speech Recognition (GSR) technology. This hybrid approach generates the indexing keywords from the merged transcripts of both the video and audio component extractors. The search within the indexed documents is optimized based on the Naïve Bayes (NB) Classification and K-Means Clustering models. This optimized search retrieves results by searching only the relevant document cluster in the predefined categories and not the whole lecture video corpus. The work is carried out on the dataset generated by assigning categories to the lecture video transcripts gathered from e-learning portals. The performance of search is assessed based on the accuracy and time taken. Further the improved accuracy of the proposed indexing technique is compared with the accepted chain indexing technique.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1916-1920
• /
• 2003

By development of dissolvable technique and equipment for warhead, empty cartridge and ammunition in small caliver, pollution of environment and waste of resources problems brought by existing incinerative abrogation can be fundamentally prevented. In addition, Automatic high-speed mechanically dissolving technique using indexing equipment developed in this study makes possible curtailment of manpower and recycling treatment of recources.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.307-312
• /
• 2007

Wireless Sensor Network(WSN) is considered as a core technology necessary for Ubiquitous computing, with its numerous possible applications in many practical areas, is being researched and studied actively by many around the world. WSN utilizes wireless sensors spatially placed to gather information regarding temperature, light condition, motion and change in speed of the objects within their surrounding environment. This paper implements an environmental information monitoring and indexing system based on spatial indexing technique by constructing a WSN system. This Multi-Query Indexing Technique coupled with wireless sensors provides an output based on the pre-defined built-in data index and new input from the sensors. If environment data is occured, system have to perform a proper action after collecting and analyzing this data. This is the purpose of implementing environment data monitoring system. We constructed environmental application using TinyOS and built tested with MICAz sensor bords. We designed and implemented a monitoring system which detects and multi-indexing process environmental data from distributed sensors.

• Journal of the Korean association of regional geographers
• /
• v.3 no.2
• /
• pp.105-120
• /
• 1997

One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.655-671
• /
• 1996

Using object relationship table, this study proposes an efficient indexing technique for accessing both aggregation and inheritance hierarchies in object- oriented databases. This indexing technique uses the information on the aggregation and inheritance relationship between classes and the information on referencing instances as meta data. As a result, the technique makes it possible to effectively evaluates various queries navigating between tables. The study compares the proposed technique with the existing indexing techniques and discusses its useful- ness. It also provides the result of simulating its performance in terms of storage and retrieval cost.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1093-1105
• /
• 2007

This paper presents a multidimensional type inheritance indexing technique (MD-TIX) for XML databases. We use a multidimensional file organization as the index structure. In conventional XML database indexing techniques using one-dimensional index structures, they do not efficiently handle complex queries involving both nested elements and type inheritance hierarchies. We extend a two-dimensional type hierarchy indexing technique(2D-THI) for indexing the nested elements of XML databases. 2D-THI is an indexing scheme that deals with the problem of clustering elements in a two-dimensional domain space consisting of the key value domain and the type identifier domain for indexing a simple element in a type hierarchy. In our extended scheme, we handle the clustering of the index entries in a multidimensional domain space consisting of a key value domain and multiple type identifier domains that include one type identifier domain per type hierarchy on a path expression. This scheme efficiently supports queries that involve search conditions on the nested element represented by an extended path expression. An extended path expression is a path expression in which every type hierarchy on a path can be substituted by an individual type or a subtype hierarchy.