On Formulation of Disjunctive Coupling Queries in WHOWEDA

  • Authors:
  • Sourav S. Bhowmick;Wee Keong Ng;Sanjay Kumar Madria

  • Affiliations:
  • -;-;-

  • Venue:
  • DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe how to formulate coupling query to glean relevant Web data in the context of our web warehousing system called WHOWEDA (Warehouse Of Web Data). One of the important feature of our query mechanism is the ability to express disjunctive query conditions compactly. We describe how to formulate coupling queries in text form as well as pictorially using coupling text and coupling graph. We explore the limitations of coupling graph with respect to coupling text. We found out that AND, OR and AND/OR-coupling graphs are less expressive than their textual counterparts. To address this shortcoming we introduced another query formulation technique called hybrid graph which is a special type of p-connected coupling graph.