Sciweavers

3969 search results - page 237 / 794
» Query Processing Using Ontologies
Sort
View
136
Voted
DKE
2006
123views more  DKE 2006»
15 years 3 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
156
Voted
BMCBI
2008
116views more  BMCBI 2008»
15 years 3 months ago
Gene Ontology annotations: what they mean and where they come from
To address the challenges of information integration and retrieval, the computational genomics community increasingly has come to rely on the methodology of creating annotations o...
David P. Hill, Barry Smith, Monica S. McAndrews-Hi...
140
Voted
WWW
2009
ACM
16 years 4 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
138
Voted
CF
2009
ACM
15 years 8 months ago
Data parallel acceleration of decision support queries using Cell/BE and GPUs
Decision Support System (DSS) workloads are known to be one of the most time-consuming database workloads that processes large data sets. Traditionally, DSS queries have been acce...
Pedro Trancoso, Despo Othonos, Artemakis Artemiou
117
Voted
SIGMOD
2001
ACM
147views Database» more  SIGMOD 2001»
16 years 3 months ago
Optimizing Queries Using Materialized Views: A practical, scalable solution
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...
Jonathan Goldstein, Per-Åke Larson