|
|
|
                                          
|
Return to Session 4: XML Query Processing
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. The existent approaches for evaluating queries over tree structured data (i.e. data whose underlying structure is a tree) are not directly applicable when the data is modeled as a random graph. Moreover, they cannot be applied when structural summaries are employed and, to the best of our knowledge, no analogous techniques have been reported for this case either. As a result, the potential of structural summaries is not fully exploited. In this paper, we investigate query evaluation techniques applicable to graph-structured data. We propose efficient algorithms for the case of directed acyclic graphs, which appear in many real world situations. We then tailor our approaches to handle other directed graphs as well. Our experimental evaluation reveals the advantages of our solutions over existing methods for graph-structured data.
@inproceedings {DBLP:conf/webdb/VagenaMT04, author = {Zografoula Vagena and Mirella M. Moro and Vassilis J. Tsotras}, title = {Twig Query Processing over Graph-Structured XML Data}, pages = {43-48}, ee = {http://webdb2004.cs.columbia.edu/papers/4-1.pdf}, booktitle = {Seventh International Workshop on the Web and Databases}, month = Jun, year = 2004, crossref = {conf/webdb/2004} }  ©2005 Association for Computing Machinery |
