Formulating disjunctive coupling queries in a web warehouse

被引:0
|
作者
Bhowmick, SS
Kiong, AK
Madria, S [1 ]
机构
[1] Univ Missouri, Dept Comp Sci, Rolla, MO 65409 USA
[2] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
关键词
web join; web warehouse; coupling query; coupling graph; query formulation; viscous;
D O I
10.1016/S0169-023X(02)00193-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We describe how to formulate a coupling query to glean relevant Web data in the context of our web warehousing system called WHOWEDA (Warehouse Of Web Data). Coupling query may be used for querying both HTML and XML documents. One of the important feature of our query mechanism is the ability to express conjunctive as well as disjunctive query conditions compactly. We describe how to formulate a coupling query in text form as well as pictorially using the coupling text and the coupling graph respectively. We explore the limitations of coupling graph with respect to the 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 introduce the notion of hybrid graph which is a special type of p-connected coupling graph. Finally, we discuss the implementation of a GUI-based system called VISCOUS (VISual COupling QUery System) for formulating such queries. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:1 / 40
页数:40
相关论文
共 50 条
  • [1] On formulation of disjunctive coupling queries in WHOWEDA
    Bhowmick, SS
    Ng, WK
    Madria, S
    [J]. DATABASE AND EXPERT SYSTEMS APPLICATIONS, 2001, 2113 : 688 - 698
  • [2] Anatomy of the coupling query in a web warehouse
    Bhowmick, SS
    Ng, WK
    Madria, S
    Lim, EP
    [J]. INFORMATION AND SOFTWARE TECHNOLOGY, 2002, 44 (09) : 513 - 539
  • [3] Optimization of disjunctive queries
    Greco, S
    [J]. LOGIC PROGRAMMING: PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1999, : 441 - 455
  • [4] Issues and Architecture for Supporting Data Warehouse Queries in Web Portals
    Lee, Minsoo
    Lee, Yoon-kyung
    Yoon, Hyejung
    Song, Soo-kyung
    Cheong, Sujeong
    [J]. PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 25, 2007, 25 : 110 - 115
  • [5] Optimization and evaluation of disjunctive queries
    Claussen, J
    Kemper, A
    Moerkotte, G
    Peithner, K
    Steinbrunn, M
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2000, 12 (02) : 238 - 260
  • [6] OPTIMIZATION STRATEGIES FOR RELATIONAL DISJUNCTIVE QUERIES
    CIACCIA, P
    SCALAS, MR
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (10) : 1217 - 1235
  • [7] Optimization of bound disjunctive queries with constraints
    Greco, G
    Greco, S
    Trubitsyna, I
    Zumpano, E
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2005, 5 : 713 - 745
  • [8] Choice Disjunctive Queries in Logic Programming
    Kwon, Keehang
    Kang, Daeseong
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2023, E106D (03) : 333 - 336
  • [9] An optimization of disjunctive queries: Union-pushdown
    Chang, JY
    Lee, SG
    [J]. COMPSAC 97 : TWENTY-FIRST ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE, 1997, : 356 - 361
  • [10] Delegation in Predicate Encryption Supporting Disjunctive Queries
    Sun, Dongdong
    Boyd, Colin
    Nieto, Juan Manuel Gonzalez
    [J]. SECURITY AND PRIVACY - SILVER LININGS IN THE CLOUD, 2010, 330 : 229 - 240