Parallel XPath query based on cost optimization
- 24 September 2021
- journal article
- research article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (4) , 5420-5449
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of Fujian Province (2018J01538, 2020J01697)
- Open Fund of Digital Fujian Big Data Modeling and Intelligent Computing Institute (db)
This publication has 26 references indexed in Scilit:
- Matrix-Based XML Stream Processing Using a GPU2015
- Multi-Core Processing of XML Twig PatternsIEEE Transactions on Knowledge and Data Engineering, 2014
- A Dynamic Load-balancing Scheme for XPath Queries Parallelization in Shared Memory Multi-core SystemsJournal of Computers, 2014
- A Data Parallel Algorithm for XML DOM Parsing2009
- Navigational XPathACM SIGMOD Record, 2007
- A relative cost model for XQuery2007
- Predicting the Cost and Benefit of Adapting Data Parallel Applications in ClustersJournal of Parallel and Distributed Computing, 2002
- On supporting containment queries in relational database management systemsACM SIGMOD Record, 2001
- Semistructured data1997
- Strategies for dynamic load balancing on highly parallel computersIEEE Transactions on Parallel and Distributed Systems, 1993