English»Algorithms»Architecture & Hardware | searchivarius.org
log in | contact | about 

A decomposition storage model  George P. Copeland, Setrag N. Khoshafian
Challenges in Building Large-Scale Information Retrieval Systems  Jeff Dean
Cluster Load Balancing for Fine-grain Network Services  Kai Shen, Tao Yang, Lingkun Chu
Column Stores vs. Row Stores: How Different Are They Really?  Daniel J. Abadi, Samuel R. Madden, Nabil Hachem
Column-Oriented Database Systems (tutorial)  Stavros Harizopoulos, Daniel Abadi, Peter Boncz
Decoding billions of integers per second through vectorization  Daniel Lemire, Leonid Boytsov
Design Alternatives for Large-Scale Web Search  Matthias Bender, Sebastian Michel, Peter Triantafillou, Gerhard Weikum - Discussion of various term-partitioning strategies.
Efficient parallel lists intersection and index compression algorithms using graphics processing units  Naiyong Ao, Fan Zhang, Di Wu, Douglas S. Stones, Gang Wang, Xiaoguang Liu, Jing Liu, Sheng Lin
Exploiting SIMD instructions in current processors to improve classical string algorithms  Susana Ladra, Oscar Pedreira, Jose Duato, Nieves R. Brisaboa
Fast Integer Compression using SIMD Instructions  Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner
Fast integer compression using SIMD instructions  B. Schlegel, R. Gemulla, W. Lehner
Generalized Search Trees for Database Systems  Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer - A paper on the GIST framework
GPGPU: General-Purpose Computation on Graphics Hardware  
GPU-Quicksort: A practical Quicksort algorithm for graphics processors  Daniel Cederman, Philippas Tsigas
K Nearest Neighbor Queries and KNN-Joins in Large Relational Databases (Almost) for Free  Bin Yao, Feifei Li, Piyush Kumar
Large, pruned or continuous space language models on a GPU for statistical machine translation  Holger Schwenk, Anthony Rousseau, Mohammed Attik
Latency numbers every programmer must know  Colin Scott
Lock-free algorithms  
Megastore: Providing Scalable, Highly Available Storage for Interactive Services  Jason Baker, Chris Bond, James C. Corbett, JJ Furman, Andrey Khorlin, James S. Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, Vadim Yushprakh
NoSQL databases (a survey)  Christof Strauch
On dynamic load balancing on graphics processors  Daniel Cederman
Optimizing Result Prefetching in Web Search Engines with Segmented Indices  Ronny Lempel, Shlomo Moran - Optimizing Result Prefetching in Web Search Engines with Segmented Indices
Parallel Computing in CUDA  Michael Garland, SL Grand, J Nickolls, J Anderson, J Hardwick, S Morton, E Phillips, Y Zhang, V Volkov
Server Engineering Insights for Large-Scale Online Services  Christos Kozyrakis, Aman Kansal, Sriram Sankar, Kushagra Vaid
sim-universal-construction   - a simple wait-free universal construction, that uses just a Fetch&Add and a CAS object and performs a constant number of shared memory accesses.
SIMD-Based Decoding of Posting Lists  Alexander A. Stepanov, Anil R. Gangolli, Daniel E. Rose, Ryan J. Ernst, Paramjit S. Oberoi
The Anatomy of a Large Scale Social Search Engine  Damon Horowitz, Sepandar D. Kamvar
The Anatomy of a Large-Scale Hypertextual Web Search Engine  S. Brin, L. Page - An article that describes an early Google architecture.
Using graphics processors for high performance IR query processing.  S. Ding, J. He, H. Yan, T. Suel.
Vectorized Bloom filters for advanced SIMD processors  Orestis Polychroniou, Kenneth A. Ross
Web Search for a Planet Google Search Architecture  Luiz André Barroso, Jeffrey Dean, Urs Hölzle
What Every Programmer Should Know About Memory  Ulrich Drepper