Sciweavers

1992 search results - page 3 / 399
» Implementing sorting in database systems
Sort
View
PVLDB
2008
123views more  PVLDB 2008»
13 years 7 months ago
Efficient implementation of sorting on multi-core SIMD CPU architecture
Sorting a list of input numbers is one of the most fundamental problems in the field of computer science in general and high-throughput database applications in particular. Althou...
Jatin Chhugani, Anthony D. Nguyen, Victor W. Lee, ...
VLDB
1998
ACM
141views Database» more  VLDB 1998»
13 years 11 months ago
Bulk-Loading Techniques for Object Databases and an Application to Relational Data
We present a framework for designing, in a declarative and flexible way, efficient migration programs and an undergoing implementation of a migration tool called RelOO whose targe...
Sihem Amer-Yahia, Sophie Cluet, Claude Delobel
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
14 years 4 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
TVLSI
2010
13 years 2 months ago
Design and Implementation of a Sort-Free K-Best Sphere Decoder
:- This paper describes the design and VLSI architecture for a 4x4 breadth first K-Best MIMO decoder using a 64 QAM scheme. A novel sort free approach to path extension, as well as...
Sudip Mondal, Ahmed M. Eltawil, Chung-An Shen, Kha...
GIS
2007
ACM
13 years 11 months ago
Pipelined spatial join processing for quadtree-based indexes
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
Walid G. Aref