Sciweavers

1007 search results - page 131 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
162
Voted
EDBT
1998
ACM
155views Database» more  EDBT 1998»
15 years 6 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
228
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
189
Voted
SIGMOD
2008
ACM
102views Database» more  SIGMOD 2008»
16 years 2 months ago
Stream firewalling of xml constraints
As XML-based messages have become common in many client-server protocols, there is a need to protect application servers from invalid or dangerous messages. This leads to the XML ...
Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild
138
Voted
DAMON
2007
Springer
15 years 8 months ago
Pipelined hash-join on multithreaded architectures
Multi-core and multithreaded processors present both opportunities and challenges in the design of database query processing algorithms. Previous work has shown the potential for ...
Philip Garcia, Henry F. Korth
210
Voted
DOLAP
2010
ACM
15 years 17 days ago
Relational versus non-relational database systems for data warehousing
Relational database systems have been the dominating technology to manage and analyze large data warehouses. Moreover, the ER model, the standard in database design, has a close r...
Carlos Ordonez, Il-Yeol Song, Carlos Garcia-Alvara...