64 search results - page 12 / 13 » An Efficient Algorithm for the Incremental Updation of Assoc... |
KDD
2008
ACM
14 years 5 months ago
2008
ACM
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
XML schema design has two opposing goals: elimination of update anomalies requires that the schema be as normalized as possible; yet higher query performance and simpler query exp...
KDD
2002
ACM
14 years 5 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...