Abstract: Frequent substructure discovery from a collection of semi-structured objects can serve for storage, browsing, querying, indexing and ...
Dec 18, 2013 · This paper examines the problem of discovering frequent substructures from a collection of hierarchical semi-structured objects of the same type ...
Abstract: Frequent substructure discovery from a collection of semi-structured objects can serve for storage, browsing, querying, indexing and ...
People also ask
Which language would be most commonly associated with semi-structured databases?
What is an example of semi-structured data?
What is the difference between structured and semi-structured data?
Is CSV semi-structured data?
Bibliographic details on Discovering Frequent Substructures from Hierarchical Semi-structured Data.
Discovering Frequent Substructures from Hierarchical Semi-structured Data. Cong G., Yi L., Liu B., Wang K. Expand. Publication type: Proceedings Article.
This paper examines the problem of discovering frequent substructures from a collection of hierarchical semi-structured objects of the same type. The use of ...
Abstract. We study the problem of finding frequent structures in semistructured data (represented as a directed labeled graph). Frequent structures are ...
摘要. Frequent substructure discovery from a collection of semi-structured objects can serve for storage, browsing, queryin.
In this talk, we study effcient algorithms that find frequent patterns and maximal (or closed) patterns from large collections of semi-structured data.
Abstract. We address the problem of finding interesting substructures from a collection of semi-structured data such as XML or HTML. Our.