559 search results - page 32 / 112 » Algorithms and Data Structures for External Memory |
113
click to vote
CIDR
2003
15 years 3 months ago
2003
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
110
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
141
click to vote
PDPTA
2000
15 years 3 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
120
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
125
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
In a data warehousing process, the data preparation phase is crucial. Mastering this phase allows substantial gains in terms of time and performance when performing a multidimensio...