• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Indexing and Querying XML Data for Regular Path Expressions (2001)

Cached

  • Download as a PDF

Download Links

  • [www.dia.uniroma3.it]
  • [www.cse.iitb.ac.in]
  • [www.cs.arizona.edu]
  • [www.oasis-open.org]
  • [xml.coverpages.org]
  • [www.cs.arizona.edu]
  • [www.cs.ucr.edu]
  • [pike.psu.edu]
  • [dsl.serc.iisc.ernet.in]
  • [www.cs.arizona.edu]
  • [www.cs.arizona.edu]
  • [nike.psu.edu]
  • [www.vldb.org]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Quanzhong Li , Bongki Moon
Venue:IN VLDB
Citations:343 - 9 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Li01indexingand,
    author = {Quanzhong Li and Bongki Moon},
    title = {Indexing and Querying XML Data for Regular Path Expressions},
    booktitle = {IN VLDB},
    year = {2001},
    pages = {361--370},
    publisher = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languages have been proposed, and the common feature of the languages is the use of regular path expressions to query XML data. This poses a new challenge concerning indexing and searching XML data, because conventional approaches based on tree traversals may not meet the processing requirements under heavy access requests. In this paper, we propose a new system for indexing and storing XML data based on a numbering scheme for elements. This numbering scheme quickly determines the ancestor-descendant relationship between elements in the hierarchy of XML data. We also propose several algorithms for processing regular path expressions, namely, (1) ##-Join for searching paths from an element to another, (2) ##-Join for scanning sorted elements and attributes to find element-attribute pairs, and (3) ##-Join for finding Kleene-Closure on repeated paths or elements. The ##-Join algorithm is highly effective particularly for searching paths that are very long or whose lengths are unknown. Experimental results from our prototype system implementation show that the proposed algorithms can process XML queries with regular path expressions by up to an or- # This work was sponsored in part by National Science Foundation CAREER Award (IIS-9876037) and Research Infrastructure program EIA-0080123. The authors assume all responsibility for the contents of the paper. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its...

Keyphrases

xml data    regular path expression    numbering scheme    conventional approach    vldb copyright notice    xml query    direct commercial advantage    several xml query language    common feature    sorted element    national science foundation career award    new system    heavy access request    research infrastructure program eia-0080123    several algorithm    data representation    tree traversal    element-attribute pair    prototype system implementation show    join algorithm    processing requirement    new challenge    repeated path    experimental result    ancestor-descendant relationship   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University