• Title/Summary/Keyword: Keyword 검색

Search Result 594, Processing Time 0.03 seconds

Query Optimization for an Advanced Keyword Search on Relational Data Stream (관계형 데이터 스트림에서 고급 키워드 검색을 위한 질의 최적화)

  • Joo, Jin-Ung;Kim, Hak-Soo;Hwang, Jin-Ho;Son, Jin-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.6
    • /
    • pp.859-870
    • /
    • 2009
  • Despite the surge in the research for keyword search method over relational database, only little attention has been devoted to studying on relational data stream.The research for keyword search over relational data stream is intense interest because streaming data is recently a major research topic of growing interest in the data management. In this regard we first analyze the researches related to keyword search methodover relational data stream, and then this paper focuses on the method of minimizing the join cost occurred while processing keyword search queries. As a result, we propose an advanced keyword search method that can yield more meaningful results for users on relational data streams. We also propose a query optimization method using layered-clustering for efficient query processing.

A Study on Application Method of Ontologies for Efficient Semantic-based Search of Copyrighted Works (저작물의 의미 기반 검색을 위한 온톨로지 적용 방안 연구)

  • Yoo, Min-Kyu;Kim, Yoon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.19-28
    • /
    • 2015
  • Korea Digital Copyright Exchange of Korea Copyright Commission runs and manages copyrighted works and copyright license agreement, as well as assigns Integrated Copyright Number(ICN) to copyrighted works, also offers copyrighted works searching service. Keyword-based searching method based on ICN metadata provides results depending on the inclusion of metadata keyword. However, keyword-based searching method has limitations that cannot provide exact results that users need. Therefore, the essential method of offering exact result is needed. In this paper, we propose the semantic-based searching method about copyrighted works to increase the accuracy of searching results by extending ICN matadata to ontology, and implement the ontology of copyrighted works by defining relation and semantics about metadata elements. In order to compare semantic-based searching based on the ontology of copyrighted works with keyword-based searching method, the search results of each method according to 5 scenarios are presented and the accuracy of each method is compared.

An Efficient Index Structure for Semantic-based XML Keyword Search (의미 기반의 XML키워드 검색을 위한 효율적인 인덱스 구조)

  • Lee, Hyung-Dong;Kim, Sung-Jin;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.33 no.5
    • /
    • pp.513-525
    • /
    • 2006
  • Search results of XML keyword search are defined generally as the most specific elements containing all query keywords in the literature. The labels of XML elements and semantic information such as ontology, conceptual model, thesaurus, and so on, are used to improve the preciseness of the search results. This paper presents a hierarchical index for an efficient XML keyword query processing on the condition that returnable search concepts are defined and users' query concepts can be interpreted with the help of the semantic information. The hierarchical index separately stores the XML elements containing a keyword on the basis of the hierarchical relations of the concepts that the XML elements belong to, and makes it possible to obtain least common ancestors, which are candidates for the search results, with selectively reading the elements belonging to the concepts relevant to query concepts and without considering all the combinations of the elements having been read. This paper deals with how to organize the hierarchical index and how to process XML keyword queries with the index. In our experiment with the DBLP XML document and the XML documents in the INEX2003 test set, the hierarchical index worked well.

Phrase-based Indexing for Korean Information Retrieval System (한국어 정보검색 시스템을 위한 구 단위 색인)

  • 윤성희
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.5 no.1
    • /
    • pp.44-48
    • /
    • 2004
  • This paper proposes a phrase-based indexing system based on the phrase. the larger syntax unit than a single keyword. Early information retrieval systems with indexing system matching single keyword is simple and popular. But with single keyword matching it is very hard to represent the exact meaning of documents and the set of documents from retrieval is very large, therefore it can't satisfy the user of the information retrieval systems. Web documents include lots of syntactic errors, the natural language parser with high quality cannot be expected in Web. Partial trees, even not a full tree, from fully bottom-up parsing is still useful for extracting phrases, and they are much more discriminative than single keyword for index. It helps the information retrieval system enhance the efficiency and reduce the processing overhead, too.

  • PDF

Public Key Encryption with Equality Test with Designated Tester (고정된 검사자를 고려한 메시지 동일성 검사 공개키 암호시스템)

  • Lee, Young-Min;Koo, Woo-Kwon;Rhee, Hyun-Sook;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.5
    • /
    • pp.3-13
    • /
    • 2011
  • In 2004, Boneh et.al. proposed a public key encryption with keyword search (PEKS) scheme which enables a server to test whether a keyword used in generating a ciphertext by a sender is identical to a keyword used in generating a query by a receiver or not. Yang et. al. proposed a probabilistic public key encryption with equality test (PEET) scheme which enables to test whether one message of ciphertext generated by one public key is identical to the other message generated by the other public key or not. If the message is replaced to a keyword, PEET is not secure against keyword guessing attacks and does not satisfy IND-CP A security which is generally considered in searchable encryption schemes. In this paper, we propose a public key encryption with equality test with designated tester (dPEET) which is secure against keyword guessing attacks and achieves IND-CPA security.

