Interconnection semantics for keyword search in XML

Sara Cohen*, Yaron Kanza, Benny Kimelfeld, Yehoshua Sagiv

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

50 Scopus citations

Abstract

A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they correspond to graphs and not just trees). A specific interconnection semantics in this framework can be defined explicitly or derived automatically. The main advantage of interconnection semantics is the ability to pose queries on XML data in the style of keyword search. Several methods for automatically deriving interconnection semantics are presented. The complexity of the evaluation and the satisfiability problems under the derived semantics is analyzed. For many important cases, the complexity is tractable and hence, the proposed interconnection semantics can be efficiently applied to real-world XML documents.

Original languageEnglish
Title of host publicationCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
PublisherAssociation for Computing Machinery (ACM)
Pages389-396
Number of pages8
ISBN (Print)1595931406, 9781595931405
DOIs
StatePublished - 2005
Externally publishedYes
EventCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management - Bremen, Germany
Duration: 31 Oct 20055 Nov 2005

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings

Conference

ConferenceCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
Country/TerritoryGermany
CityBremen
Period31/10/055/11/05

Keywords

  • Interconnection semantics
  • Keyword search
  • XML

Fingerprint

Dive into the research topics of 'Interconnection semantics for keyword search in XML'. Together they form a unique fingerprint.

Cite this