Sciweavers

42 search results - page 3 / 9
» Evaluating the Cost of Boolean Query Mapping
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 7 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
EDBT
2009
ACM
124views Database» more  EDBT 2009»
13 years 10 months ago
Processing probabilistic spatio-temporal range queries over moving objects with uncertainty
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
Bruce S. E. Chung, Wang-Chien Lee, Arbee L. P. Che...
EDBT
2010
ACM
152views Database» more  EDBT 2010»
13 years 10 months ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...
ICDIM
2008
IEEE
14 years 1 months ago
Dynamic detection and administration of materialized views based on the Query Graph Model
Database Management Systems (DBMS) are complex software systems which are used in an increasing number of applications. To obtain the best performance for business relevant applic...
Andreas Lübcke, Ingolf Geist, Ronny Bubke