On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
XPath queries on streaming data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Texquery: a full-text search extension to xquery
Proceedings of the 13th international conference on World Wide Web
Efficient processing of XML twig queries with OR-predicates
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Semantic querying of tree-structured data sources using partially specified tree patterns
Proceedings of the 14th ACM international conference on Information and knowledge management
An Efficient XPath Query Processor for XML Streams
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Forward node-selecting queries over trees
ACM Transactions on Database Systems (TODS)
Efficient algorithms for evaluating xpath over streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Identifying meaningful return information for XML keyword search
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XSEarch: a semantic search engine for XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Evaluation of partial path queries on xml data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Assigning semantics to partial tree-pattern queries
Data & Knowledge Engineering
Efficient Evaluation of Generalized Tree-Pattern Queries with Same-Path Constraints
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Answering XML queries using materialized views revisited
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient evaluation of generalized tree-pattern queries on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Unified structure and content search for personal information management systems
Proceedings of the 14th International Conference on Extending Database Technology
Examining the impact of data-access cost on XML twig pattern matching
Information Sciences: an International Journal
Efficient evaluation of partial path queries over a XML compact storage structure
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
A survey on XML streaming evaluation techniques
The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing XML queries: Bitmapped materialized views vs. indexes
Information Systems
Hi-index | 0.00 |
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patterns or tree-patterns. Requirements in flexible querying of XML data have motivated recently the introduction of query languages that allow a partial specification of path-patterns in a query. In this paper, we focus on the efficient evaluation of partial path queries, a generalization of path pattern queries. Our approach explicitly deals with repeated labels (that is, multiple occurrences of the same label in a query). We show that partial path queries can be represented as rooted dags for which a topological ordering of the nodes exists. We present three algorithms for the efficient evaluation of these queries under the indexed streaming evaluation model. The first one exploits a structural summary of data to generate a set of path-patterns that together are equivalent to a partial path query. To evaluate these path-patterns, we extend PathStack so that it can work on path-patterns with repeated labels. The second one extracts a spanning tree from the query dag, uses a stack-based algorithm to find the matches of the root-to-leaf paths in the tree, and merge-joins the matches to compute the answer. Finally, the third one exploits multiple pointers of stack entries and a topological ordering of the query dag to apply a stack-based holistic technique. An analysis of the algorithms and extensive experimental evaluation shows that the holistic algorithm outperforms the other ones.