Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Relationally Mapping XML Queries For Scalable Rebecca J. Cathey, Steven M. Beitzel, Eric C. Jensen, David Grossman, Ophir Frieder
 

Summary: Relationally Mapping XML Queries For Scalable
XML Search
Rebecca J. Cathey, Steven M. Beitzel, Eric C. Jensen, David Grossman, Ophir Frieder
Information Retrieval Laboratory
Illinois Institute of Technology
{cathey, beitzel, jensen, grossman, frieder}@ ir.iit.edu
Abstract--The growing trend of using XML to share security
data requires scalable technology to effectively manage the
volume and variety of data. Although a wide variety of methods
exist for storing and searching XML, the two most common
techniques are conventional tree-based approaches and relational
approaches. Tree-based approaches represent XML as a tree
and use indexes and path join algorithms to process queries.
In contrast, the relational approach seeks to utilize the power
of a mature relational database to store and search XML. This
method relationally maps XML queries to SQL and reconstructs
the XML from the database results.
We use the XBench benchmark to compare the scalability of
the SQLGenerator, our relational approach, with eXist, a popular
tree-based approach.

  

Source: Argamon, Shlomo - Department of Computer Science, Illinois Institute of Technology

 

Collections: Computer Technologies and Information Sciences