Sciweavers

1263 search results - page 67 / 253
» A Scalable Algorithm for Answering Queries Using Views
Sort
View
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 2 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
118
Voted
ISAAC
2004
Springer
117views Algorithms» more  ISAAC 2004»
15 years 7 months ago
Adaptive Spatial Partitioning for Multidimensional Data Streams
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...
John Hershberger, Nisheeth Shrivastava, Subhash Su...
227
Voted
SASP
2009
IEEE
291views Hardware» more  SASP 2009»
15 years 9 months ago
A parameterisable and scalable Smith-Waterman algorithm implementation on CUDA-compatible GPUs
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
Cheng Ling, Khaled Benkrid, Tsuyoshi Hamada
122
Voted
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 8 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
217
Voted
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 2 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum