Back to Results
First PageMeta Content
Sorting algorithms / Analysis of algorithms / Selection algorithm / Merge sort / Randomized algorithm / Algorithm / In-place algorithm / Sorted array / Relational database / Mathematics / Theoretical computer science / Applied mathematics


Detecting and Exploiting Near-Sortedness for Efficient Relational Query Evaluation Sagi Ben-Moshe Eldar Fischer
Add to Reading List

Document Date: 2011-01-20 12:03:47


Open Document

File Size: 290,21 KB

Share Result on Facebook

City

Uppsala / /

Company

Carl Staelin HP Labs / Mani Fischer HP Labs / /

Country

Sweden / /

Currency

USD / /

/

IndustryTerm

improved algorithm / database query processors / probabilistic algorithm / approximation algorithm / conventional algorithm / less efficient algorithm / conventional evaluation algorithm / query processor / generic algorithm / appropriate algorithm / wrong algorithm / stage sorting algorithm / cheapest algorithm / correction algorithm / sort algorithm / /

Organization

Technion / /

Person

MIN VALK / Ben-Moshe Eldar Fischer Technion Technion / /

Position

Relational databases General / RT / /

Product

Algorithm 1 / Algorithm 2 / /

ProgrammingLanguage

R / /

Technology

random call Algorithm / sorting algorithms / corresponding merging algorithm / pass Algorithm / sort algorithm / Replacement-Selection algorithm / sorting algorithm / appropriate algorithm / database query processors / approximation algorithm / wrong algorithm / previous algorithms / generic algorithm / testing algorithms / query processor / improved algorithm / simpler Algorithm / The algorithm / well known Replacement-Selection algorithm / cheapest algorithm / 1/6 Algorithm / random access / random 1 call Algorithm / Replacement Selection algorithm / operating systems / correction algorithm / described algorithm / conventional evaluation algorithm / probabilistic algorithm / conventional algorithm / /

SocialTag