Sciweavers

739 search results - page 8 / 148
» Sorting Algorithms
Sort
View
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 8 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
KR
2004
Springer
14 years 25 days ago
Ontological Knowledge Base Reasoning with Sort-Hierarchy and Rigidity
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non...
Ken Kaneiwa, Riichiro Mizoguchi
IPPS
1997
IEEE
13 years 11 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
IPL
2006
88views more  IPL 2006»
13 years 7 months ago
On Quickselect, partial sorting and Multiple Quickselect
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
Markus Kuba
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 8 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel