• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.325-330
• /
• 2000

Recent progress on computer and related technology, especially including communication network, multimedia information processing and communication service technology. accelerates the entrance of information society. Especially, WWW brought the information crisis in its demand and size on the communication network, by making it easy to develop information service, like electronic (internet) news, electronic conference, multimedia information retrieval, and so on, on the internet. Due to this change, DBMS should provide efficient ways to store andmanage various types of Multimedia data and to model complex information structures. In order to satisfy these requirements, there have been man researches on architecture of multimedia DBMS, content-based retrieval for multimedia information, tertiary storage system for huge multimedia data, multimedia information modeling,

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.244-246
• /
• 2003

We consider an AS/RS(Automated Storage/ Retrieval System) which performs single and dual commands. In this paper, we also assume that the service times of single and dual commands are differently distributed. We transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of a AS/RS, and obtain approximated means of queue lengths and sojourn times.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.1
• /
• pp.49-58
• /
• 2011

Recently, GIS(Geographic Information System) has been developed to personalized service for providing the specialized services that is aimed to personal user based on mobile communication. The existing GIS system provides comprehensive and simple information but GIS System for personalized service must provide the adjustive information through the personal interest profile based on POI(PoInt of Interest). This paper describes the intelligent retrieval geographical information service module for providing personal oriented geographic information service. Our proposal model consists of user preference profile, acquisition of POI through hybrid network (Wireless LAN, CDMA), service platform and implementation of prototype system. Implementation model can apply to the life information service like restaurant, oil station, convenient store and etc.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.127-133
• /
• 2009

To ensure access to rapidly growing video collection, video indexing is becoming more and more essential. A database for video should be build for fast searching and extracting the accurate features of video information with more complex characteristics. Moreover, video indexing structure supports efficient retrieval of interesting contents to reflect user preferences. In this paper, we propose semantic video retrieval method based on user preference. Unlikely the previous methods do not consider user preferences. Futhermore, the conventional methods show the result as simple text matching for the user's query that does not supports the semantic search. To overcome these limitations, we develop a method for user preference analysis and present a method of video ontology construction for semantic retrieval. The simulation results show that the proposed algorithm performs better than previous methods in terms of semantic video retrieval based on user preferences.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.333-336
• /
• 2006

HERMES(tHE Retrieval framework for visual MEdia Service)는 웹 상에 존재하는 그림, 영상 등 시각미디어 검색을 위한 시스템이다. 복수의 서비스 제공자와 하나의 서비스 중계자가 있는 분산 환경에서, 사용자의 질의가 왔을 때 서비스 중계자는 적절한 서비스 제공자를 효율적으로 찾는 것이 매우 중요하다. 그래서 다양한 서비스 제공자가 존재하는 분산환경에서 서비스 제공자들간의 랭킹은 매우 중요하다. 본 논문에서는 온톨로지를 사용하여 서비스 제공자들을 랭킹하는 방법을 제안하고 기존의 서비스 제공자 랭킹과 비교하여 본 논문에서 제안한 방법이 더욱 우수함을 보인다.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.4
• /
• pp.443-452
• /
• 2004

In this paper, suggests voice newspaper retrieval system in which newspaper companies classify the news fields into politics, society, economy, IT, international issue, culture, life, information and etc title by title and summarize them to provide wire or wireless newsretrieval service on the phone through design and realization of voice interface by using VoiceXML associated technology useful to design an application that makes it possible to communicate with computer like communicate with person without mouse or keyboard used, so that busy or blind people can receive news service more easily.

• International Journal of Contents
• /
• v.11 no.4
• /
• pp.1-6
• /
• 2015

In practice, the most important performance parameters for music information retrieval (MIR) service are robustness of fingerprint in real noise environments and recognition accuracy when the obtained query clips are matched with the an entry in the database. To satisfy these conditions, we proposed a conjoined fingerprint algorithm for use in massive MIR service. The conjoined fingerprint scheme uses interhash and intrahash algorithms to produce a robust fingerprint scheme in real noise environments. Because the interhash and intrahash algorithms are masked in the predominant pitch estimation, a compact fingerprint can be produced through their relationship. Experimental performance comparison results showed that our algorithms were superior to existing algorithms, i.e., the sub-mask and Philips algorithms, in real noise environments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.26-30
• /
• 2004

We consider an AS/RS(Automated Storage/ Retrieval System) which performs both of single and dual commands. The service times of single and dual commands are assumed to be differently distributed. Steady-state probabilities at the service completion epochs are calculated. Then, we transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of an AS/RS, and obtain approximated means of queue lengths and waiting times.

• Journal of the Korean Society for Library and Information Science
• /
• v.33 no.1
• /
• pp.23-48
• /
• 1999

The purposes of this study were to define the current status of information infrastructures and electronic information retrieval systems in university libraries in Korea, to assess the impact of information technology on library collection development in Korea universities, and to determine the relationship between electronic information retrieval service and library collection development. Data was collected by a mail survey. Questionnaires were mail in December, 1997 to all 134 4-year university libraries. Approximately 78 percent of the questionnaires was returned. The data taken from the survey instruments were analyzed with the analysis of variance(ANOVA) test of SAS program.