Sciweavers

304 search results - page 23 / 61
» Parallel and Distributed Compressed Indexes
Sort
View
SIGMOD
1999
ACM
110views Database» more  SIGMOD 1999»
14 years 24 days ago
Multi-dimensional Selectivity Estimation Using Compressed Histogram Information
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
Ju-Hong Lee, Deok-Hwan Kim, Chin-Wan Chung
CLUSTER
2003
IEEE
14 years 1 months ago
Optimized Implementation of Extendible Hashing to Support Large File System Directory
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
Rongfeng Tang, Dan Meng, Sining Wu
SIGIR
2011
ACM
12 years 11 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
IPPS
1998
IEEE
14 years 22 days ago
Compiler-Optimization of Implicit Reductions for Distributed Memory Multiprocessors
This paper presents reduction recognition and parallel code generationstrategies for distributed-memorymultiprocessors. We describe techniques to recognize a broad range of implic...
Bo Lu, John M. Mellor-Crummey
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 8 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama