• Title/Summary/Keyword: 색인파일

Search Result 112, Processing Time 0.027 seconds

A Study for Parallelizing Sequential Algorithms of Search Engine in Parallel Information Retrieval System (병렬 정보검색 시스템의 순차적인 검색엔진 알고리즘의 병렬화를 위한 연구)

  • Kim, Seok Young;Park, Mi-Young;Park, Hyuk-Ro;Chung, In Sang
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.693-696
    • /
    • 2007
  • 대규모 데이터를 효율적으로 검색하기 위한 병렬 정보검색 시스템에서는 하드웨어 확장으로 인한 병렬화로 시스템 전체의 작업 처리량을 증가시켰다. 그러나 병렬 시스템 상에서 수행되는 검색엔진의 알고리즘들은 여전히 순차적으로 수행되기 때문에, 사용자의 개별적인 질의처리 시간은 단축되지 않는다. 본 연구는 검색엔진의 병렬화를 위하여 사용자 질의처리 과정과 역색인 파일처리 과정의 순차 알고리즘들을 조사하여 병렬화의 필요성과 가능성을 평가한다. 이러한 평가는 병렬 정보검색 시스템에서 수행되는 순차 알고리즘들의 효과적이고 체계적인 병렬화를 도모하고, 보다 효율적인 병렬 정보검색 시스템의 구축을 가능하게 한다.

Index management technique using Small block in storage device based on NAND flash memory

  • Lee, Seung-Woo;Oh, Se-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.10
    • /
    • pp.1-14
    • /
    • 2020
  • In this paper, we propose to solve the problem of increasing system memory usage due to an increase in the number of mapping information management when using a NAND flash memory-based storage device in an existing sector-based file system. The proposed technique is to store only mapping information in page units based on index blocks and manage them in block units. To this end, the proposed technique uses a sequential offset for storing and managing a plurality of mapping information in one page in a small block, and a reverse offset for a spare page corresponding to a change in mapping information in the block. Through this, the proposed technique has the advantage that the number of block-unit deletions is less than that of the existing technique, and the system memory usage required for mapping information management is low. Reduced by about 32%.

An Agent System for Supporting Adaptive Web Surfing (적응형 웹 서핑 지원을 위한 에이전트 시스템)

  • Kook, Hyung-Joon
    • The KIPS Transactions:PartB
    • /
    • v.9B no.4
    • /
    • pp.399-406
    • /
    • 2002
  • The goal of this research has been to develop an adaptive user agent for web surfing. To achieve this goal, the research has concentrated on three issues: collection of user data, construction and improvement of user profile, and adaptation by applying the user profile. The main outcome from the research is a prototype system that provides the functional definition and componential design scheme for an adaptive user agent for the web environment. Internally, the system achieves its operational goal from the cooperation of two independent agents. They are IIA (Interactive Interface Agent) and UPA (User Profiling Agent). As a tool for providing a user-friendly interface environment, the IIA employs the Keyword Index, which is a list of index terms of a webpage as well as a keyword menu for subsequent queries, and the Suggest Link, which is a hierarchical list of URLs showing the past browsing procedure of the user. The UPA reflects in the User Profile, both the static and the dynamic information obtained from the user's browsing behavior. In particular, a user's interests are represented in the form of Interest Vectors which, based on the similarity of the vectors, is subject to update and creation, thus dynamically profiling the user's ever-shifting interests.

A Study of Music Recommendation System in P2P Network using Collaborative Filtering (P2P 환경에서 협업 필터링을 이용한 음악 추천 시스템에 대한 연구)

  • Won, Hee-Jae;Park, Kyu-Sik
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1338-1346
    • /
    • 2008
  • In this paper, we propose a new P2P-based music recommendation system. In comparison with previous system in client-server environment, the proposed system shows higher quality of music recommendation through real-time sharing of music preference information between peers. A collaborative filtering is implemented as a recommendation algorithm. As a user preference profile, we use the inherit KID music genre index contained in all legitimate music file instead of music feature vectors as in previous research so that the proposed system can mitigate the performance degradation and high computational load caused by feature inaccuracy and feature extraction. The performance of the proposed system is evaluated in various ways with real 16-weeks transaction data provided by Korean music portal, 5 company and it shows comparative quality of recommendation with only small amount of computational load.

  • PDF

A Scalable Index for Content-based Retrieval of Large Scale Multimedia Data (대용량 멀티미디어 데이터의 내용 기반 검색을 위한 고확장 지원 색인 기법)

  • Choi, Hyun-HWa;Lee, Mi-Young;Lee, Kyu-Chul
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.726-730
    • /
    • 2009
  • The proliferation of the web and digital photography has drastically increased multimedia data and has resulted in the need of the high quality internet service based on the moving picture like user generated contents(UGC). The keyword-based search on large scale images and video collections is too expensive and requires much manual intervention. Therefore the web search engine may provide the content-based retrieval on the multimedia data for search accuracy and customer satisfaction. In this paper, we propose a novel distributed index structure based on multiple length signature files according to data distribution. In addition, we describe how our scalable index technique can be used to find the nearest neighbors in the cluster environments.

  • PDF

