Constraint-free Join Processing on Hyperlinked Web Data
Abstract
In this paper, we introduce the concept of web join for combining hyperlinked Web data. A web join is one of the web algebraic operator in our web warehousing system called Whoweda (WareHouse Of WEb DAta). It can be used to gather useful, composite information from two web tables. Web join and outer web join (a derivative of web join) operations can be used to detect and represent changes to hyperlinked Web data. We discuss the syntax, semantics and algorithms of web join and outer web join operators. We also present how to detect and represent changes to hyperlinked Web data using these two operations. © 2002 Springer-Verlag Berlin Heidelberg.
Recommended Citation
S. S. Bhowmick et al., "Constraint-free Join Processing on Hyperlinked Web Data," Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2454 LNCS, pp. 255 - 264, Springer, Jan 2002.
The definitive version is available at https://doi.org/10.1007/3-540-46145-0_25
Department(s)
Computer Science
International Standard Book Number (ISBN)
978-354044123-6
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 2002
