Sciweavers

67 search results - page 5 / 14
» Percentile Finding Algorithm for Multiple Sorted Runs
Sort
View
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
13 years 11 months ago
Query Execution Techniques for Caching Expensive Methods
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
Joseph M. Hellerstein, Jeffrey F. Naughton
IVC
2006
123views more  IVC 2006»
13 years 7 months ago
Multi-sector algorithm for hardware acceleration of the general Hough transform
The Multi-Sector Algorithm (MSA) is a simplification of the CORDIC algorithm to more closely meet the requirements for a real-time general Hough transform applications. The MSA ca...
Emeric K. Jolly, Martin Fleury
MST
2002
128views more  MST 2002»
13 years 7 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
EGH
2009
Springer
13 years 5 months ago
Stream compaction for deferred shading
The GPU leverages SIMD efficiency when shading because it rasterizes a triangle at a time, running the same shader on all of its fragments. Ray tracing sacrifices this shader cohe...
Jared Hoberock, Victor Lu, Yuntao Jia, John C. Har...
VLDB
1999
ACM
145views Database» more  VLDB 1999»
13 years 11 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...