Sciweavers

1542 search results - page 160 / 309
» Using Queries to Improve Database Reverse Engineering
Sort
View
151
Voted
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 3 months ago
Spying Out Accurate User Preferences for Search Engine Adaptation
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickth...
Lin Deng, Wilfred Ng, Xiaoyong Chai, Dik Lun Lee
275
Voted
ISBRA
2011
Springer
14 years 6 months ago
Query-Adaptive Ranking with Support Vector Machines for Protein Homology Prediction
Abstract. Protein homology prediction is a crucial step in templatebased protein structure prediction. The functions that rank the proteins in a database according to their homolog...
Yan Fu, Rong Pan, Qiang Yang, Wen Gao
FUIN
2006
139views more  FUIN 2006»
15 years 3 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
191
Voted
ICDE
2012
IEEE
269views Database» more  ICDE 2012»
13 years 5 months ago
A Deep Embedding of Queries into Ruby
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
Torsten Grust, Manuel Mayr
PPAM
2005
Springer
15 years 8 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale