• Title, Summary, Keyword: Partial Match

Search Result 43, Processing Time 0.048 seconds

(A Study of an Exact Match and a Partial Match as an Information Retrieval Technique) (완전 매치와 부분 매치 검색 기법에 관한 연구)

  • 김영귀
    • Journal of the Korean Society for information Management
    • /
    • v.7 no.1
    • /
    • pp.79-95
    • /
    • 1990
  • A retrieval technique was defined as a technique for comparing the document representations. So this study classified retrieval technique in terms of the charactristics of the retrieved set of documents and the representations that are used. The distinction is whether the set of retrieved documents contains only documents whose representations are an exact match with the query, or a partial match with query. For a partial match, the set of retrieved document will include also those that are an exact match with the query. Boolean-logic as one of the exact match retrieval techniques is in current in most of the large operational information retrieval systems despite of its problems and limitatlons. Partial match as an alternative technique has also various problems. Existing information retrieval systems are successful in aSSisting the user whose needs are well- defined (e.g. Boolean-logic), to retrieve relevant documents but it should be successful in providing retrieval assistance to the browser whose information requirements is ill-defined.

  • PDF

Linear Path Query Processing using Backward Label Path on XML Documents (역방향 레이블 경로를 이용한 XML 문서의 선형 경로 질의 처리)

  • Park, Chung-Hee;Koo, Heung-Seo;Lee, Sang-Joon
    • Journal of Korean Institute of Intelligent Systems
    • /
    • v.17 no.6
    • /
    • pp.766-772
    • /
    • 2007
  • As XML is widely used, many researches on the XML storage and query processing have been done. But, previous works on path query processing have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. Those researches did not efficiently process partial match queries on the differently-structured document set. To resolve the problem, we suggested a new index structure using relational table. The method constructs the $B^+$-tree index using backward label paths instead of forward label paths used in previous researches for storing path information and allows for finding the label paths that match the partial match queries efficiently using it when process the queries.

B2V-Tree: An Indexing Scheme for Partial Match Queries on Wireless Data Streams (B2V-Tree: 무선 데이타 스트림에서 부분 부합 질의를 위한 색인 기법)

  • Chung, Yon-Dohn;Lee, Ji-Yeon
    • Journal of KIISE:Databases
    • /
    • v.32 no.3
    • /
    • pp.285-296
    • /
    • 2005
  • In mobile distributed systems the data on the air can be accessed by a lot of mobile clients. And, we need an indexing scheme in order to energy-efficiently access the data on the wireless broadcast stream. In conventional indexing schemes, they use the values of primary key attributes and construct tree-structured index. Therefore, the conventional indexing schemes do not support content-based retrieval queries such as partial-match queries. In this paper we propose an indexing scheme, called B2V-Tree, which supports partial match queries on wireless broadcast data stream. For this purpose, we construct a tree-structured index which is composed of bit-vectors, where the bit-vectors are generated from data records through multi-attribute hashing.

Efficient Linear Path Query Processing using Information Retrieval Techniques for Large-Scale Heterogeneous XML Documents (정보 검색 기술을 이용한 대규모 이질적인 XML 문서에 대한 효율적인 선형 경로 질의 처리)

  • 박영호;한욱신;황규영
    • Journal of KIISE:Databases
    • /
    • v.31 no.5
    • /
    • pp.540-552
    • /
    • 2004
  • We propose XIR-Linear, a novel method for processing partial match queries on large-scale heterogeneous XML documents using information retrieval (IR) techniques. XPath queries are written in path expressions on a tree structure representing an XML document. An XPath query in its major form is a partial match query. The objective of XIR-Linear is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Linear has its basis on the schema-level methods using relational tables and drastically improves their efficiency and scalability using an inverted index technique. The method indexes the labels in label paths as key words in texts, and allows for finding the label paths that match the queries far more efficiently than string match used in conventional methods. We demonstrate the efficiency and scalability of XIR-Linear by comparing it with XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Linear is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions as the number of XML documents increases.

