• Title/Summary/Keyword: Dynamic XML

Search Result 99, Processing Time 0.031 seconds

Dynamic Predicate: An Efficient Access Control Mechanism for Hippocratic XML Databases (동적 프레디킷 : 허포크라테스 XML 데이타베이스를 위한 효율적인 액세스 통제 방법)

  • Lee Jae-Gil;Han Wook-Shin;Whang Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.32 no.5
    • /
    • pp.473-486
    • /
    • 2005
  • The Hippocratic database model recently proposed by Agrawal et at. incorporates privacy protection capabilities into relational databases. The authors have subsequenty proposed the Hippocratic XML daかabase model[4], an extension of the Hippocratic database model for XML databases. In this paper, we propose a new concept that we cail the dynamic predicate(DP) for effective access control in the Hippocratic XML database model. A DP is a novel concept that represents a dynamically constructed rendition that tan be adapted for determining the accessibility of elements during query execution. DPs allow us to effectively integrate authorization checking into the query plan so that unauthorized elements are excluded in the process of query execution. Using synthetic and real data, we have performed extensive experiments comparing query processing time with those of existing access control mechanisms. The results show that the proposed access control mechanism improves the wall clock time by up to 219 times over the top-down access control strategy and by up to 499 times over the bottom-up access control strategy. The major contribution of our, paper is enabling effective integration of access control mechanisms with the query plan using the DP under the Hippocratic XML database model.

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

Efficient XML Data Server Technology for EC Implementation (EC 구축을 위한 효율적인 XML 데이터서버 기술)

  • 박시형;김성수
    • Proceedings of the CALSEC Conference
    • /
    • 2000.08a
    • /
    • pp.179-186
    • /
    • 2000
  • ㆍ A sub-set of SGML (Standard Generalized Markup Language) ㆍ A family of standards ㆍ XML 1.0 is the specification that defines what tags, attributes and other XML nodes are ㆍ License-free, platform-independent and well-supported ㆍ Simple ▶ Human-readable, easy to use ㆍ Extensible ▶ A dynamic data model ㆍ Flexible ▶ For handling complex data ㆍ Portable ▶ For cross-platform data exchange ㆍ Standard ▶ Easy to integrate, widely adopted(omitted)

  • PDF

Design of Templating System for Web Publication (웹 출판을 위한 템플릿 시스템의 설계)

  • Abdallah, Hisham;Koo, Heung-Seo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11c
    • /
    • pp.1777-1780
    • /
    • 2002
  • This paper presents a well-designed templating system for CMS web Publication using XML/XSL technology. The primary motivation is the need of Web CMS to separate content from layout and logic. Our system provides GUI XSLT editor (x-editor) to create and modify XSLT stylesheet documents easily. These documents are used to add "layout" and "look and feel" information to XML document which contains content and functionality. The modified XML document is processed by XML-template engine to produce dynamic or static web sites.

  • PDF

An Efficient Secure Dissemination of XML data in Peer-to-Peer Networks (Peer-to-Peer 네트워크 상에서 XML 데이터의 효율적이고 안전한 배포 방식에 관한 연구)

  • Ko, Hyuk-Jin;Kang, Woo-Jun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.3
    • /
    • pp.528-534
    • /
    • 2007
  • As XML is becoming a standard for representation and exchange of abundant information on the Web, solutions for a secure and selective dissemination of XML data, known as SDI, are strongly demanded. Such trends are more outstanding especially in distributed heterogeneous environment such as Peer-to-Peer. Although many approaches have been proposed to provide secure and efficient SDI mechanisms, almost previous approaches have focused only on filtering with user profile and they adopt center-oriented administration approaches. It is therefore difficult to adapt them directly to the distributed Peer-to-Peer environments characterized by dynamic participation. In this paper, we develop a novel dissemination method, which makesuse of authorization policy and secret sharing scheme. It provides more secure, scalable means for XML dissemination on Peer-to-Peer networks.

  • PDF

