Sciweavers

2135 search results - page 39 / 427
» Database Paper - The IRI Marketing Data Set
Sort
View
APWEB
2004
Springer
14 years 1 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
14 years 8 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
IDEAS
2003
IEEE
100views Database» more  IDEAS 2003»
14 years 1 months ago
Querying XML Data by the Nested Relational Sequence Database System
In this concise paper, we present the Nested Relational Sequence Model (NRSM), which is an extension of the Nested Relational Data Model in order to handle XML data. We also intro...
Ho Lam Lau, Wilfred Ng
GCC
2003
Springer
14 years 28 days ago
Preserving Data Consistency in Grid Databases with Multiple Transactions
High performance Grid computing provides an infrastructure for access and processing of large volume, terabyte or even petabytes, of distributed data. Research in data grid has foc...
Sushant Goel, Hema Sharda, David Taniar