Sciweavers

354 search results - page 19 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 8 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. ...
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 9 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
WWW
2003
ACM
14 years 9 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
VLDB
1990
ACM
77views Database» more  VLDB 1990»
14 years 14 days ago
Efficient Main Memory Data Management Using the DBGraph Storage Model
Therequirementsfor amain memorydatastoragemodel are both compactnessand efficient processing for all database operations. The DBGraph storage model, proposed in this paper, achiev...
Philippe Pucheral, Jean-Marc Thévenin, Patr...
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 8 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...