Sciweavers

251 search results - page 32 / 51
» MindReader: Querying Databases Through Multiple Examples
Sort
View
VLDB
1994
ACM
118views Database» more  VLDB 1994»
15 years 7 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
CIKM
2009
Springer
15 years 7 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
98
Voted
CVPR
2007
IEEE
16 years 5 months ago
A Binning Scheme for Fast Hard Drive Based Image Search
In this paper we investigate how to scale a content based image retrieval approach beyond the RAM limits of a single computer and to make use of its hard drive to store the featur...
David Nistér, Friedrich Fraundorfer, Henrik...
IPPS
2009
IEEE
15 years 10 months ago
Resource allocation strategies for constructive in-network stream processing
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo,...
APIN
2000
75views more  APIN 2000»
15 years 3 months ago
Context Knowledge Representation and Reasoning in the Context Interchange System
The Context Interchange Project presents a unique approach to the problem of semantic conflict resolution among multiple heterogeneous data sources. The system presents a semantic...
Stéphane Bressan, Cheng Hian Goh, Natalia L...