SemFilter: A Simple and Efficient Semantic XML Message Filtering (SemFilter: 단순하며 효율적인 시맨틱 XML 메시지 필터링)

  • Kim, Jae-Hoon;Park, Seog
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.680-693
    • /
    • 2008
  • Recent studies on XML filtering assume that all data sources follow a single global schema defined in a filtering system. However, beyond this simple assumption, a filtering system can provide a service that allows data publishers to have their own schema; hence, the data sources will become heterogeneous. The number of data sources is expected to be large in a filtering system and the data sources are frequently published, updated, and disappeared, that is, dynamic. In this paper, we introduce implementing a simple and efficient XPath query translation method for such a dynamic environment. The method is especially targeted for a query which is composed based only on users' knowledge and experience without a graphical guidance of the global schema. When a user queries a large number of heterogeneous data, there is a high possibility that the query is not consistent with the same local schema assumed by the user. Our query translation method also supports a function for this problem. Some experimental results for query translation performance have shown that our method has reasonable performance, and is more practical than the existing method.

Analysis on Update Performance of XML Data by the Labeling Method (Labeling 방식에 따른 XML 데이터의 갱신 성능 분석)

  • Jung Min-Ok;Nam Dong-Sun;Han Jung-Yeob;Park Jong-Hyen;Kang Ji-Hoon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.106-108
    • /
    • 2005
  • XML is situating a standard fur data exchange in the Web. Most applications use database to manage XML documents of high-capacity efficiently. Therefore, most applications create label that expresses structure information of XML data and stores with information of XML document. A number of labeling schemes have been designed to label the element nodes such that the relationships between nodes can be easily determined by comparing their labels. With the increased popularity of XML data on the web, finding a labeling scheme that is able to support order-sensitive queries in the presence of dynamic updates becomes urgent. XML documents that most applications use have many properties as their application. So, in the thesis, we present the most efficient updating methods dependent on properties of XML documents in practical application by choosing a representative labeling method and applying these properties. The result of our test is based on XML data management system, so it expect not only used directly in practical application, but a standard to select the most proper methods for environment of application to develop a new exclusive XML database or use XML.

  • PDF

A Rule-based JMS Message Routing System for Dynamic Message Communication in based Distributed Systems (분산환경에서 동적 메시지 교환을 위한 룰 기반 JMS 메시지 라우팅 시스템)

  • Cho, Poong-Youn;Choi, Jae-Hyun;Park, Jae-Won;Lee, Nam-Yong
    • The Journal of Society for e-Business Studies
    • /
    • v.13 no.3
    • /
    • pp.1-20
    • /
    • 2008
  • Today's computing environment which is getting distributed to communicate with various systems needs dynamic inter-connectivity of the systems. MOM(Message Oriented Middleware) is popularly used for transmitting XML messages among the distributed systems for the inter-connectivity. But, they do not support event-based message routing functionalities with XML transformation for processing effective message routing, which is essential to inter-connectivity, and there is no integrated platform to cope with these requirements. Although event-based message routing and XML transformation have been studied in a wide range of computer science areas, development of message routing systems is considered as a tough job due to the technological difficulties. In order to address these requirements, we proposed a novel system, named RMRS(Rule-based Message Routing System), which supports event-based message routing as well as XML message transformation. To make the proposed system easy to use, we also redesigned ECA(Event- Condition-Action) rule to fit in our system and developed a tool to map source XML structure into target XML structure.

  • PDF

An Adaptive Query Processing System for XML Stream Data (XML 스트림 데이타에 대한 적응력 있는 질의 처리 시스템)

  • Kim Young-Hyun;Kang Hyun-Chul
    • Journal of KIISE:Databases
    • /
    • v.33 no.3
    • /
    • pp.327-341
    • /
    • 2006
  • As we are getting to deal with more applications that generate streaming data such as sensor network, monitoring, and SDI (selective dissemination of information), active research is being conducted to support efficient processing of queries over streaming data. The applications on the Web environment like SDI, among others, require query processing over streaming XML data, and its investigation is very important because XML has been established as the standard for data exchange on the Web. One of the major problems with the previous systems that support query processing over streaming XML data is that they cannot deal adaptively with dynamically changing stream because they rely on static query plans. On the other hand, the stream query processing systems based on relational data model have achieved adaptiveness in query processing due to query operator routing. In this paper, we propose a system of adaptive query processing over streaming XML data in which the model of adaptive query processing over streaming relational data is applied. We compare our system with YFiiter, one of the representative systems that provide XML stream query processing capability, to show efficiency of our system.