Sciweavers

90 search results - page 2 / 18
» Symmetry Partition Sort
Sort
View
CIDR
2003
147views Algorithms» more  CIDR 2003»
13 years 6 months ago
Sorting And Indexing With Partitioned B-Trees
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...
Goetz Graefe
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 5 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
ACTA
2000
92views more  ACTA 2000»
13 years 5 months ago
How to Calculate Symmetries of Petri Nets
Symmetric net structure yields symmetric net behaviour. Thus, knowing the symmetries of a net, redundant calculations can be skipped. We present a framework for the calculation of ...
Karsten Schmidt 0004
SMC
2007
IEEE
110views Control Systems» more  SMC 2007»
13 years 11 months ago
A validity index based on cluster symmetry
— An important consideration in clustering is the determination of the correct number of clusters and the appropriate partitioning of a given data set. In this paper, a newly dev...
Sriparna Saha, Sanghamitra Bandyopadhyay
ICDT
2009
ACM
121views Database» more  ICDT 2009»
14 years 6 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz