2006 | OriginalPaper | Buchkapitel
Efficient Processing of Multiple XML Twig Queries
verfasst von : Huanzhang Liu, Tok Wang Ling, Tian Yu, Ji Wu
Erschienen in: Database and Expert Systems Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data interchange has spawned great interest in techniques for filtering and content-based routing of XML data. In this paper, we aim to use the state-of-art holistic twig join technique to address multiple twig queries in a large scale XML database. We propose a new twig query technique which is specially tailored to match documents with large numbers of twig pattern queries. We introduce the
super-twig
to represent multiple twig queries. Based on the
super-twig
, we design a holistic twig join algorithm, called
MTwigStack
, to find all matches for multiple twig queries by scanning an XML document only once.