The Effects of City's Search Keyword Type on Facebook Page Fans and Inbound Tourists : Focusing on Seoul City (도시의 검색키워드 유형이 페이스북 페이지 팬 수 및 관광객 수에 미치는 영향에 관한 연구: 서울시를 중심으로)

  • Choi, Jee-Hye;Lee, Hyo-Bok
    • Journal of Digital Convergence
    • /
    • v.15 no.10
    • /
    • pp.93-101
    • /
    • 2017
  • This study investigate the effect of each type of search volume on the number of Facebook fans and the number of tourists. According to the hierarchy effect model, the effect of communication appears to be the sequentiality of cognition-attitude-behavior. Applying this theory, this study predicted that when consumers who have higher involvement and knowledge on specific cities through search behavior, they will be more active in information search through Facebook fan page subscription and will lead to direct tourism behavior. To verify the prediction, we examined the influences among search volume of Seoul shown in Google Trend, the number of fans of official facebook page named 'Seoul Korea', and the number of foreign tourists. As a result, the type of search keyword was divided into four categories: tourism attraction keyword, natural environment keyword, symbolic keyword, and accessibility keyword. The regression analysis showed that tourism attraction keyword and symbolic keyword have influence on Facebook fanpage 'Like'. In addition, facebook fanpage fan size have mediation effect between search volume and number of tourists. All in all, it would be useful to appeal to foreign tourists with a message that emphasizes tourism attraction and Korea-related contents.

Design of an Efficient Keyword-based Retrieval System Using Concept lattice (개념 망을 이용한 키워드 기반의 효율적인 정보 검색 시스템 설계)

  • Ma, Jin;Jeon, In ho;Choi, Young keun
    • Journal of Internet Computing and Services
    • /
    • v.16 no.3
    • /
    • pp.43-57
    • /
    • 2015
  • In this thesis was conducted to propose a method for efficient information retrieval using concept lattices. Since this thesis designed a new system based on ordinary concept lattices, it has the same approach method as ontology, but this thesis proposes new concept lattices to be used by establishing collaborative relations between objects and concepts that users are likely to search information more efficiently. The system suggested by this thesis can be summarized as below. Firstly, this system leads to a collaborative search by using Three kinds of concepts, such as keyword concept lattices, which focus on input key words, expert concept lattices recommended by experts and theme concept lattices, and based on these 3 concept lattices, it will help users search information they want more efficiently. Besides, as the expert concept and the keyword concept become combined, further providing users with the frequency of keyword and the frequency of category, this system can function to recommend key words related to search words entered by users. Another function of this system is to inform users of key words and categories used in users' interested themes by using the theme concept lattices. Secondly, when there is not keyword entered by a user, it is possible for users to achieve the goal of search through the secondary search when this system provides them with key words related to the input keyword. Thirdly, since most of the information is managed while being dispersed, such dispersed and managed information not only has different expression methods but changes as time goes. Accordingly, By using XMDR for efficient data access and integration of distributed information, this thesis proposes a new technique and retrieval system to integrate dispersed data.

A study about IR Keyword Abstraction using AC Algorithm (AC 알고리즘을 이용한 정보검색 키워드 추출에 관한 연구)

  • 장혜숙;이진관;박기홍
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.667-671
    • /
    • 2002
  • It is very difficult to extract the words fitted for the purpose in spite of the great importance of efficient keyword extraction in information retrieval systems because there are many compound words. For example, AC machine is not able to search compound keywords from a single keyword. The DER structure solves this problem, but there remains a problem that it takes too much time to search keywords. Therefore a DERtable structure based on these methods is proposed in this dissertation to solve the above problems in which method tables are added to the existing DER structure and utilized to search keywords.

  • PDF

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.

Tag Search System Using the Keyword Extraction and Similarity Evaluation (키워드 추출 및 유사도 평가를 통한 태그 검색 시스템)

  • Jung, Jaein;Yoo, Myungsik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2485-2487
    • /
    • 2015
  • Recently, Hashtag is widely used in SNS like Facebook, Twitter and personal blogs. However, the efficiency of tag search system is poor due to the indiscriminate use of hashtags. To enhance the accuracy of tag search system, we proposed a tag search system using the keyword extraction and similarity evaluation. The experimental results show that the proposed system provides the higher accuracy on tag search results.