Sciweavers

11 search results - page 1 / 3
» View-Based Query Processing and Constraint Satisfaction
Sort
View
LICS
2000
IEEE
13 years 9 months ago
View-Based Query Processing and Constraint Satisfaction
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
CDB
2004
Springer
143views Database» more  CDB 2004»
13 years 10 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
AMAI
1999
Springer
13 years 5 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 5 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,...
GIS
1995
ACM
13 years 8 months ago
Collaborative Spatial Decision Making with Qualitative Constraints
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...
Nikos I. Karacapilidis, Dimitris Papadias, Max J. ...