Sciweavers

513 search results - page 26 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
GEOINFO
2004
13 years 11 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 10 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
ICDE
2011
IEEE
273views Database» more  ICDE 2011»
13 years 1 months ago
Shortcut selection in RDF databases
—An increasing amount of data produced nowadays is in RDF format. While significant work has been performed on view selection and query optimization algorithms in relational dat...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 10 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 10 months ago
GPUQP: query co-processing using graphics processors
We present GPUQP, a relational query engine that employs both CPUs and GPUs (Graphics Processing Units) for in-memory query co-processing. GPUs are commodity processors traditiona...
Rui Fang, Bingsheng He, Mian Lu, Ke Yang, Naga K. ...