Sciweavers

47 search results - page 3 / 10
» Query Planning with Limited Source Capabilities
Sort
View
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
13 years 9 months ago
Computing Capabilities of Mediators
Existing data-integration systems based on the mediation architecture employ a variety of mechanisms to describe the query-processing capabilities ofsources. However, these system...
Ramana Yerneni, Chen Li, Hector Garcia-Molina, Jef...
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 5 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
VLDB
1997
ACM
117views Database» more  VLDB 1997»
13 years 9 months ago
Optimizing Queries Across Diverse Data Sources
Businesses today need to interrelate data stored in diverse systems with differing capabilities, ideally via a single high-level query interface. We present the design of a query ...
Laura M. Haas, Donald Kossmann, Edward L. Wimmers,...
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
14 years 5 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
SSDBM
2008
IEEE
149views Database» more  SSDBM 2008»
13 years 11 months ago
Query Planning for Searching Inter-dependent Deep-Web Databases
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Fan Wang, Gagan Agrawal, Ruoming Jin