On the public citation graph
Efficient mining of frequent XML query patterns with repeating-siblings
0 signed · 55 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45372-5_2openalex-snapshot
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
inferredcites →https://doi.org/10.1007/3-540-62222-5_39openalex-snapshot
Selection of views to materialize in a data warehouse
inferredcites →https://doi.org/10.1007/978-3-540-45228-7_11openalex-snapshot
Building XML Data Warehouse Based on Frequent Patterns in User Queries
inferredcites →https://doi.org/10.1007/bf00962235openalex-snapshot
Knowledge discovery from structural data
inferredcites →https://doi.org/10.1007/s10618-005-0003-9openalex-snapshot
Finding Frequent Patterns in a Large Sparse Graph*
inferredcites →https://doi.org/10.1007/s11280-006-8557-zopenalex-snapshot
Answering XML Queries Using Path-Based Indexes: A Survey
inferredcites →https://doi.org/10.1016/b978-012722442-8/50015-xopenalex-snapshot
Efficient Mining of XML Query Patterns for Caching
inferredcites →https://doi.org/10.1093/bioinformatics/bti1049openalex-snapshot
Mining coherent dense subgraphs across massive biological networks for functional discovery
inferredcites →https://doi.org/10.1109/69.846290openalex-snapshot
Discovering structural association of semistructured data
inferredcites →https://doi.org/10.1109/dasfaa.2003.1192401openalex-snapshot
Mining frequent query patterns from XML queries
inferredcites →https://doi.org/10.1109/icacte.2008.100openalex-snapshot
Metagraph-Based Substructure Pattern Mining
inferredcites →https://doi.org/10.1109/icde.2004.1320039openalex-snapshot
Unordered tree mining with applications to phylogeny
inferredcites →https://doi.org/10.1109/icde.2005.86openalex-snapshot
Mining Closed Relational Graphs with Connectivity Constraints
inferredcites →https://doi.org/10.1109/icde.2006.141openalex-snapshot
SketchTree: Approximate Tree Pattern Counts over Streaming Labeled Trees
inferredcites →https://doi.org/10.1109/icdm.2002.1183885openalex-snapshot
Mining molecular fragments: finding relevant substructures of molecules
inferredcites →https://doi.org/10.1109/icdm.2002.1183987openalex-snapshot
TreeFinder: a first step towards XML data mining
inferredcites →https://doi.org/10.1109/icdm.2002.1184038openalex-snapshot
gSpan: graph-based substructure pattern mining
inferredcites →https://doi.org/10.1109/icdm.2003.1250964openalex-snapshot
Indexing and mining free trees
inferredcites →https://doi.org/10.1109/icdm.2003.1250974openalex-snapshot
Efficient mining of frequent subgraphs in the presence of isomorphism
inferredcites →https://doi.org/10.1109/icdm.2006.88openalex-snapshot
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
inferredcites →https://doi.org/10.1137/0206053openalex-snapshot
An Analysis of a Good Algorithm for the Subtree Problem
inferredcites →https://doi.org/10.1137/1.9781611972726.10openalex-snapshot
Efficient Substructure Discovery from Large Semi-structured Data
inferredcites →https://doi.org/10.1137/1.9781611972726.11openalex-snapshot
Discovering Frequent Substructures from Hierarchical Semi-structured Data
inferredcites →https://doi.org/10.1137/1.9781611972740.32openalex-snapshot
Finding Frequent Patterns in a Large Sparse Graph
inferredcites →https://doi.org/10.1137/1.9781611972764.74openalex-snapshot
Discovering Frequent Tree Patterns over Data Streams
inferredcites →https://doi.org/10.1145/1081870.1081908openalex-snapshot
Mining closed relational graphs with connectivity constraints
inferredcites →https://doi.org/10.1145/1141277.1141400openalex-snapshot
Exploit sequencing to accelerate hot XML query pattern mining
inferredcites →https://doi.org/10.1145/543613.543620openalex-snapshot
Algorithmics and applications of tree and graph searching
inferredcites →https://doi.org/10.1145/543613.543623openalex-snapshot
Containment and equivalence for an XPath fragment
inferredcites →https://doi.org/10.1145/773153.773161openalex-snapshot
The view selection problem for XML content based routing
inferredcites →https://doi.org/10.1145/775047.775058openalex-snapshot
Efficiently mining frequent trees in a forest
inferredcites →https://doi.org/10.1145/956699.956720openalex-snapshot
Extracting association rules from XML documents using XQuery
inferredcites →https://doi.org/10.1613/jair.43openalex-snapshot
Substructure Discovery Using Minimum Description Length and Background Knowledge
inferredcites →https://doi.org/10.48550/arxiv.cs/9402102openalex-snapshot
Substructure Discovery Using Minimum Description Length and Background Knowledge
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-03958-4_3openalex-snapshot
Applying Caching Capabilities to Inference Applications Based on Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-642-37932-1_7openalex-snapshot
Using Caching Techniques to Improve the Performance of Rule-Based Inference Applications in Semantic Technologies
inferred← citeshttps://doi.org/10.1007/s10796-015-9561-6openalex-snapshot
XHQE: A hybrid system for scalable selectivity estimation of XML queries
inferred← citeshttps://doi.org/10.1007/s11280-014-0311-3openalex-snapshot
Improved selectivity estimator for XML queries based on structural synopsis
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.07.011openalex-snapshot
An efficient algorithm of frequent XML query pattern mining for ebXML applications in e-commerce
inferred← citeshttps://doi.org/10.1016/j.ins.2008.08.020openalex-snapshot
Bottom-up discovery of frequent rooted unordered subtrees
inferred← citeshttps://doi.org/10.1109/iccea.2010.205openalex-snapshot
A Novel Top-Down Algorithm of Frequent XML Query Pattern Mining
inferred← citeshttps://doi.org/10.1109/iiai-aai.2016.234openalex-snapshot
A Parallel Encoding Method of XML User Query Patterns
inferred← citeshttps://doi.org/10.1142/s021819401450034xopenalex-snapshot
A Sliding-Window Method to Discover Recent Frequent Query Patterns from XML Query Streams
inferred← citeshttps://doi.org/10.14257/ijdta.2014.7.3.11openalex-snapshot
Mining Sequential Trees in a Tree Sequence Database
inferred← citeshttps://doi.org/10.4018/978-1-4666-2455-9.ch044openalex-snapshot
Frequent Pattern Discovery and Association Rule Mining of XML Data
inferred← citeshttps://doi.org/10.4018/978-1-61350-356-0.ch011openalex-snapshot
Frequent Pattern Discovery and Association Rule Mining of XML Data
inferred← citeshttps://doi.org/10.4304/jmm.9.8.1011-1016openalex-snapshot
Massive XML Data Mining in Cloud Computing Environment
inferred← citeshttps://doi.org/10.5897/ajbm2011.644openalex-snapshot
An efficient XML query pattern mining algorithm for ebXML applications in e-commerce
inferred← citeshttps://doi.org/10.70675/55d31defz0fbcz4fb1zaf8dz0348c1a154faopenalex-snapshot
Active XML Data Warehouses for Intelligent, On-line Decision Support
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.