Sciweavers

654 search results - page 58 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
ISEMANTICS
2010
15 years 4 months ago
An evaluation of approaches to federated query processing over linked data
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
Peter Haase, Tobias Mathäß, Michael Zil...
CGI
1998
IEEE
15 years 10 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
ICALP
2004
Springer
15 years 11 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
DEXA
2009
Springer
188views Database» more  DEXA 2009»
15 years 10 months ago
On-the-Fly Integration and Ad Hoc Querying of Life Sciences Databases Using LifeDB
Data intensive applications in Life Sciences extensively use the Hidden Web as a platform for information sharing. Access to these heterogeneous Hidden Web resources is limited thr...
Anupam Bhattacharjee, Aminul Islam, Mohammad Shafk...
SC
2003
ACM
15 years 11 months ago
Nondeterministic Queries in a Relational Grid Information Service
A Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We are developing RGIS, a GIS system...
Peter A. Dinda, Dong Lu