Sciweavers

373 search results - page 3 / 75
» Querying Priced Information in Databases: The Conjunctive Ca...
Sort
View
DEXA
1994
Springer
81views Database» more  DEXA 1994»
13 years 9 months ago
Supporting Information Disclosure in an Evolving Environment
Even if high-level query languages are used, query formulation may cause problems. This is notably so in case of large and complex application domains. Typical examples of these ki...
Arthur H. M. ter Hofstede, Henderik Alex Proper, T...
EDBT
2002
ACM
136views Database» more  EDBT 2002»
14 years 5 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
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
14 years 5 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton
ER
2008
Springer
110views Database» more  ER 2008»
13 years 7 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 14 days ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch