Abstract
XML query processing based on labeling schemes has been proposed in the past several years. Based on labeling schemes, the structural relationships between XML nodes can be directly determined without the need of accessing the XML document. However, the existing labeling schemes have to re-label the pre-existing XML nodes or re-calculate the label values when a new node is inserted into the XML tree during an updating process. EXEL as a bit string based encoding and labeling scheme is able to remove the process of re-labeling for the pre-existing XML nodes efficiently. However, EXEL is unable to reuse the deleted labels for future node insertions. Also, another problem of EXEL is in the frequent skewed insertions where nodes always are inserted at a fixed place of an XML tree. In this case, the label size increases significantly. In this paper, we propose an algorithm to reuse the deleted labels for future node insertions and propose a strategy to solve the problem of frequent skewed insertion. The experimental results show that the proposed algorithm can reuse all the deleted labels for future insertions. Also, the proposed strategy can reduce the increment of label size in the case of frequent skewed insertions efficiently.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E., Yergeau, F.: Extensible Markup Language (XML) 1.0, 5th edn. W3C Recommendation (2008), http://www.w3.org/TR/REC-xml/
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proceedings of the 27th International Conference on Very Large Data Bases, pp. 361–370. Morgan Kaufmann, Roma (2001)
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. ACM SIGMOD Record Journal 30(2), 425–436 (2001)
Cohen, E., Kaplan, H., Milo, T.: Labeling Dynamic XML Trees. In: Proceedings of the 21th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 271–281. ACM Press, Madison (2002)
O’Neil, P., O’Neil, E., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: Insert-Friendly XML Node Labels. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 903–908. ACM Press, Paris (2004)
Tatarinov, I., Viglas, S.D., Beyer, K., Shanmugasundaram, J., Shekita, E., Zhang, C.: Storing and Querying Odered XML Using a Relational Database System. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 204–215. ACM Press, Madison (2002)
Wu, X., Lee, M.L., Hsu, W.: A Prime Number Labeling Scheme for Dynamic Ordered XML Trees. In: Proceedings of the 20th International Conference on Data Engineering (ICDE 2004), pp. 66–78. IEEE Press, Boston (2004)
Tatarinov, I., Ives, Z.G., Halevy, A.Y., Weld, D.S.: Updating XML. In: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, pp. 413–424. ACM Press, Santa Barbara (2001)
Ko, H.-K., Lee, S.: An Efficient Scheme to Completely Avoid Re-labeling in XML Updates. In: Aberer, K., Peng, Z., Rundensteiner, E.A., Zhang, Y., Li, X. (eds.) WISE 2006. LNCS, vol. 4255, pp. 259–264. Springer, Heidelberg (2006)
Min, J.-K., Lee, J., Chung, C.-W.: An Efficient XML Encoding and Labeling Method for Query Processing and Updating on Dynamic XML Data. Journal of Systems and Software 82(3), 503–515 (2009)
Amagasa, T., Yoshikawa, M., Uemura, S.: QRS: A Robust Numbering Scheme for XML Documents. In: Proceedings of the 19th International Conference on Data Engineering (ICDE 2003), pp. 705–707. IEEE Press, Bangalore (2003)
Li, C., Ling, T.W.: QED: A Novel Quaternary Encoding to Completely Avoid Re-Labeling in XML Updates. In: Proceedings of the 14th ACM International Conference on Information and Knowledge Management, pp. 501–508. ACM Press, Bremen (2005)
Silberstein, A., He, H., Yi, K., Yang, J.: BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data. In: Proceedings of the 21st International Conference on Data Engineering (ICDE 2005), pp. 285–296. IEEE Press, Tokyo (2005)
Min, J.-K., Lee, J., Chung, C.-W.: An Efficient Encoding and Labeling for Dynamic XML Data. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 715–726. Springer, Heidelberg (2007)
Li, C., Ling, T.W., Hu, M.: Efficient Processing of Updates in Dynamic XML Data. In: Proceedings of the 22nd International Conference on Data Engineering (ICDE 2006), p. 13. IEEE Press, Atlanta (2006)
Yun, J.-H., Chung, C.-W.: Dynamic Interval-Based Labeling Scheme for Efficient XML Query and Update Processing. Journal of Systems and Software 81(1), 56–70 (2008)
Ko, H.-K., Lee, S.: A Binary String Approach for Updates in Dynamic Ordered XML Data. IEEE Transactions on Knowledge and Data Engineering 22(4), 602–607 (2010)
Li, C., Ling, T.W., Hu, M.: Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 659–673. Springer, Heidelberg (2006)
Mirabi, M., Ibrahim, H., Mamat, A., Udzir, N.I., Fathi, L.: Controlling Label Size Increment of Efficient XML Encoding and Labeling Scheme in Dynamic XML Update. Journal of Computer Science 6(12), 1535–1540 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mirabi, M., Ibrahim, H., Udzir, N.I., Mamat, A. (2011). Label Size Increment of Bit String Based Labeling Scheme in Dynamic XML Updating. In: Ariwa, E., El-Qawasmeh, E. (eds) Digital Enterprise and Information Systems. DEIS 2011. Communications in Computer and Information Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22603-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-22603-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22602-1
Online ISBN: 978-3-642-22603-8
eBook Packages: Computer ScienceComputer Science (R0)