|
|
|
     |
                                     |
Return to XML Indexing and Compression
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this paper, we propose ViST, a novel index structure for searching XML documents. By representing both XML documents and XML queries in structure-encoded sequences, we show that querying XML data is equivalent to finding sub- sequence matches. Unlike index methods that disassemble a query into multiple sub-queries, and then join the results of these sub-queries to provide the final answers, ViST uses tree structures as the basic unit of query to avoid expensive join operations. Furthermore, ViST provides a unified index on both content and structure of the XML documents, hence it has a performance advantage over methods indexing either just content or structure. ViST supports dynamic index update, and it relies solely on B+Trees without using any specialized data structures that are not well supported by DBMSs. Our experiments show that ViST is effective, scalable, and efficient in supporting structural queries.
@inproceedings {DBLP:conf/sigmod/WangPFY03, author = {Haixun Wang and Sanghyun Park and Wei Fan and Philip S. Yu}, booktitle = {SIGMOD Conference}, title = {ViST: A Dynamic Index Method for Querying XML Data by Tree Structures.}, pages = {110-121}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#WangPFY03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r05p01.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
