Sciweavers

333 search results - page 1 / 67
» Query Optimization Using Local Completeness
Sort
View
AAAI
1997
13 years 6 months ago
Query Optimization Using Local Completeness
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...
Oliver M. Duschka
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 4 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
CORR
2010
Springer
238views Education» more  CORR 2010»
13 years 4 months ago
Face Identification by SIFT-based Complete Graph Topology
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...
Dakshina Ranjan Kisku, Ajita Rattani, Enrico Gross...
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 4 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 4 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma