• 한국도서관정보학회지
• /
• 제33권2호
• /
• pp.235-258
• /
• 2002

최초의 웹 페이지가 인터넷 상에 올려진 1991년 이래, 인터넷 상의 무수한 웹 사이트 정보검색은 전통적 색인작성 방법과는 상이한 새로운 방법을 개발하고 있다. 본고는 새롭게 발전하는 웹 색인작성에 관한 기초연구로서, 그의 기초가 되는 삽입색인을 살펴보고, 웹 사이트의 정보제공을 위해 필수적인 메타 태그와 웹 색인을 위한 그들의 작성방법을 검토하고, 웹 색인작성에 관한 주요사항을 비교적 상세하게 연구검토하였다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제4권1호
• /
• pp.13-17
• /
• 2012

Indexing allows converting raw document collection into easily searchable representation. Web searching by Google or Yahoo provides subsecond response time which is made possible by efficient indexing of web-pages over the entire Web. Indexing process gets challenging when the scale gets bigger. Parallel techniques, such as MapReduce framework can assist in efficient large-scale indexing process. In this paper we propose PDFindexer, system for indexing scientific papers in PDF using MapReduce programming model. Unlike Web search engines, our target domain is scientific papers, which has pre-defined structure, such as title, abstract, sections, references. Our proposed system enables parsing scientific papers in PDF recreating their structure and performing efficient distributed indexing with MapReduce framework in a cluster of nodes. We provide the overview of the system, their components and interactions among them. We discuss some issues related with the design of the system and usage of MapReduce in parsing and indexing of large document collection.

• 인터넷정보학회논문지
• /
• 제3권2호
• /
• pp.1-13
• /
• 2002

최근 인터넷 지리정보시스템에 대한 요구가 증가하면서 효율적인 공간 데이터 검색에 대한 필요성이 커지고 있다. 효율적인 공간 데이터 검색을 위해서는 단계별로 상세 화된 데이터를 검색하는 기법이 요구되며, 이러한 데이터를 효율적으로 처리하는 공간 인덱싱 기법이 필요하다. 본 논문에서는 효율적인 공간 데이터 검색을 위한 단계화 된 지리정보 데이터 검색을 지원하는 공간 인덱싱 기법을 제안한다. 기존의 공간 인덱싱 기법은 단계별 데이터를 검색하는데 비효율적이며, 단계별 데이터를 지원하는 몇 가지 공간 인덱싱 기법도 모든 종류의 단계별 데이터를 지원할 수 없는 문제점을 가진다. 제안된 구조는 모든 종류의 단계별 데이터를 지원하며, 메모리 용량과 검색 시간 모두에서 이전의 공간 인덱싱 기법보다 우수하다.

• 인터넷정보학회논문지
• /
• 제10권6호
• /
• pp.173-189
• /
• 2009

최근 UCC를 중심으로 동영상 데이터에 대해 사람들의 관심이 증가하고 있다. 따라서 동영상 데이터의 내용-기반 검색을 지원하는 효율적인 색인 기법이 요구된다. 그러나 Hybrid Spill-Tree를 제외한 대부분의 색인 기법들은 대용량의 고차원 데이터를 다루는데 비효율적이다. 본 논문에서는 동영상 데이터의 내용-기반 검색을 지원하기 위한 효율적인 고차원 색인 기법을 제안한다. 제안하는 고차원 색인 기법은 기존 Hybrid Spill-Tree을 기반으로 새롭게 제안하는 클러스터링 방법과 시그니쳐를 이용한 데이터 저장 방법을 결합하여 확장된 색인 기법이다. 또한 제안하는 시그니쳐-기반 고차원 색인 기법이 기존 M-Tree 및 Hybrid Spill-Tree에 비해 성능이 우수함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권5호
• /
• pp.1489-1515
• /
• 2022

The number of interconnected real-world devices such as sensors, actuators, and physical devices has increased with the advancement of technology. Due to this advancement, users face difficulties searching for the location of these devices, and the central issue is the findability of Things. In the WoT environment, keyword-based and geospatial searching approaches are used to locate these devices anywhere and on the web interface. A few static methods of indexing and ranking are discussed in the literature, but they are not suitable for finding devices dynamically. The authors have proposed a mechanism for dynamic and efficient searching of the devices in this paper. Indexing and ranking approaches can improve dynamic searching in different ways. The present paper has focused on indexing for improving dynamic searching and has indexed the Things Description in Solr. This paper presents the Things Description according to the model of W3C JSON-LD along with the open-access APIs. Search efficiency can be analyzed with query response timings, and the accuracy of response timings is critical for search results. Therefore, in this paper, the authors have evaluated their approach by analyzing the search query response timings and the accuracy of their search results. This study utilized different indexing approaches such as key-words-based, spatial, and hybrid. Results indicate that response time and accuracy are better with the hybrid approach than with keyword-based and spatial indexing approaches.

