Sciweavers

4081 search results - page 328 / 817
» Metaprogramming for Relational Databases
Sort
View
PODS
2005
ACM
86views Database» more  PODS 2005»
16 years 8 days ago
An incremental algorithm for computing ranked full disjunctions
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
Sara Cohen, Yehoshua Sagiv
CIKM
2005
Springer
16 years 8 days ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
ICDT
2001
ACM
110views Database» more  ICDT 2001»
15 years 11 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
ECCB
2005
IEEE
16 years 10 days ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 11 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak