• Title/Summary/Keyword: XML Tree

Search Result 148, Processing Time 0.023 seconds

A Design and Implementation of the VoiceXML Multiple-View Editor Using MVC Framework (MVC 프레임 워크를 사용한 VoiceXML 다중 뷰 편집기의 설계 및 구현)

  • 유재우;염세훈
    • The Journal of the Acoustical Society of Korea
    • /
    • v.23 no.5
    • /
    • pp.390-399
    • /
    • 2004
  • In this paper, we design and implement a multiple-view VoiceXML editor to improve editing efficiency of the VoiceXML. The VoiceXML multiple-view Editor uses a MVC framework to support multiple views and paradigm. Our multiple-view editor consists of Model. View and Controller using MVC framework. A model, core data structure. is constructed of abstract syntax tree and abstract grammar. A view. user interface. is formalized in unparsing rules and unparser. A controller. to control model and view. is made of command interpreter and tree handler. The VoiceXML multiple-view editor overcomes a drawbacks of existing XML editors by showing document structure and context concurrently. as well as document flows. Our VoiceXML multiple-view editor. which MVC framework has been applied, provides various editing views concurrently to users. Thereby. it supports efficient and convenient editing environments for voice-web documents to users and it guarantees transparency of editors. as various views have a same consistent model.

Similarity Measure and Clustering Technique for XML Documents by a Parent-Child Matrix (부모-자식 행렬을 사용한 XML 문서 유사도 측정과 군집 기법)

  • Lee, Yun-Gu;Kim, Woosaeng
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.7
    • /
    • pp.1599-1607
    • /
    • 2015
  • Recently, researches have been developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a parent-child matrix to cluster XML documents efficiently. A parent-child matrix analyzes both the content and structural features of an XML document. Each cell of a parent-child matrix has either the value of a node in an XML tree or the value of a child node, where a parent-child relationship exists in the XML tree. Then, the similarity between two XML documents can be measured by the similarity between two corresponding parent-child matrices. The experiment shows that our proposed method has good performance.

Generate of OCL on XML Sechma Meta Model (XML 스키마 메타모델에서 OCL 생성)

  • Lee Don-Yang;Choi Han-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.6
    • /
    • pp.42-49
    • /
    • 2006
  • XML used rapid method of meta language representation in internet for information transmission. In addition to XML Schema used frequency specification to variety data type. This thesis designed to Simple Type meta model of XML schema using UML. But because structure of XML schema complicate and suppose variety data type we can recognize many difficult matter to user's apprehension and application of model properties that appeared UML. To way out of this matter this study could specified clearly to structured expression in XML schema meta model that is applied OCL specification and together, come up with method of detailed design to parse tree and token generation for lexical and symmentics analysis in compile step on this study foundation.

  • PDF

Fast XML Encoding Scheme Using Reuse of Deleted Nodes (삭제된 노드의 재사용을 이용한 Fast XML 인코딩 기법)

  • Hye-Kyeong Ko
    • The Journal of the Convergence on Culture Technology
    • /
    • v.9 no.3
    • /
    • pp.835-843
    • /
    • 2023
  • Given the structure of XML data, path and tree pattern matching algorithms play an important role in XML query processing. To facilitate decisions or relationships between nodes, nodes in an XML tree are typically labeled in a way that can quickly establish an ancestor-descendant on relationship between two nodes. However, these techniques have the disadvantage of re-labeling existing nodes or recalculating certain values if insertion occurs due to sequential updates. Therefore, in current labeling techniques, the cost of updating labels is very high. In this paper, we propose a new labeling technique called Fast XML encoding, which supports the update of order-sensitive XML documents without re-labeling or recalculation. It also controls the length of the label by reusing deleted labels at the same location in the XML tree. The proposed reuse algorithm can reduce the length of the label when all deleted labels are inserted in the same location. The proposed technique in the experimental results can efficiently handle order-sensitive queries and updates.

Improving Performance of Change Detection Algorithms through the Efficiency of Matching (대응효율성을 통한 변화 탐지 알고리즘의 성능 개선)

  • Lee, Suk-Kyoon;Kim, Dong-Ah
    • The KIPS Transactions:PartD
    • /
    • v.14D no.2
    • /
    • pp.145-156
    • /
    • 2007
  • Recently, the needs for effective real time change detection algorithms for XML/HTML documents and increased in such fields as the detection of defacement attacks to web documents, the version management, and so on. Especially, those applications of real time change detection for large number of XML/HTML documents require fast heuristic algorithms to be used in real time environment, instead of algorithms which compute minimal cost-edit scripts. Existing heuristic algorithms are fast in execution time, but do not provide satisfactory edit script. In this paper, we present existing algorithms XyDiff and X-tree Diff, analyze their problems and propose algorithm X-tree Diff which improve problems in existing ones. X-tree Diff+ has similar performance in execution time with existing algorithms, but it improves matching ratio between nodes from two documents by refining matching process based on the notion of efficiency of matching.

