KSRQuerying: XML keyword with recursive querying

Kamal Taha, Ramez Elmasri

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

1 Scopus citations


We propose an XML search engine called KSRQuerying. The search engine employs recursive querying techniques, which allows a query to query the results of a previous application of itself or of another query. It answers recursive queries, keyword-based queries, and loosely structured queries. KSRQuerying uses a sort-merge algorithm, which selects subsets from the set of nodes containing keywords, where each subset contains the smallest number of nodes that: (1) are closely related to each other, and (2) contain at least one occurrence of each keyword. We experimentally evaluated the quality and efficiency of KSRQuerying and compared it with 3 systems: XSeek, Schema-Free XQuery, and XKSearch.

Original languageBritish English
Title of host publicationDatabase and XML Technologies - 6th International XML Database Symposium, XSym 2009, Proceedings
Number of pages20
StatePublished - 2009
Event6th International XML Database Symposium, XSym 2009 - Lyon, France
Duration: 24 Aug 200924 Aug 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5679 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International XML Database Symposium, XSym 2009


  • Keyword search
  • Loosely structured search
  • Recursive querying
  • XML


Dive into the research topics of 'KSRQuerying: XML keyword with recursive querying'. Together they form a unique fingerprint.

Cite this