• International Journal of Internet, Broadcasting and Communication
• /
• 제15권2호
• /
• pp.22-30
• /
• 2023

The portable mobile devices with high performance and high speed 5G network activate and explode the demands for ubiquitous information services that remove the limitations of time for the communication and places to request for the information. NN (Nearest Neighbor) search is one of the most important types of queries to be processed efficiently in the information services. Various indexes have been proposed to support efficient NN search in the wireless broadcast system. The indexes adopting Hilbert curve, grid partition or Voronoi diagram enable the clients to search for NN quickly in the wireless broadcast channel. It is necessary that an efficient means to evaluate the performances of various indexes. In this paper, we propose an open framework that can adopt a variety of indexing schemes and evaluate and compare the performances of them. The proposed framework is organized with open and flexible structure that can adopt hybrid indexing schemes extensible to Voronoi diagram as well as simple indexing schemes. With the implemented framework, we demonstrate the efficiency and scalability and flexibility of the proposed framework by evaluating various indexing schemes for NN query.

• 한국도서관정보학회지
• /
• 제30권3호
• /
• pp.27-51
• /
• 1999

This paper deals with the methods as well as the problems associated with automatic extraction indexing and assignment indexing, expert systems for indexing, and major approaches currently used to index the Internet resources. It also briefly reviews basic methods for establishing hypertext/hypermedia links automatically. The methods used in much of text processing today are not particularly new. Most of the them were used, perhaps in a more rudimentary form, 30 or more years ago by Luhn and many other investigators. Better results can be achieved today because much greater bodies of electronic text are now avaliable and the power of present-day computers allows the processing of such text with reasonable efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2211-2232
• /
• 2018

The unstructured and semi-structured big data in social network poses new challenges in query retrieval. This requirement needs to be met by introducing quality retrieval time measures like indexing. Due to the huge volume of data storage, there originate the need for efficient index algorithms to promote query processing. However, conventional algorithms fail to index the huge amount of frequently obtained information in real time and fall short of providing scalable indexing service. In this paper, a new LIndex algorithm, which is a heuristic on Lucene is built on Neo4jHA architecture that holds the social network Big data. LIndex is a flexible and simplified adaptive indexing scheme that ascendancy decomposed shortest paths around term neighbors as basic indexing unit. This newfangled index proves to be effectual in query space pruning of graph database Neo4j, scalable in index construction and deployment. A graph query is processed and optimized beyond the traditional Lucene in a time-based manner to a more efficient path method in LIndex. This advanced algorithm significantly reduces query fetch without compromising the quality of results in time. The experiments are conducted to confirm the efficiency of the proposed query retrieval in Neo4j graph NoSQL database.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권3호
• /
• pp.150-170
• /
• 2008

In recent years, main focus of research on image retrieval techniques is on content-based image retrieval. Text-based image retrieval schemes, on the other hand, provide semantic support and efficient retrieval of matching images. In this paper, based on Formal Concept Analysis (FCA), we propose a new image indexing and retrieval technique. The proposed scheme uses keywords and textual annotations and provides semantic support with fast retrieval of images. Retrieval efficiency in this scheme is independent of the number of images in the database and depends only on the number of attributes. This scheme provides dynamic support for addition of new images in the database and can be adopted to find images with any number of matching attributes.

• 한국인터넷방송통신학회논문지
• /
• 제17권3호
• /
• pp.23-28
• /
• 2017

차세대 의료 정보 교환 표준인 FHIR는 빠른 의료정보 교환이 가능할 뿐 아니라 효과적인 다양한 의료서비스가 가능하다. 본 논문은 FHIR 리소스를 보안 채널기반의 무선 데이터 방송에 적용하여 사용자에게 효율적으로 리소스를 전달할 수 있도록 하기 위해 FHIR 리소스 기반의 인덱싱 기법을 제안한다. 제안된 인덱싱 기법은 리소스를 받고자 하는 사용자 정보와 사용자에 대한 FHIR 리소스를 유지하여 대량의 사용자가 빠른 시간에 적은 에너지를 사용하여 원하는 리소스를 다운로드할 수 있도록 한다. 시뮬레이션을 통해 제안된 인덱싱 기법이 다른 기법들 보다 우수한 성능을 보임을 보였다.