It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
Recent work both in the relational and the XML world have shown that the efficacy and efficiency of duplicate detection is enhanced by regarding relationships between entities. Ho...
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards. ArchIS&...
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
Updates over virtual XML views that wrap relational data are not well supported by XML data management systems. This paper studies the problem of whether a correct relational upda...
Integrating Deep Web sources requires highly accurate semantic matches between the attributes of the source query interfaces. These matches are usually established by comparing th...
Scientific research is becoming increasingly relied on collaborative effort among multiple institutions and interdisciplinary consortium, through sharing experiments and data, and...
Fusheng Wang, Peiya Liu, John Pearson, Fred Azar, ...
Data mining promises to discover valid and potentially useful patterns in data. Often, discovered patterns are not useful to the user. "Actionability" addresses this pro...