2006 | OriginalPaper | Buchkapitel
Evaluating Interconnection Relationship for Path-Based XML Retrieval
verfasst von : Xiaoguang Li, Ge Yu, Daling Wang, Baoyan Song
Erschienen in: Web Information Systems – WISE 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.