Sciweavers

1168 search results - page 107 / 234
» Optimization strategies for complex queries
Sort
View
ESWS
2008
Springer
14 years 11 months ago
Foundations of RDF Databases
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
Claudio Gutierrez
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 2 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
DLOG
2008
15 years 9 days ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 24 days ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
BNCOD
2006
55views Database» more  BNCOD 2006»
14 years 11 months ago
On the Optimal Ordering of Maps, Selections, and Joins Under Factorization
We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions i...
Thomas Neumann, Sven Helmer, Guido Moerkotte