Sciweavers

1992 search results - page 1 / 399
» Implementing sorting in database systems
Sort
View
CASCON
1996
125views Education» more  CASCON 1996»
13 years 6 months ago
A memory-adaptive sort (MASORT) for database systems
A memory-adaptive sort is able to dynamically change the amount of memory used during sorting. The method described in this paper adjusts memory usage according to input size and ...
Weiye Zhang, Per-Åke Larson
GVD
2009
148views Database» more  GVD 2009»
13 years 3 months ago
Towards an Energy Aware DBMS - Energy Consumptions of Sorting and Join Algorithms
Database management systems comprise various algorithms for efficiently retrieving and managing data. Typically, algorithm efficiency or performance is correlated with execution s...
Hagen Höpfner, Christian Bunse
FUIN
2008
103views more  FUIN 2008»
13 years 5 months ago
Implementing Sorting Networks with Spiking Neural P Systems
Spiking neural P systems simulate the behavior of neurons sending signals through axons. Recently, some applications concerning Boolean circuits and sorting algorithms have been pr...
Rodica Ceterchi, Alexandru Ioan Tomescu
SIGMOD
1997
ACM
135views Database» more  SIGMOD 1997»
13 years 9 months ago
High-Performance Sorting on Networks of Workstations
We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sortin...
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau,...