Nonlinear pattern matching in trees
Journal of the ACM (JACM)
Tree subsumption: reasoning with outlines
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Rule-assisted prefetching in Web-server caching
Proceedings of the ninth international conference on Information and knowledge management
Web log data warehousing and mining for intelligent web caching
Data & Knowledge Engineering - Building web warehouse
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
APEX: an adaptive path index for XML data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Covering indexes for branching path queries
Proceedings of the 2002 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
XCache: a semantic caching system for XML queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Discovering Structural Association of Semistructured Data
IEEE Transactions on Knowledge and Data Engineering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Semantic caching of Web queries
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Quer Patterns from XML Queries
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
TreeFinder: a First Step towards XML Data Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
2PXMiner: an efficient two pass mining of frequent XML query patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Finding hot query patterns over an XQuery stream
The VLDB Journal — The International Journal on Very Large Data Bases
XML Data Stores: Emerging Practices
IEEE Internet Computing
Indexing Useful Structural Patterns for XML Query Processing
IEEE Transactions on Knowledge and Data Engineering
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Exploit sequencing to accelerate hot XML query pattern mining
Proceedings of the 2006 ACM symposium on Applied computing
Answering tree pattern queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
XML structural delta mining: issues and challenges
Data & Knowledge Engineering - Special issue: ER 2003
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Discovering Frequent Agreement Subtrees from Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
Efficient mining of frequent XML query patterns with repeating-siblings
Information and Software Technology
Proceedings of the 2nd international conference on Scalable information systems
Efficient mining of frequent closed XML query pattern
Journal of Computer Science and Technology
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Tree model guided candidate generation for mining frequent subtrees from XML documents
ACM Transactions on Knowledge Discovery from Data (TKDD)
XML fragment caching for large-scale mobile commerce applications
Proceedings of the 10th international conference on Electronic commerce
Improving XML Querying with Maximal Frequent Query Patterns
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Bottom-up discovery of frequent rooted unordered subtrees
Information Sciences: an International Journal
On rewriting XPath queries using views
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Incremental sequence-based frequent query pattern mining from XML queries
Data Mining and Knowledge Discovery
On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Matching subsequences in trees
Journal of Discrete Algorithms
A materialized view selection technique for XPath queries
ECC'08 Proceedings of the 2nd conference on European computing conference
Segmentation-Based Caching for Mobile Auctions
Proceedings of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008
A semantic cache framework for secure XML queries
Journal of Computer Science and Technology
Tree pattern mining with tree automata constraints
Information Systems
BUXMiner: an efficient bottom-up approach to mining XML query patterns
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
BNCOD'07 Proceedings of the 24th British national conference on Databases
Efficient XML query processing in RDBMS using GUI-driven prefetching in a single-user environment
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
CSC: supporting queries on compressed cached XML
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
On the expressiveness of generalization rules for XPath query relaxation
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Information extraction using XPath
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Archiving the web using page changes patterns: a case study
Proceedings of the 11th annual international ACM/IEEE joint conference on Digital libraries
Union rewritings for XPath fragments
Proceedings of the 15th Symposium on International Database Engineering & Applications
IMB3-Miner: mining induced/embedded subtrees by constraining the level of embedding
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
The tree inclusion problem: in optimal space and faster
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Caching frequent XML query patterns
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Matching subsequences in trees
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Search tree patterns for mobile and distributed XML processing
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Mining positive and negative association rules from XML query patterns for caching
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
A logic-based approach to cache answerability for XPath queries
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Rewriting XPath queries using materialized XPath views
Journal of Computer and System Sciences
Materialized view selection for XQuery workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
SOA Performance Enhancement Through XML Fragment Caching
Information Systems Research
Answering queries using views over probabilistic XML: complexity and tractability
Proceedings of the VLDB Endowment
Mining Induced/Embedded Subtrees using the Level of Embedding Constraint
Fundamenta Informaticae
Managing a fragmented XML data cube with oracle and timesten
Proceedings of the fifteenth international workshop on Data warehousing and OLAP
Hi-index | 0.00 |
As XML becomes ubiquitous, the efficient retrieval of XML data becomes critical. Research to improve query response time has been largely concentrated on indexing paths, and optimizing XML queries. An orthogonal approach is to discover frequent XML query patterns and cache their results to improve the performance of XML management systems. In this paper, we present an efficient algorithm called FastXMiner, to discover frequent XML query patterns. We develop theorems to prove that only a small subset of the generated candidate patterns needs to undergo expensive tree containment tests. In addition, we demonstrate how the frequent query patterns can be used to improve caching performance. Experiments results show that FastXMiner is efficient and scalable, and caching the results of frequent patterns significantly improves the query response time.