Sciweavers

1101 search results - page 130 / 221
» Fault-Tolerance in Distributed Query Processing
Sort
View
DKE
2006
123views more  DKE 2006»
14 years 10 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...
CIKM
2010
Springer
14 years 8 months ago
Query optimization for ontology-based information integration
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
Yingjie Li, Jeff Heflin
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 7 months ago
Ontology-based Queries over Cancer Data
The ever-increasing amount of data in biomedical research, and in cancer research in particular, needs to be managed to support efficient data access, exchange and integration. Exi...
Alejandra González Beltrán, Ben Tagg...
CIKM
2005
Springer
15 years 3 months ago
Towards automatic association of relevant unstructured content with structured query results
Faced with growing knowledge management needs, enterprises are increasingly realizing the importance of seamlessly integrating critical business information distributed across bot...
Prasan Roy, Mukesh K. Mohania, Bhuvan Bamba, Shree...
BDA
2007
14 years 11 months ago
Querying and Aggregating Visible and Hidden Data Without Leaks
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...
Nicolas Anciaux, Mehdi Benzine, Luc Bouganim, Phil...