Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
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
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Evaluation of partial path queries on xml data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Efficient evaluation of generalized path pattern queries on XML data
Proceedings of the 17th international conference on World Wide Web
Evaluating partial tree-pattern queries on XML streams
Proceedings of the 17th ACM conference on Information and knowledge management
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
Efficient evaluation of generalized tree-pattern queries on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Processing and Evaluating Partial Tree Pattern Queries on XML Data
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
XML has become an industry standard for data representation and exchange of voluminous data among heterogeneous sources in a distributed environment. There are many ways to query a XML database. Some of the commonly used query languages are Xpath, Xquery, etc. In order to query a XML database, the users should have a proper knowledge of the XML database structure as well as the syntax of the query language that is used. If the users have only partial knowledge of the XML database and are not aware of query languages, partial path query language which was introduced recently can be used. Partial path queries are a subclass of XPath queries. Three algorithms such as Index Path, Partial MJ and Partial Path Stack were implemented over an index streaming model in order to retrieve all path solutions for the partial path query. The storage space required for the index streaming model is large and also the process of evaluating the partial path query using the existing algorithms is complex. To overcome these problems, the PQUICX (Partial Path Pattern Queries over QUICX) algorithm is proposed in this paper. The proposed algorithm evaluates partial path queries over a compact XML storage structure, QUICX (Query and Update Support for Indexed and Compressed XML). Partial path queries are evaluated using the meta table of the QUICX. The possible path solutions are retrieved by the method of path and relationship (parent/child-ancestor/descendant) checking. Also users can retrieve values for the path solutions from the containers of the QUICX. PQUICX algorithm has proved to be efficient in terms of memory requirements and execution time of the query as well.