A Study on the Clustering Technique Associated with Statistical Term Relatedness in Information Retrieval (정보검색(情報檢索)에 있어서 용어(用語)의 통계적(統計的) 관련성(關聯性)을 응용(應用)한 클러스터링기법(技法))

  • Jeong, Jun-Min
    • Journal of Information Management
    • /
    • v.18 no.4
    • /
    • pp.98-117
    • /
    • 1985
  • At the present time, the role and importance of information retrieval has greatly increased for two main reasons: the coverage of the searchable collections is now extensive and collection size may exceed several million documents; further more, the search results can now be obtained more or less instantaneously using online procedures and computer terminal devices that provide interaction and communication between system and users. The large collection size make it plausible to the users that relevant information will in fact be retrieved as a result of a search operation, and the probability of obtaining the search output without delay creates a substantial user demand for the retrieval services.

  • PDF

Tempo-oriented music recommendation system based on human activity recognition using accelerometer and gyroscope data (가속도계와 자이로스코프 데이터를 사용한 인간 행동 인식 기반의 템포 지향 음악 추천 시스템)

  • Shin, Seung-Su;Lee, Gi Yong;Kim, Hyoung-Gook
    • The Journal of the Acoustical Society of Korea
    • /
    • v.39 no.4
    • /
    • pp.286-291
    • /
    • 2020
  • In this paper, we propose a system that recommends music through tempo-oriented music classification and sensor-based human activity recognition. The proposed method indexes music files using tempo-oriented music classification and recommends suitable music according to the recognized user's activity. For accurate music classification, a dynamic classification based on a modulation spectrum and a sequence classification based on a Mel-spectrogram are used in combination. In addition, simple accelerometer and gyroscope sensor data of the smartphone are applied to deep spiking neural networks to improve activity recognition performance. Finally, music recommendation is performed through a mapping table considering the relationship between the recognized activity and the indexed music file. The experimental results show that the proposed system is suitable for use in any practical mobile device with a music player.

A Study on the Performance Evaluation of Semantic Retrieval Engines (시맨틱검색엔진의 성능평가에 관한 연구)

  • Noh, Young-Hee
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.22 no.2
    • /
    • pp.141-160
    • /
    • 2011
  • This study suggested knowledge base and search engine for the libraries that have the largescaled data. For this purpose, 3 components of knowledge bases(triple ontology, concept-based knowledge base, inverted file) were constructed and 3 search engines(search engine JENA for rule-based reasoning, Concept-based search engine, keyword-based Lucene retrieval engine) were implemented to measure their performance. As a result, concept-based retrieval engine showed the best performance, followed by ontology-based Jena retrieval engine, and then by a normal keyword search engine.

Digital License Searching for Copyright Management of Software Source Code (소프트웨어 소스 코드의 저작권 관리를 위한 디지털 라이센스의 검색)

  • Cha, Byung-Rae
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.1
    • /
    • pp.21-31
    • /
    • 2007
  • The intellectual property system was very important to the past industrial society. It is so important to the 21C information age. It is a leading role to developing these information society. Not only the digital content control but the technology of software source code for the intellectual property is so much mean to international competition. On occurring disputation property, we have to prove the fact, there is a problem to discriminate the original source code. In this paper, we make a study of the digital licence prototype for discriminate the original source code. Reserved words of software source code by parsing express to XML file that have hierarchical structure. Then, we can express architecture of software source code by tree structure form instead of complex source code. And we make a study of the indexing and searching to search digital license.

An Object-based Data Modeling on P2P Environments (P2P 환경에서의 객체 기반의 데이터 모델링)

  • Rho, Jae-Gum;Gu, Tae-Wan;Lee, Sung-Ryong;Jung, Yeon-Jin;Lee, Kwang-Mo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11b
    • /
    • pp.959-962
    • /
    • 2003
  • P2P(Peer to Peer)개념으로는 순수 P2P와 변형 P2P 구조가 있다. 순수 P2P 구조는 정보공유에서 연결성을 장점으로 하는 Gnutella의 형태를 응용한 형태가 많이 사용되고 있지만 정보의 검색 및 제공에 있어 수많은 트래픽이 발생하게 된다. 이와 달리 변형 P2P 구조들 중 서버의 역할을 최소화한 인덱스 서버 모델이 존재하는데 이 모델은 사용자에게 효율적이고 빠른 검색과 색인을 제공하기 위해 기존의 서버/클라이언트 형태를 취하고 있다. 본 논문에서는 질의 기법의 보편적인 방법인 JDBC(Java Database Connectivity)를 이용한 직접적인 질의 방법이 아닌 객체 지향 프로그래밍 환경에서 효율적인 질의 방법인 JDO(Java Data Object)를 이용하여 객체 기반의 데이터 모델링을 제안하며 이를 이용하여 인덱스 서버 개념을 적용한 파일 공유 시스템(File Sharing System Using Data Modeling based on Object:FSUDMO)을 제안한다.

  • PDF