• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.426-429
• /
• 1999

Many similar class components are stored in object-storage but the object-storage has needed the retrieval function of correct component for reuse. Accordingly this paper designed the class component retrieval viewer of the object-storage by using the improved spreading activation strategy. Object-storage has made up of information of inheritance relation, superclass, subclass, and we defined the queries about each class function. Also we specified connectionist relaxation of the each class and query, finally we gained retrieval result which showed highest activation value order of class component information including the query function.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.763-765
• /
• 2005

In the area of remote sensing, an immense number of images are continuously generated by various remote sensing systems. These images must then be managed by a database system efficient storage and retrieval. There are many types of image database systems, among which the content-based image retrieval (CBIR) system is the most advanced. CBIR utilizes the metadata of images including the feature data for indexing and searching images. Therefore, the performance of image retrieval is significantly affected by the storage method of the image metadata. There are many features of images such as color, texture, and shape. We mainly consider the shape feature because shape can be identified in any remote sensing while color does not always necessarily appear in some remote sensing. In this paper, we propose a metadata representation and storage method for image search based on shape features. First, we extend MPEG-7 to describe the shape features which are not defined in the MPEG-7 standard. Second, we design a storage schema for storing images and their metadata in a relational database system. Then, we propose an efficient storage method for managing the shape feature data using a Wavelet technique. Finally, we provide the performance results of our proposed storage method.

• International Journal of Computer Science & Network Security
• /
• 제24권7호
• /
• pp.31-44
• /
• 2024

The inverted index is combination of the keywords and posting lists associated for indexing of document. In modern age excessive use of technology has increased data volume at a very high rate. Big data is great concern of researchers. An efficient Document indexing in big data has become a major challenge for researchers. All organizations and web engines have limited number of resources such as space and storage which is very crucial in term of data management of information retrieval system. Information retrieval system need to very efficient. Inverted indexing technique is introduced in this research to minimize the delay in retrieval of data in information retrieval system. Inverted index is illustrated and then its issues are discussed and resolve by implementing the scalable inverted index. Then existing algorithm of inverted compared with the naïve inverted index. The Interval list of inverted indexes stores on primary storage except of auxiliary memory. In this research an efficient architecture of information retrieval system is proposed particularly for unstructured data which don't have a predefined structure format and data volume.

• Industrial Engineering and Management Systems
• /
• 제4권2호
• /
• pp.136-144
• /
• 2005

This research deals with an order picking problem in automated storage and retrieval systems (AS/RS). When retrieval requests consist of multiple items and the items are in multiple stock locations, the storage/retrieval (S/R) machine must travel to numerous storage locations to complete each order. The aim of this research is to propose algorithms for the resolution of order picking problems with multiple stock locations to minimize the total time traveled by the S/R machine. We present and compare three alternatives for solving the problem based on enumeration, ordinary heuristic and genetic algorithms. We used a set of 180 different problems that are solved by these three algorithms. The results show that our proposed genetic algorithm is more efficient than the other two.

• 산업경영시스템학회지
• /
• 제28권4호
• /
• pp.134-141
• /
• 2005

Due to the complexity and stochastic nature of automated warehousing system, items are usually queued up at I/O point. We introduce a storage/retrieval policy : dual-command. We present quick approximations to queueing phenomena under these policies. It is assumed that the storage and retrieval arrival pattern follow the same poisson process. We also assumed that storage queue and retrieval queue being operated separately. The approximation attempts are performed under the proposed storage/retrieval policies after we derive S/R machine travel time distributions.

• 전자공학회논문지B
• /
• 제32B권11호
• /
• pp.1365-1373
• /
• 1995

In this paper, we address the issues related to storage and retrieval of continuous media (CM)data we face in designing multimedia on-demand (MOD) storage servers. To support the two orthogonal factors of MOD server design, i.e., storage and retrieval of CM data, this paper discusses the techniques of disk layout, disk striping and real-time disk scheduling, which are integrated as a combined solution to the high- performance MOD storage subsystem. The proposed clustered striping technique enables either a multiple-disk or a parallel system to guarantee a continuous retrieval of CM data at the bandwidth required to support user playback rate by avoiding the formation of I/O bottlenecks.

