214 search results - page 40 / 43 » New Parallel Algorithms for Frequent Itemset Mining in Very ... |
CDES
2008
13 years 8 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
KDD
2009
ACM
14 years 7 months ago
2009
ACM
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
ICDM
2007
IEEE
13 years 10 months ago
2007
IEEE
Many databases will not or can not be disclosed without strong guarantees that no sensitive information can be extracted. To address this concern several data perturbation techniq...
SIGMOD
2011
ACM
12 years 9 months ago
2011
ACM
Today’s one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of data efficiently. MapReduce is a popular programm...