Programming and Computer Software

, Volume 32, Issue 1, pp 8–18 | Cite as

SLS: A numbering scheme for large XML documents

  • N. A. Aznauryan
  • S. D. Kuznetsov
  • L. G. Novak
  • M. N. Grinev
Article

Abstract

In view of the efficiency requirements for query and update processing in XML databases, implementation of the robust node labeling (numbering) scheme becomes an increasingly important research issue. In order to process XML queries efficiently, it is necessary to detect the ancestor-descendant relationship between the nodes and restore the sequence order of nodes in the document. To solve this problem, the technique of labeling the document nodes is used. As a result, the so-called numbering scheme is created. The nodes of the documents are labeled with certain unique identifiers. Comparing these identifiers, one can restore the sequence order of the nodes and to establish the hierarchical relationships. In this paper, we give a survey of the most efficient numbering schemes and introduce a numbering scheme proposed by the authors and employed in the Sedna DBMS [1].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Grinev, M., Kuznetsov, S., and Fomichev, A., XMLDBMS Sedna: Specific Features and Variants of Use, Otkrytye sistemy, 2004, no. 8, pp. 36–43.Google Scholar
  2. 2.
    Christophides, V., Plexousakis, D., Scholl, M., and Tourtounis, S., On Labeling Schemes for the Semantic Web, Proc. of WWWs’2003, Budapest, 2003, pp. 544–555.Google Scholar
  3. 3.
    Amagasa, T., Yoshikawa, M., and Uemura, S., ORS: A Robust Numbering Scheme for XML Documents, ICDE 2003, 2003, pp. 705–707.Google Scholar
  4. 4.
    Deschler, K. and Rundensteiner, E., MASS: A Multi-Axis Storage Structure for Large XML Documents, Proc. of the Twelfth Int. Conf. on Information and Knowledge Management, 2003, New Orleans.Google Scholar
  5. 5.
    Wirth, N., Type Extensions, ACM Trans. Programming Languages Systems, 1988, vol. 10, no. 2, pp. 204–214.MATHGoogle Scholar
  6. 6.
    Online Computer Library Center. Dewey Decimal Classification, www.oclc.org/dewey/.Google Scholar
  7. 7.
    Dietz, P.F., Maintaining Order in a Linked List, Proc. of the Fourteenth Annual ACM Symp. on Theory of Computing (STOCs’82), 1982, pp. 122–127.Google Scholar
  8. 8.
    Dietz, P.F. and Steator, D.D., Two Algorithms for Maintaining Order in a List, Proc. of the Sixteenth Annual ACM Symp. on Theory of Computing (STOCs’87), 1987, pp. 365–372.Google Scholar
  9. 9.
    Argawal, R., Borgida, A., and Jagadish, H.V., Efficient Management of Transitive Relations in Large Data and Knowledge Bases, Proc. of the SIGMOD Int. Conf. on Management of Data, 1989, pp. 253–262.Google Scholar
  10. 10.
    Li, Q. and Moon, B., Indexing and Querying XML Data for Regular Path Expressions, Proc. of the 27th Int. Conf. on Very Large Data Bases (VLDBs’02), 2001.Google Scholar

Copyright information

© Pleiades Publishing, Inc. 2006

Authors and Affiliations

  • N. A. Aznauryan
    • 1
  • S. D. Kuznetsov
    • 1
  • L. G. Novak
    • 1
  • M. N. Grinev
    • 1
  1. 1.Institute of System ProgrammingRussian Academy of SciencesMoscowRussia

Personalised recommendations