Sciweavers

5221 search results - page 40 / 1045
» An On-line Problem Database
Sort
View
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 9 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
CLEANDB
2006
ACM
163views Database» more  CLEANDB 2006»
14 years 3 months ago
Circumventing Data Quality Problems Using Multiple Join Paths
We propose the Multiple Join Path (MJP) framework for obtaining high quality information by linking fields across multiple databases, when the underlying databases have poor qual...
Yannis Kotidis, Amélie Marian, Divesh Sriva...
PRL
2007
148views more  PRL 2007»
13 years 8 months ago
Damascening video databases for evaluation of face tracking and recognition - The DXM2VTS database
Performance quantification of biometric systems, such as face tracking and recognition highly depend on the database used for testing the systems. Systems trained and tested on r...
Dereje Teferi, Josef Bigün
IBIS
2006
109views more  IBIS 2006»
13 years 9 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 9 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee