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

	In-place Graph Rewriting with Interaction Nets Ian Mackie Shinya Sato An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute DocID: 1tTd9 - View Document
	Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Michal Vaner DocID: 1r4Mz - View Document
	Adaptive Matrix Transpose Algorithms for Distributed Multicore Processors John C. Bowman and Malcolm Roberts Abstract An adaptive parallel matrix transpose algorithm optimized for distributed multicore architectures runn DocID: 1q14M - View Document
	Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany arXiv:0910.2582v1 [cs.DS] 14 Oct 2009 DocID: 1pGn4 - View Document
	AT&T Bell Laboratories Numerical Analysis ManuscriptCorrectly Rounded Binary-Decimal and Decimal-Binary Conversions DocID: 1oJV1 - View Document