Report ID
2005-11
Report Authors
S. Alireza Aghili, Hua-Gang Li, Divyakant Agrawal, and Amr El Abbadi
Report Date
Abstract
Structural queries specify complex predicates on the content and the structure of the elements of tree-structured XML documents. Recent works have typically applied top-down decomposition of the twig patterns into (i) parent-child or ancestor-descendant relationships, or (ii) path expression queries, and then followed by a join operation to reconstruct matched twig patterns. This demonstration system is the implementation prototype of an efficient heuristic-based bottom-up approach named MARS (Matching And Ranking System for XML structure queries), for matching and ranking of structural query patterns for XML query processing. An efficient nearest common ancestor labeling scheme is applied to utilize fast bottom-up construction of the subtree matches from the potential keywords. MARS considers both the content and structure of queries and incorporates a variation of IR-based relevance ranking to report the top-k ranked results. The graphical user interface of MARS provides an interactive visualization of the twig query discovery.
Document
2005-11.pdf114.98 KB