Constraint-driven join processing in a Web Warehouse

作者:

Highlights:

摘要

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.

论文关键词:Web join,Web warehouse,Web schema,Join conditions,Web table,Algorithm

论文评审过程:Received 15 November 2001, Revised 18 June 2002, Accepted 21 July 2002, Available online 12 December 2002.

论文官网地址:https://doi.org/10.1016/S0169-023X(02)00154-4