On Formulation of Disjunctive Coupling Queries in WHOWEDA
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.
Recommended Citation
S. S. Bhowmick et al., "On Formulation of Disjunctive Coupling Queries in WHOWEDA," Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2113, pp. 688 - 698, Springer, Jan 2001.
The definitive version is available at https://doi.org/10.1007/3-540-44759-8_67
Department(s)
Computer Science
International Standard Book Number (ISBN)
978-354042527-4
International Standard Serial Number (ISSN)
1611-3349; 0302-9743
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Springer, All rights reserved.
Publication Date
01 Jan 2001
