4541 search results - page 295 / 909 » Cache-Oblivious Algorithms and Data Structures |
140
click to vote
COMAD
2009
15 years 5 months ago
2009
The focus of this paper is to develop algorithms and a framework for modeling transactional data stored in relational database into graphs for mining. Most of the real-world trans...
236
click to vote
VLDB
2004
ACM
16 years 4 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
135
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tre...
132
click to vote
PDP
2008
IEEE
15 years 10 months ago
2008
IEEE
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
121
Voted
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...