Sciweavers

418 search results - page 24 / 84
» Optimizing Large Join Queries in Mediation Systems
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Cache-oblivious nested-loop joins
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
Bingsheng He, Qiong Luo
FQAS
2004
Springer
112views Database» more  FQAS 2004»
14 years 1 months ago
WS-CatalogNet: Building Peer-to-Peer e-Catalog
One of the key issues in product catalogs is how to efficiently integrate and query large, intricate, heterogeneous catalogs. We propose a framework for building a dynamic catalog...
Hye-Young Paik, Boualem Benatallah, Farouk Toumani
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 7 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. ...
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 10 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...