• 한국비블리아학회지
• /
• 제5권1호
• /
• pp.85-105
• /
• 1981

Information is an essential factor leading the rapid progress which is one of the distinguished characteristics in modem society. As more information is required and as more is supplied by individuals, governmental units, businesses, and educational institutions, the greater will be the requirement for efficient methods of communication. One possibility for improving the information dissemination process is to use computers. The capabilities of such machine are beginning to be used in the process of Information storage, retrieval and dissemination. An important problems, that must be carefully examined is whether one technique for information retrieval is better for worse than another. This paper examines problem of how to evaluate an information retrieval system. One specific approach is a cost accounting model for use in studying how to minimize the cost of operating a mechanized retrieval system. Through the use of cost analysis, the model provides a method for comparative evaluation between systems. The general cost accounting model of the literature retrieval system being designed by this study are given below. 1. The total cost accounting model of the literature retrieval system. The total cost of the literature retrieval system = (the cost per unit of user time X the amount of user time) + ( the cost per unit of system time X the amount of system time) 2. System cost accounting model system cost = (the pre-search system cost per unit of time X time) + (the search system cost per unit of time X time) + (the post search system cost per unit of time X time) 1) Pre-search system cost per unit of time = cost of channel per unit time + cost of central processing unit per unit time + cost of storage per unit time 2) Search system cost per unit of time = comparison cost + document representation cost. 3) Post-search system cost per unit of time. = cost of channel per unit time + cost of central processing unit per unit time + cost of storage per unit time 3. User cost accounting model Total user cost = [pre-search user cost per unit of time X (time + additional time) ] + [search user cost per unit of time X (time + additional time) ] + [post-search user cost per unit of time X (time + additional time) ].

• Journal of information and communication convergence engineering
• /
• 제9권3호
• /
• pp.282-286
• /
• 2011

Recently, a name retrieval function is widely used on navigation systems. In this paper, we propose the new dynamic hashing algorithm for a name retrieval function on it. The proposed dynamic hashing algorithm by constructing an index using the variance information of character is the better than existing methods in terms of storage capacity and retrieval speed. The algorithm proposed in this paper can be useful on systems that have limited resources as well as navigation systems.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제21권1호
• /
• pp.58-63
• /
• 2015

본 논문은 높은 데이터 상환율 및 저장된 데이터의 프라이버시를 보장함과 동시에 데이터 전송시간을 최소화하는 클라우드 스토리지와 P2P 스토리지를 결합한 파운틴 코드 기반의 하이브리드 P2P 클라우드 스토리지 시스템을 제안한다. 사용자는 저장 공간의 효율성 및 자신의 데이터 프라이버시를 보장하기 위해 저장하고자 하는 데이터에 대해 파운틴 코드 기반의 인코딩을 시행한 후 인코딩 된 데이터를 분할하여 전송한다. 또한, 제안하는 알고리즘은 각 피어의 생존 확률을 고려하여 데이터를 저장함으로써 사용자의 데이터 상환을 보장한다. 실험 결과는 제안한 알고리즘이 다양한 시스템 안정도에서 사용자의 전송시간을 줄일 수 있음을 보인다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제8권4호
• /
• pp.376-388
• /
• 2002

최근 멀티미디어 객체를 다루는 연구는 국내외적으로 활발하게 진행되고 있으나, 이러한 멀티미디어 객체들을 효율적으로 저장 및 검색하기 위한 하부저장 시스템에 대한 연구는 미흡한 실정이다. 본 연구에서는 이러한 대용량 멀티미디어 객체들을 효율적으로 저장 및 검색하기 위한 객체 저장 엔진을 구현한다. 이를 위해, 비정형 멀티미디어 객체의 저장을 위한 객체 관리자와, 비정형 텍스트 객체의 색인을 위한 역화일 관리자를 설계한다. 아울러, 설계된 객체 관리자와 역화일 관리자를 기존의 하부저장 구조인 SHORE 저장시스템에 통합하여 DBMS 측면에서 제공하는 동시성 제어, 회복기법 등을 지원할 수 있는 객체 저장 엔진을 구현한다. 마지막으로, 구현된 객체저장엔진의 유용성을 검증하기 위해 논문검색시스템 TIROS(Thesis Information Retrieval system using Object Storage engine)를 구축한다.