Design of Efficient Storage Structure and Indexing Mechanism for XML Documents (XML을 위한 효율적인 저장구조 및 인덱싱 기법설계)

  • 신판섭
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.1
    • /
    • pp.87-100
    • /
    • 2004
  • XML has recently considered as a new standard for data presentation and exchange on the web, many researches are on going to develop applications and index mechanism to store and retrieve XML documents efficiently. In this paper, design a Main-Memory based XML storage system for efficient management of XML document. And propose structured retrieval of XML document tree which reduce the traverse of XML document tree using element type information included user queries. Proposed indexing mechanism has flexibilities for dynamic data update. Finally, for query processing of XML document include Link information, design a index structure of table type link information on observing XLink standards.

  • PDF

A Design and Implementation of XML Document storing and retrieval Framework based on a variant k-ary complete tree and RDF Metadata (가변 K진 완전트리와 RDF메타정보에 기반한 XML문서 저장 및 검색 프레임워크의 설계 및 구현)

  • 김규태;정회경;이수연
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.612-622
    • /
    • 2003
  • This paper studied and proposed a XML document storing-and-retrieval framework based on a variant k-ary complete tree and a RDF metadata, which is composed of an effective storing module to store xml documents, a retrieving module to retrieve xml documents, and a connecting module to make this system intemperate in the web environment. In this storing module, DTD independent DOM based decomposition model using a method of addressing unique ill using a variant k-ary complete tree is adopted and is implemented. Query Processing Module includes a XPath query process and a content based retrieval function using word index for content information. To retrieve more exactly data, a structural retrieval using RDF metadata is adopted and implemented. In order to implement effectively XML document storing and retrieval system in the web environment, API using XML-RPC, API using HTTP's GET, PUT, POST and API using SOAP have been adopted and implemented.

Design of XQL Query Processing System for Structural information retrieval (구조적 정보 검색을 위한 XQL 질의 처리 시스템 설계)

  • 김상영;김철원;김광현;박종훈;정현철
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.892-896
    • /
    • 2003
  • XML is used in various fields such as interface format for data swapping between application between several various system passing over thing to mark to web browser simply. Accordingly, a lot of studies about system that can manage effectively and search XML document with formation of information, reusability, disposal and durability, portability are proceeding. In this paper, explain about XQL and document structure processor and language processor of quality and make contents of XML document by tree structure, structure information presents method that find XML document tree structure information that is correct on question using XQL while do parsing. Through this, described for design and embodiment of efficient XML document search system that use XQL that compose structure information of document in tree structure and is proposed in language of quality after do parsing absorbing XML document that is scattered on web.

  • PDF

XML Dynamic Labeling Scheme Based On Vector Representation (벡터 표현을 기반으로 한 XML 동적 레이블링 기법)

  • Hong, Seok Hee
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.1
    • /
    • pp.14-23
    • /
    • 2014
  • There have been many researches for XML as the international standard to store and exchange data on the internet. Among these research fields, we focus on the techniques labeling the nodes of the XML tree that is required for querying the structural information. A labeling scheme assigns the unique label to the nodes and supports the queries for the structural information such as Ancestor-Descendant and Parent-Child relationships. In this paper, we propose a labeling scheme using vector representation where the assigned labels are not altered although XML documents are changed dynamically. Our labeling scheme reduces the storage requirement for the labels of the XML tree and provides the efficient query by using the fixed-length labels with a short size. Result of performance evaluation shows that our labeling scheme is superior to the previous approaches.

XML Structured Model of Tree-type for Efficient Retrieval (효율적인 검색을 위한 Tree 형태의 XML 문서 구조 모델)

  • Kim Young-Ran
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.4 s.32
    • /
    • pp.27-32
    • /
    • 2004
  • A XML Document has a structure which may be irregular The irregular document structure is difficult for users to know exactly. In this paper, we propose the XML document model and the structure retrieval method for efficient management and structure retrieval of XML documents. So we use fixed-sized LETID having the information of element, describe the structured information retrieval algorithm for parent and child element to represent the structured information of XML documents. Using this method, we represent the structured information of XML document efficiently. We can directly access to specific clement by simple operation, and process various queries. We expect the method to support various structured retrieval of specific element such as parent, child. and sibling elements.

  • PDF