Sciweavers

329 search results - page 62 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 28 days ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
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. ...
IDEAS
2000
IEEE
90views Database» more  IDEAS 2000»
13 years 11 months ago
StreamJoin: A Generic Database Approach to Support the Class of Stream-Oriented Applications
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
Clara Nippl, Ralf Rantzau, Bernhard Mitschang
WWW
2005
ACM
14 years 8 months ago
A personalized search engine based on web-snippet hierarchical clustering
In this paper we propose a hierarchical clustering engine, called SnakeT, that is able to organize on-the-fly the search results drawn from 16 commodity search engines into a hier...
Paolo Ferragina, Antonio Gulli