Efficient Identification of Structural Relationships for XML Queries using Secure Labeling Schemes

Efficient Identification of Structural Relationships for XML Queries using Secure Labeling Schemes

S. Sankari, S. Bose
Copyright: © 2016 |Pages: 18
DOI: 10.4018/IJIIT.2016100104
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

XML emerged as a de-facto standard for data representation and information exchange over the World Wide Web. By utilizing document object model (DOM), XML document can be viewed as XML DOM tree. Nodes of an XML tree are labeled to uniquely identify every node by following a labeling scheme. This paper proposes a method to efficiently identify the two structural relationships namely document order (DO) and sibling relationship that exist between the XML nodes using two secure labeling schemes specifically enhanced Dewey coding (EDC) and secure Dewey coding (SDC). These structural relationships influence the performance of XML queries so they need to be identified in efficient time. This paper implements the method to identify DO and sibling relationship using EDC and SDC labels for various real-time XML documents. Experiment results show the identification of DO and sibling relationship using SDC labels performs better than EDC labels for processing XML queries.
Article Preview
Top

1. Introduction

XML (World Wide Web Consortium [W3C], 2008) is the widely used open standard for content representation and dissemination over the Internet. XML is the mostly followed data format to exchange data or information between incompatible systems. XML is very famous for its flexible and adaptable structure. This leads to the user to define their own structure based on the requirement. XML document is extensively used in various real-world application areas (Ashish, & Maluf, 2009; Maluf, Bell, Ashish, Knight, & Tran, 2005; Singh, 2007) like e-commerce, social networks, research communities, healthcare, enterprises, government and private organizations, etc., and the file size ranges from KB (KiloBytes) to EB (ExaBytes). XML big data is a recent trending research area. XML document plays a predominant role in publish/subscribe system (Datta, Gradinariu, Raynal, & Simon, 2003; Kundu, & Bertino, 2008) that efficiently disseminates the selective XML content to different subscribed users. Publish/subscribe system basically follows service oriented architecture (SOA). SOA is an architecture that provide services and mostly adapted in large scale enterprises (Alwadain, Fielt, Korthaus, & Rosemann, 2013; Beydoun, Xu, & Sugumaran, 2013). SOA can be implemented using web services.

Publish/subscribe system (Sankari, & Bose, 2014) involves three entities namely producer, consumer and publisher. Producer is considered as the owner of the XML document. Producer disseminates the selective content of an XML document to the subscribed consumers through the publisher. To assure the confidentiality and integrity of the XML document content to be disseminated, producer has to securely label, encode and encrypt the XML document. Consumers who are authorized for an XML document subscribes to the producer. Subscribed consumers receive secure labels for their accessible XML content and credentials for authentication and decryption from the producer. Producer disseminates the securely labeled, encoded and encrypted selective XML content to the publisher. A third-party usually called publisher or message broker receives the encrypted XML content with the subscribed consumers details from the producer. Publisher disseminates the encrypted the XML content to the respective subscribed consumers based on their request. Subscribed consumer receives the encrypted XML content and decrypts the XML content.

Producer needs to label the XML document to uniquely identify the XML content. To accomplish this, an XML document can be viewed as an XML tree by following a standard called document object model (DOM). DOM (W3C, 2015) allows to visualize the XML document as XML tree by exploiting the hierarchical structural relationship existing in the XML document. Elements, attributes, content, etc., present in an XML document are usually represented as nodes in the XML tree. An XML labeling scheme is followed to uniquely label every node of an XML tree. Hence, an XML label uniquely identifies every node in the XML tree. The basic requirements of an XML labeling scheme are minimum label size, efficient labeling time and every label has to preserve the structural relationships existing among the nodes of an XML tree. Document order (DO), sibling, parent-child (PC), ancestor-descendant (AD) and lowest common ancestor (LCA) are the structural relationships that normally exist between the nodes of an XML tree. XML label acts as a key to distinguish the content of an XML document. Producer sends the XML labels that are additional information apart from the actual XML content to the subscribed consumers. From these labels, consumer can deduct structural information of an XML document that the producer has. Therefore, any consumer can become an internal attacker and can exploit this information leakage to perform any security attack. Hence, producer prefers a secure XML labeling scheme that retains basic features of a labeling scheme and prevents information leak by assuring secure content dissemination. Enhanced Dewey coding (Sankari, & Bose, 2013) and secure Dewey coding (Sankari, & Bose, 2014) are the two recent secure XML labeling schemes proposed for publish/subscribe system.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024)
Volume 19: 1 Issue (2023)
Volume 18: 4 Issues (2022): 3 Released, 1 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing