Sciweavers

10 search results - page 1 / 2
» CrossMine: Efficient Classification Across Multiple Database...
Sort
View
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 6 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 6 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
KAIS
2008
165views more  KAIS 2008»
13 years 4 months ago
Multirelational classification: a multiple view approach
Multirelational classification aims at discovering useful patterns across multiple inter-connected tables (relations) in a relational database. Many traditional learning techniques...
Hongyu Guo, Herna L. Viktor
BTW
2009
Springer
114views Database» more  BTW 2009»
13 years 8 months ago
Efficient Verification of B-tree Integrity
: The integrity of B-tree structures can become compromised for many reasons. Since these inconsistencies manifest themselves in unpredictable ways, all commercial database managem...
Goetz Graefe, R. Stonecipher
DASFAA
2004
IEEE
102views Database» more  DASFAA 2004»
13 years 8 months ago
Efficient Declustering of Non-uniform Multidimensional Data Using Shifted Hilbert Curves
Abstract. Data declustering speeds up large data set retrieval by partitioning the data across multiple disks or sites and performing retrievals in parallel. Performance is determi...
Hak-Cheol Kim, Mario A. Lopez, Scott T. Leutenegge...