Sciweavers

513 search results - page 56 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
WWW
2004
ACM
15 years 10 months ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien
PKDD
2009
Springer
135views Data Mining» more  PKDD 2009»
15 years 4 months ago
Syntactic Structural Kernels for Natural Language Interfaces to Databases
A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design...
Alessandra Giordani, Alessandro Moschitti
EDBTW
2010
Springer
15 years 4 months ago
SPARQL query rewriting for implementing data integration over linked data
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community1 . The presence on the Web of such a huge informa...
Gianluca Correndo, Manuel Salvadores, Ian Millard,...
99
Voted
MDM
2005
Springer
165views Communications» more  MDM 2005»
15 years 3 months ago
STEP: Self-Tuning Energy-safe Predictors
Data access prediction has been proposed as a mechanism to overcome latency lag, and more recently as a means of conserving energy in mobile systems. We present a fully adaptive p...
James Larkby-Lahet, Ganesh Santhanakrishnan, Ahmed...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
15 years 3 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv