Constraint-Driven Join Processing in a Web Warehouse
Abstract
There has been considerable research in join operation in relational databases. in this paper, we introduce the concept of web join for combining hyperlinked Web data. Web join is one of the web algebraic operator in our web warehousing system called WHOWEDA (WareHouse of WEb DAta). Similar to its relational counterpart, it can be used to gather useful, composite information from two web tables. the significance of web join perhaps can be best realized when we wish to combine data from a Web site where some of the information in the Web site is no longer available due to changes to the site. a web join operation can be constraint-free or constraint-driven depending on the absence or presence of join conditions. in this paper, we focus our discussion on constraint-driven web join operation, i.e., web join operation in the presence of user-specified join conditions. Specifically, we discuss the syntax, semantics and algorithm of web join operator. © 2002 Elsevier Science B.V. All rights reserved.
Recommended Citation
S. S. Bhowmick et al., "Constraint-Driven Join Processing in a Web Warehouse," Data and Knowledge Engineering, vol. 45, no. 1, pp. 33 - 78, Elsevier, Apr 2003.
The definitive version is available at https://doi.org/10.1016/S0169-023X(02)00154-4
Department(s)
Computer Science
Keywords and Phrases
Algorithm; Join conditions; Web join; Web schema; Web table; Web warehouse
International Standard Serial Number (ISSN)
0169-023X
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Elsevier, All rights reserved.
Publication Date
01 Apr 2003
