S. Sankari
Editorial Notes
NOTICE OF CONCERN: ACM has received evidence that casts doubt on the integrity of the peer review process for the ICIA 2016 Conference. As a result, ACM is issuing a Notice of Concern for all papers published and strongly suggests that the papers from this Conference not be cited in the literature until ACM's investigation has concluded and final decisions have been made regarding the integrity of the peer review process for this Conference.
ABSTRACT
XML is widely used to store and share information over the World Wide Web. A labeling scheme is required to efficiently store, process and query an XML document in data management systems. XML documents are assumed as XML trees then a labeling scheme is applied to uniquely identify the XML nodes effectively through the labels. Efficiency of a labeling scheme is measured based on the memory space required to store the labels and the time taken for labeling the XML nodes. Also, labels should preserve the structural relationship present between the nodes of an XML document to answer structural queries. Secure XML labeling schemes are exclusively used for secure content dissemination in publish/subscribe systems. Along with the basic properties of a labeling scheme, a secure labeling scheme should prevent structural information leakage exists in labels. In this paper, we present the recently available secure XML labeling schemes with the fundamental labeling schemes. Additionally, we also analyze the labeling schemes efficiency based on memory space, labeling time and the structural relationships they support.
- Dietz, P.F. 1982. Maintaining order in a linked list. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC '82). ACM, New York, NY, USA, 122--127. DOI=http://dx.doi.org/10.1145/800070.802184 Google Scholar
Digital Library
- Ko, H. K., Kim, M. J., and Lee, S. 2007. On the efficiency of secure XML broadcasting Inf. Sci. 177, 24 (December 2007), 5505--5521. DOI=http://dx.doi.org/10.1016/j.ins.2007.05.020 Google ScholarDigital Library
- Kundu, A. and Elisa, B. 2006. Secure dissemination of XML content using structure-based routing. In Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference (EDOC '06). IEEE Computer Society, Washington, DC, USA, 153--164. DOI=http://dx.doi.org/10.1109/EDOC.2006.46 Google ScholarDigital Library
- Kundu, A. and Elisa, B. 2008. A new model for secure dissemination of XML content. Trans. Sys. Man Cyber Part C 38, 3 (May 2008), 292--301. DOI=http://dx.doi.org/10.1109/TSMCC.2008.919213 Google ScholarDigital Library
- Sankari, S., and Bose, S. 2013. Efficient encoding of XML document for secure dissemination. In Proceedings of Fifth International Conference on Advanced Computing (ICoAC), Chennai, India, 565--570. DOI=http://dx.doi.org/10.1109/TCoAC.2013.6922013Google Scholar
- Sankari, S., and Bose, S. 2014. Secure XML labeling for efficient XML content dissemination. In Proceedings of Sixth International Conference on Advanced Computing (ICoAC), Chennai, India, 150--156. DOI=http://dx.doi.org/10.1109/TCoAC.2014.7229764Google Scholar
- Sankari, S., and Bose, S. 2015. Identifying efficient document order for XML queries using secure labeling schemes. In Proceedings of the First International Conference on Computational Methods & Software Engineering (CoMSE) Chennai, India, 229--238.Google Scholar
- Sankari, S., Bose, S., and Varghese, L. A. 2015. Effective performance analysis of lowest common ancestor computation in XML secure labeling schemes. International Journal of Applied Engineering Research, 10, 34, 27332--27335.Google Scholar
- Sankari, S., Bose, S., and Varghese, L. A. 2015. Measuring effective performance of secure labeling scheme for XML content distribution. Advances in Natural and Applied Sciences, 9(9 SE), 37--40.Google Scholar
- Tatarinov, I., Viglas, S. D., Beyer, K., Shanmugasundaram, J., Shekita, E., and Zhang, C. 2002. Storing and querying ordered XML using a relational database system. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD '02). ACM, New York, NY, USA, 204--215. DOI=http://dx.doi.org/10.1145/564691.564715 Google ScholarDigital Library
- University of Washington XML Data Repository {Online}. Available: http://www.cs.Washington.edu/research/xmldatasets/www/repository.htmlGoogle Scholar
- World Wide Web Consortium Extensible Markup Language (XML) 1.0 (Fifth Edition) {Online}. Available: http://www.w3.org/TR/xml/Google Scholar
- World Wide Web Consortium W3C DOM4 {Online}. Available: https://www.w3.org/TR/dom/Google Scholar
- World Wide Web Consortium XML Path Language (XPath) 3.0 {Online}. Available: https://www.w3.org/TR/xpath-30/Google Scholar
- World Wide Web Consortium XQuery 3.0: An XML Query Language {Online}. Available: https://www.w3.org/TR/xquery-30/Google Scholar
- World Wide Web Consortium. XQuery and XPath Data Model 3.0 {Online}. Available: https://www.w3.org/TR/xpath-datamodel-30/Google Scholar
- Zhang, C., Naughton, J., DeWitt, D., Luo, Q. and Lohman, G. 2001. On supporting containment queries in relational database management systems. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data (SIGMOD '01), ACM, New York, NY, USA, 425--436. DOI=http://dx.doi.org/10.1145/375663.375722 Google ScholarDigital Library
Recommendations
Efficient Identification of Structural Relationships for XML Queries using Secure Labeling Schemes
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 ...
Dynamic Labelling Scheme for XML Data Processing
OTM '08: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet SystemsExtensive research has been conducted on labelling schemes, however, most of proposed labelling schemes are costly due to the need of re-calculating or re-labelling existing nodes whenever XML documents being updated. In our view, an effective labelling ...
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationships are parent-child and ancestor-descendant, and finding all occurrences ...
Comments