Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Estimating the Selectivity of XML Path Expressions for Internet Scale Applications
 

Summary: Estimating the Selectivity of XML Path Expressions
for Internet Scale Applications
Ashraf Aboulnaga Alaa R. Alameldeen Jeffrey F. Naughton
University of Wisconsin - Madison
{ashraf,alaa,naughton}@cs.wisc.edu
Abstract
Data on the Internet is increasingly presented in
XML format. This enables novel applications that
pose queries over "all the XML data on the Inter-
net." Queries over XML data use path expressions
to navigate through the structure of the data, and
optimizing these queries requires estimating the
selectivity of these path expressions. In this pa-
per, we propose two techniques for estimating the
selectivity of simple XML path expressions over
complex large-scale XML data as would be han-
dled by Internet-scale applications: path trees and
Markov tables. Both techniques work by summa-
rizing the structure of the XML data in a small
amount of memory and using this summary for

  

Source: Aboulnaga, Ashraf - School of Computer Science, University of Waterloo
Naughton, Jeffrey F. - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences