Sciweavers

376 search results - page 21 / 76
» Semantics and Evaluation of Top-k Queries in Probabilistic D...
Sort
View
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 7 months ago
Query Evaluation and Optimization in the Semantic Web
We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology...
Edna Ruckhaus, Eduardo Ruiz, Maria-Esther Vidal
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 8 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 8 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 2 months ago
Containment of Conjunctive Queries over Databases with Null Values
Abstract. We study containment of conjunctive queries that are evaluated over databases that may contain tuples with null values. We assume the semantics of SQL for single block qu...
Carles Farré, Werner Nutt, Ernest Teniente,...
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 8 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