Branching Path Query Processing for XML Documents using the Prefix Match Join (프리픽스 매취 조인을 이용한 XML 문서에 대한 분기 경로 질의 처리)

  • Park Young-Ho;Han Wook-Shin;Whang Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.32 no.4
    • /
    • pp.452-472
    • /
    • 2005
  • We propose XIR-Branching, a novel method for processing partial match queries on heterogeneous XML documents using information retrieval(IR) techniques and novel instance join techniques. A partial match query is defined as the one having the descendent-or-self axis '//' in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR-Branching is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Branching has its basis on the conventional schema-level methods using relational tables(e.g., XRel, XParent, XIR-Linear[21]) and significantly improves their efficiency and scalability using two techniques: an inverted index technique and a novel prefix match join. The former supports linear path expressions as the method used in XIR-Linear[21]. The latter supports branching path expressions, and allows for finding the result nodes more efficiently than containment joins used in the conventional methods. XIR-Linear shows the efficiency for linear path expressions, but does not handle branching path expressions. However, we have to handle branching path expressions for querying more in detail and general. The paper presents a novel method for handling branching path expressions. XIR-Branching reduces a candidate set for a query as a schema-level method and then, efficiently finds a final result set by using a novel prefix match join as an instance-level method. We compare the efficiency and scalability of XIR-Branching with those of XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Branching is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions, and by several factors for branching path expressions.

A Transliteration Model based on the Seq2seq Learning and Methods for Phonetically-Aware Partial Match for Transliterated Terms in Korean (문장대문장 학습을 이용한 음차변환 모델과 한글 음차변환어의 발음 유사도 기반 부분매칭 방법론)

  • Park, Joohee;Park, Wonjun;Seo, Heecheol
    • Annual Conference on Human and Language Technology
    • /
    • /
    • pp.443-448
    • /
    • 2018
  • 웹검색 결과의 품질 향상을 위해서는 질의의 정확한 매칭 뿐만이 아니라, 서로 같은 대상을 지칭하는 한글 문자열과 영문 문자열(예: 네이버-naver)의 매칭과 같은 유연한 매칭 또한 중요하다. 본 논문에서는 문장대문장 학습을 통해 영문 문자열을 한글 문자열로 음차변환하는 방법론을 제시한다. 또한 음차변환 결과로 얻어진 한글 문자열을 동일 영문 문자열의 다양한 음차변환 결과와 매칭시킬 수 있는 발음 유사성 기반 부분 매칭 방법론을 제시하고, 위키피디아의 리다이렉트 키워드를 활용하여 이들의 성능을 정량적으로 평가하였다. 이를 통해 본 논문은 문장대문장 학습 기반의 음차 변환 결과가 복잡한 문맥을 고려할 수 있으며, Damerau-Levenshtein 거리의 계산에 자모 유사도를 활용하여 기존에 비해 효과적으로 한글 키워드들 간의 부분매칭이 가능함을 보였다.

  • PDF

The Study on matrix based high performance pattern matching by independence partial match (독립 부분 매칭에 의한 행렬 기반 고성능 패턴 매칭 방법에 관한 연구)

  • Jung, Woo-Sug;Kwon, Taeck-Geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.914-922
    • /
    • 2009
  • In this paper, we propose a matrix based real-time pattern matching method, called MDPI, for real-time intrusion detection on several Gbps network traffic. Particularly, in order to minimize a kind of overhead caused by buffering, reordering, and reassembling under the circumstance where the incoming packet sequence is disrupted, MDPI adopts independent partial matching in the case dealing with pattern matching matrix. Consequently, we achieved the performance improvement of the amount of 61% and 50% with respect to TCAM method efficiency through several experiments where the average length of the Snort rule set was maintained as 9 bytes, and w=4 bytes and w=8bytes were assigned, respectively, Moreover, we observed the pattern scan speed of MDPI was 10.941Gbps and the consumption of hardware resource was 5.79LC/Char in the pattern classification of MDPI. This means that MDPI provides the optimal performance compared to hardware complexity. Therefore, by decreasing the hardware cost came from the increased TCAM memory efficiency, MDPI is proven the cost effective high performance intrusion detection technique.

Analysis on Partial Discharge Fault Signals of PRPD for High Voltage Motor Stator Winding (고압전동기 고정자 권선의 PRPD 부분방전 결함신호 해석)

  • Park Jae-Jun;Lee Sung-Young;Mun Dae-Chul
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.19 no.10
    • /
    • pp.942-946
    • /
    • 2006
  • We simulated insulation defects of stator winding wire on high voltage generator by 5 types. 4 types have one discharge source and other one has multi discharge source by simulation. For accurate decision, measurements used to PRPD pattern to occurred partial discharge source of various types. In this research, when PRPD pattern carried out or analyzed pattern recognition of discharge source, it used to powerful tools. In this result, PRPD Pattern defined to have single discharge source of 4 types by insulation defect. When insulation defect simulated, all the defected winding have not the same result. Errors for a little different can make mistakes from a subtle distinction. The difference between internal and void discharge have magnitude of pulse amplitude of inner discharge bigger than void discharge and have a shape of bisymmetry. But void discharge has a shape of bisymmetry against maximum value on polarity respectively. In cases of slot and surface discharge, we confirmed to show similar results those other researchers. In case of multi-discharge, as a result of we could classify not perfect match with occurred patterns in single discharge eachother. In the future, we will have to recognize and classify with results of multi-discharge.

An Efficient Partial Matching System and Region-based Representation for 2D Images (2D 영상의 효과적인 부분 정합 시스템과 영역기반 영상 표현)

  • Kim, Seon-Jong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.9
    • /
    • pp.868-874
    • /
    • 2007
  • This paper proposes an efficient partial matching system and representation by using a region-based method for 2D image, and we applied to an extraction of the ROI(Region of Interest) according to its matching score. The matching templates consist of the global pattern and the local one. The global pattern can make it by using region-based relation between center region and its rest regions in an object. And, the local pattern can be obtained appling to the same method as global, except relation between objects. As the templates can be normalized, we use this templates for extraction of ROI with invariant to size and position. And, our system operates only one try to match, due to normalizing of region size. To use our system for searching and examining if it's the ROI by evaluating the matching function, at first, we are searching to find candidate regions with the global template. Then, we try to find the ROI among the candidates, and it works this time by using the local template. We experimented to the binary and the color image respectively, they showed that the proposed system can be used efficiently for representing of the template and the useful applications, such as partially retrievals of 2D image.

Flexure Strength of Various Colored and Uncolored Zirconia Ceramics for All-Ceramic Restoration (전부도재수복물을 위한 유색 및 무색 지르코니아 세라믹의 굴곡강도)

  • Oh, Sang-Chun;Lee, Hae-Hyoung;Shin, Mee-Ran;Lee, Il-Kwon
    • Journal of Dental Rehabilitation and Applied Science
    • /
    • v.23 no.2
    • /
    • pp.119-130
    • /
    • 2007
  • Purpose: This investigation was designed to estimate the flexure strength, density, and microstructure of the colored and uncolored zirconia oxide ceramics for fixed partial denture. Material and Methods: LAVATM All Ceramic(3M-ESPE, USA), Cercon Smart Ceramic(Dentsply, USA), and Z-match Ceramic(DentAim, Korea) were used for this study. All specimen was fabricated by ASTM C1161. After preparing $25{\times}2{\times}1.5mm$ of rectangular column and sitting rectangular column on universal test machine (UTM), external supporting point distance is 20.0 mm, internal supporting point distance is 10.0 mm. Specimen was loaded with 0.2 mm/min of cross head speed until fracture and at the time of broken of specimen, measuring loading value with PC software. Results: The results were obtained as follows: 1. Flexure strength of uncolored zirconia was higher than that of colored zirconia. 2. In uncolored zirconia, flexure strength of LAVATM Ceramic was more higher than the other ceramics, and it showed statistical difference between LAVATM Ceramic and Cercon Smart Ceramic (P<0.05). 3. In colored zirconia, flexure strength of LAVATM Ceramic was more higher than the other ceramics too, but they did not show statistical difference (p>0.05). 4. In Weibull analysis, Characterastic strength was showed highest value to uncolored LAVATM Ceramic and lowest value to Z-match ceramic, and Weibull modulus(m) of uncolored zirconia was higher than that of colored zirconia. 5. In XRD analysis, all group except Z-match showed high peak of t-ZrO2 but they did not show m-ZrO2. Colored zirconia group showed lower peak of t-ZrO2 than that of uncolored zirconia group.