On Formulation of Disjunctive Coupling Queries in WHOWEDA

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Bhowmick, S. S., Ng, W. K., & Madria, S. (2001). On Formulation of Disjunctive Coupling Queries in WHOWEDA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2113, pp. 688–698). Springer Verlag. https://doi.org/10.1007/3-540-44759-8_67

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free