TY - GEN
T1 - Propagation-vectors for trees (PVT)
T2 - 2008 ACM Workshop on Large-Scale Distributed Systems for Information Retrieval, LSDS-IR'08, Co-located with the 17th ACM Conference on Information and Knowledge Management, CIKM'08
AU - Cherukuri, Venkata S.
AU - Candan, Kasim
PY - 2008
Y1 - 2008
N2 - Summarization of hierarchical data and metadata is a fundamental operation in applications in many domains. In particular, similarity search of hierarchical data, such as XML, would benefit greatly fromconcise and indexable summaries. This is especially true in P2P scenarios, where the search needs to be done in a distributed fashion on multiple peers. This situation requires summaries which are small, yet effective in identifying potential peers that need to be further explored. In this paper, we propose a method, called propagation-vectors for trees (PVT) which constructs very concise and accurate summaries of hierarchical data, such as XML trees. We then show how to use this summary to perform similarity search on summarized data. The proposed summarization scheme relies on a label-propagation mechanism, which constructs an n-dimensional vector from a given tree with n unique data labels. Experimental results have shown that the constructed PVT summaries capture the structure of the input trees very accurately, the representations are highly concise, and that the search based on these summaries are faster than the existing approaches.
AB - Summarization of hierarchical data and metadata is a fundamental operation in applications in many domains. In particular, similarity search of hierarchical data, such as XML, would benefit greatly fromconcise and indexable summaries. This is especially true in P2P scenarios, where the search needs to be done in a distributed fashion on multiple peers. This situation requires summaries which are small, yet effective in identifying potential peers that need to be further explored. In this paper, we propose a method, called propagation-vectors for trees (PVT) which constructs very concise and accurate summaries of hierarchical data, such as XML trees. We then show how to use this summary to perform similarity search on summarized data. The proposed summarization scheme relies on a label-propagation mechanism, which constructs an n-dimensional vector from a given tree with n unique data labels. Experimental results have shown that the constructed PVT summaries capture the structure of the input trees very accurately, the representations are highly concise, and that the search based on these summaries are faster than the existing approaches.
UR - http://www.scopus.com/inward/record.url?scp=70349331234&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349331234&partnerID=8YFLogxK
U2 - 10.1145/1458469.1458481
DO - 10.1145/1458469.1458481
M3 - Conference contribution
AN - SCOPUS:70349331234
SN - 9781605582542
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 3
EP - 10
BT - Proceedings of the 2008 ACM Workshop on Large-Scale Distributed Systems for Information Retrieval, LSDS-IR'08, Co-located with the 17th ACM Conference on Information and Knowledge Management, CIKM'08
Y2 - 26 October 2008 through 30 October 2008
ER -