Sciweavers

15 search results - page 1 / 3
» Using Patterns for Faster and Scalable Rewriting of Conjunct...
Sort
View
AMW
2009
13 years 5 months ago
Using Patterns for Faster and Scalable Rewriting of Conjunctive Queries
Abstract. Rewriting of conjunctive queries using views has many applications in database and data integration. We investigate ways to improve performance of rewriting and propose a...
Ali Kiani, Nematollaah Shiri
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
12 years 7 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
EDBT
2002
ACM
136views Database» more  EDBT 2002»
14 years 4 months ago
Rewriting Unions of General Conjunctive Queries Using Views
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...
Junhu Wang, Michael J. Maher, Rodney W. Topor
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 6 months ago
Towards scalable data integration under constraints
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
George Konstantinidis, José Luis Ambite
ICDE
2006
IEEE
139views Database» more  ICDE 2006»
14 years 5 months ago
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Prodromos Malakasiotis, Václav Lín, ...