• Title/Summary/Keyword: prime number indexing

Search Result 3, Processing Time 0.017 seconds

PrimeFilter: An Efficient XML Data Filtering based on Prime Number Indexing (PrimeFilter: 소수 인덱싱 기법에 기반한 효율적 XML 데이타 필터링)

  • Kim, Jae-Hoon;Kim, Sang-Wook;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.35 no.5
    • /
    • pp.421-431
    • /
    • 2008
  • Recently XML is becoming a de facto standard for online data exchange between heterogeneous systems and also the research of streaming XML data filtering comes into the spotlight. Since streaming XML data filtering technique needs rapid matching of queries with XML data, it is required that the query processing should be efficiently performed. Until now, most of researches focused only on partial sharing of path expressions or efficient predicate processing and they were work for time and space efficiency. However, if containment relationship between queries is previously calculated and the lowest level query is matched with XML data, we can easily get a result that high level queries can match with the XML data without any other processing. That is, using this containment technique can be another optimal solution for streaming XML data filtering. In this paper, we suggest an efficient XML data filtering based on prime number indexing and containment relationship between queries. Through some experimental results, we present that our suggested method has a better performance than the existing method. All experiments have shown that our method has a more than two times better performance even though each experiment has its own distinct test purpose.

A Labeling Methods for Keyword Search over Large XML Documents (대용량 XML 문서의 키워드 검색을 위한 레이블링 기법)

  • Sun, Dong-Han;Hwang, Soo-Chan
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.699-706
    • /
    • 2014
  • As XML documents are getting bigger and more complex, a keyword-based search method that does not require structural information is needed to search these large XML documents. In order to use this method, not only all keywords expressed as nodes in the XML document must be labeled for indexing but also structural information should be well represented. However, the existing labeling methods either have very simple information of XML documents for index or represent the structural information which is difficult to deal with the increase of XML documents' size. As the size of XML documents is getting larger, it causes either the poor performance of keyword search or the exponential increase of space usage. In this paper, we present the Repetitive Prime Labeling Scheme (RPLS) in order to improve the problem of the existing labeling methods for keyword-based search of large XML documents. This method is based on the existing prime number labeling method and allows a parent's prime number to be used at a lower level repeatedly so that the number of prime numbers being generated can be reduced. Then, we show an experimental result of the comparison between our methods and the existing methods.

Indexing Scheme for RDF/RDFS using Prime Number Label (소수 레이블을 이용한 RDF/RDFS 인덱스 구조)

  • Kim, Sun-Young;Kwon, Dong-Seop;Lee, Suk-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.82-84
    • /
    • 2005
  • 시맨틱 웹의 등장에 따라 RDF와 RDF Schema(RDF/RDFS)로 표현되는 웹 데이타의 양이 증가하고 있다. 이에 웹 데이타를 효율적으로 저장, 검색할 수 있는 인덱스 구조의 필요성이 높아지고 있다. 본 연구에서는 기존의 트리 모델을 위한 소수 레이블 기법(prime number labeling scheme)을 발전시켜, RDF/RDFS 인덱스 구조를 표현할 수 있는 그래프 모델을 위한 소수 레이블 기법을 제안한다. 제안한 기법은 기존의 소수 레이블 기법을 그래프에 적용하여 구조 질의(Structural Query)를 효율적으로 처리할 수 있고, 데이타 갱신 시에 인덱스를 재구성하지 않아도 되는 장점을 가지고 있다. 그리고 이전의 RDF/RDFS 인덱스 구조에서 효율적으로 처리하기 힘들었던 순환 방향성 그래프에 대한 질의도 쉴게 처리할 수 있다.

  • PDF