Sciweavers

777 search results - page 133 / 156
» Optimization of Relational Preference Queries
Sort
View
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 7 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
WWW
2001
ACM
14 years 8 months ago
A unified constraint model for XML
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Gabriel M. Kuper, Jérôme Siméo...
VLDB
2004
ACM
100views Database» more  VLDB 2004»
14 years 1 months ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
14 years 3 days ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
DAWAK
1999
Springer
13 years 12 months ago
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
Spyros Ligoudistianos, Timos K. Sellis, Dimitri Th...