Sciweavers

777 search results - page 81 / 156
» Optimization of Relational Preference Queries
Sort
View
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 10 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
VLDB
1998
ACM
180views Database» more  VLDB 1998»
14 years 2 months ago
nD-SQL: A Multi-Dimensional Language for Interoperability and OLAP
We propose a multi-dimensional language called nD-SQL with the following features: (i) nD-SQL supports queries that interoperate amongst multiple relational sources with heterogen...
Frédéric Gingras, Laks V. S. Lakshma...
IBPRIA
2009
Springer
14 years 2 months ago
Inference and Learning for Active Sensing, Experimental Design and Control
In this paper we argue that maximum expected utility is a suitable framework for modeling a broad range of decision problems arising in pattern recognition and related fields. Exa...
Hendrik Kück, Matthew Hoffman, Arnaud Doucet,...
VLDB
1989
ACM
88views Database» more  VLDB 1989»
14 years 2 months ago
Estimating the Size of Generalized Transitive Closures
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
Richard J. Lipton, Jeffrey F. Naughton
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 5 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch