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
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
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
TWIX: twig structure and content matching of selective queries using binary labeling
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
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
A Glance on Current XML Twig Pattern Matching Algorithms
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Fast Matching of Twig Patterns
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Pattern based processing of XPath queries
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Holistically Stream-based Processing Xtwig Queries
World Wide Web
XTCcmp: XQuery compilation on XTC
Proceedings of the VLDB Endowment
S3: Evaluation of tree-pattern XML queries supported by structural summaries
Data & Knowledge Engineering
Query ranking in probabilistic XML data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
XML Data Integration Using Fragment Join
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Metamodel-Based Optimisation of XPath Queries
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Principles of Holism for sequential twig pattern matching
The VLDB Journal — The International Journal on Very Large Data Bases
Essential Performance Drivers in Native XML DBMSs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
R-Programs: A Framework for Distributing XML Structural Joins across Function Calls
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
OTwig: An Optimised Twig Pattern Matching Approach for XML Databases
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A time optimal algorithm for evaluating tree pattern queries
Proceedings of the 2010 ACM Symposium on Applied Computing
A holistic algorithm for efficiently evaluating xtwig joins
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Executing parallel TwigStack algorithm on a multi-core system
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Towards unifying advances in twig join algorithms
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Indexing and querying XML using extended Dewey labeling scheme
Data & Knowledge Engineering
Proceedings of the VLDB Endowment
TwigLinkedList: improvement of TwigList
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Key concepts for native XML processing
From active data management to event-based systems and more
WSEAS Transactions on Computers
S3: Processing tree-pattern XML queries with all logical operators
Data & Knowledge Engineering
Matching top-k answers of twig patterns in probabilistic XML
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Chimera: stream-oriented XML filtering/querying engine
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Examining the impact of data-access cost on XML twig pattern matching
Information Sciences: an International Journal
A cloud computing implementation of XML indexing method using hadoop
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part III
Twig pattern matching running on XML streams
APWeb'12 Proceedings of the 14th international conference on Web Technologies and Applications
A compact XML storage scheme supporting efficient path querying
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Efficient management of uncertainty in XML schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
XML query processing: efficiency and optimality
Proceedings of the 16th International Database Engineering & Applications Sysmposium
CIS-X: A compacted indexing scheme for efficient query evaluation of XML documents
Information Sciences: an International Journal
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Twig pattern matching problem has been widely studied in recent years. Give an XML tree τ. A twig-pattern matching query, Q, represented as a query tree, is to find all the occurrences of such twig pattern in τ. Previous works like HolisticTwig and TJFast decomposed the twig pattern into single paths from root to leaves, and merged all the occurrences of such path-patterns to find the occurrences of the twig-pattern matching query, Q. Their techniques can effectively prune impossible path-patterns to avoid producing a large amount of intermediate results. But they still need to merge path-patterns which occurs high computational cost. Recently, Twig2Stack was proposed to overcome this problem using hierarchical-stacks to further reduce the merging cost. But, due to the complex hierarchical-stacks Twig2Stack used, Twig2Stack may end up many random accesses in memory, and need to load the whole XML tree into memory in the worst case. In this paper, we propose a new algorithm, called TwigList, which uses simple lists. Both time and space complexity of our algorithm are linear with respect to the total number of pattern occurrences and the size of XML tree. In addition, our algorithm can be easily modified as an external algorithm. We conducted extensive experimental studies using large benchmark and real datasets. Our algorithm significantly outperforms the up-to-date algorithm.