loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2
Measuring the Scalability of Relationally Mapped Semistructured Queries
Las Vegas, Nevada
April 05-April 07
ISBN: 0-7695-2108-8
Rebecca J. Cathey, Illinois Institute of Technology, Chicago
Steven M. Beitzel, Illinois Institute of Technology, Chicago
Eric C. Jensen, Illinois Institute of Technology, Chicago
Angelo J. Pilotto, Illinois Institute of Technology, Chicago
David Grossman, Illinois Institute of Technology, Chicago
The explosive growth of XML has led to an increasing need for scalable XML retrieval systems. Our XML retrieval system, the SQLGenerator, stores XML of any schema in a fixed schema relational database and supports a full-featured semistructured query language, XML-QL, through optimized translation of its semantics to relational SQL queries. This paper examines the scalability of this approach with respect to increasing data size. We index four XML collections ranging in size from 500MB to 2GB that were generated using a standard XML generator, XBench. We then compare the execution times of 11 standard XBench queries, covering a wide range of semistructured query features, whose semantics were directly translatable from their original XQuery language to XML-QL. Although it is difficult to estimate the theoretical baseline for scalability of these query features in an RDBMS, many of the queries' runtimes grow linearly with respect to the size of the document collection.
Citation:
Rebecca J. Cathey, Steven M. Beitzel, Eric C. Jensen, Angelo J. Pilotto, David Grossman, "Measuring the Scalability of Relationally Mapped Semistructured Queries," itcc, vol. 2, pp.219, International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.