Sciweavers

777 search results - page 142 / 156
» Optimization of Relational Preference Queries
Sort
View
BTW
2009
Springer
132views Database» more  BTW 2009»
14 years 8 days ago
A Bayesian Approach to Estimating the Selectivity of Conjunctive Predicates
: Cost-based optimizers in relational databases make use of data statistics to estimate intermediate result cardinalities. Those cardinalities are needed to estimate access plan co...
M. Heimel, Volker Markl, Keshava Murthy
SAC
2006
ACM
14 years 1 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi
ICWN
2008
13 years 9 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...