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

First Page		Document Content
Date: 2011-01-20 12:03:47 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 Source URL: www.cs.technion.ac.il Download Document from Source Website File Size: 290,21 KB Share Document on Facebook

	A Java Framework for (Online) Algorithm Selection With Use Case on the Generalized Assignment Problem Hans Degroote1, José Luis González Velarde² and Patrick De Causmaecker1 1KU Leuven Department of Computer Science - DocID: 1vjco - View Document
	WISP 2007 SPECIAL ISSUE OF IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 1 A Feature Selection Algorithm for the Regularization of Neuron Models DocID: 1uxYY - View Document
	Online Algorithm Selection Hans Degroote1, Bernd Bischl2, Lars Kotthoff3 and Patrick De Causmaecker1 1KU Leuven, Department of Computer Science - CODeS & imec-ITEC 2Department of Statistics, LMU Munich DocID: 1uxhy - View Document
	GPS Receiver Satellite/Antenna Selection Algorithm for the Stanford Gravity Probe B Relativity Mission DocID: 1uwvO - View Document
	BOOKS ET AL. cesses of inheritance, mutation, recombination, and selection: the genetic algorithm. He has also written extensively about cognitive science, the brain as a complex system, and adaptation in general (1). In DocID: 1uswV - View Document