关键词: 可扩展标示语言, PSTP查询, 扩展Dewey

Abstract: When extracting desired information from XML data using partially specified twig pattern (PSTP) queries, users can flexibly use any structural constraints to specify their query semantics, therefore different kinds of users, i.e., users who fully understand or know nothing about or partially understand the underlying structure, can search desired information based on their familiarity with the structure of given XML data. This paper proposes an efficient algorithm, EDPS, based on extended Dewey labeling scheme to process a general PSTP query efficiently by just scanning the input elements only once. The experimental results on various datasets indicate that this method performs significantly better than existing ones when processing twig queries, PSTP queries without “*” nodes and PSTP queries containing “*” nodes.

Key words: Extensible Markup language (XML), partially specified twig pattern (PSTP) queries, extended Dewey