As one of popular solutions for meaningful result determination, interconnection relationship has been accepted widely by search engines. However, it suffers from heavy storage overhead and serious time complexity of index construction and query evaluation. We extend the retrieval syntax to support path query for partial structural information, propose a variant of interconnection relationship, and present an efficient evaluation algorithm with the extended structural summaries. The experiments show that with the promise of meaningful answers, our approach offers great performance benefits of evaluating interconnection relationship at run time. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Li, X., Yu, G., Wang, D., & Song, B. (2006). Evaluating interconnection relationship for path-based XML retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4255 LNCS, pp. 506–511). Springer Verlag. https://doi.org/10.1007/11912873_52
Mendeley helps you to discover research relevant for your work.