Similarity-based queries for time series data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A tree-edit-distance algorithm for comparing simple, closed shapes
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
XClust: clustering XML schemas for effective integration
Proceedings of the eleventh international conference on Information and knowledge management
An Efficient and Scalable Algorithm for Clustering XML Documents by Structure
IEEE Transactions on Knowledge and Data Engineering
Combining Top-Down and Bottom-Up Segmentation
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 4 - Volume 04
Fast Detection of XML Structural Similarity
IEEE Transactions on Knowledge and Data Engineering
A tree-based approach to clustering XML documents by structure
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Similarity evaluation on tree-structured data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
diffX: an algorithm to detect changes in multi-version XML documents
CASCON '05 Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research
| Hi-index | 0.00 |
On the Web and network environments, fast and precise data transmission is the most essential part, and many additional elements should be supported for this. Data discovery is one of the elements. This paper focuses on data discovery strategies, especially on the main factors related to the discovery strategies for Markup data, which takes considerable amount of Web and network data. For the evaluation, we declared the factors and simulated the factors on our data discovery system to show how much they effect for the performance.