Sciweavers

77 search results - page 7 / 16
» Foundations of SPARQL Query Optimization
Sort
View
AI
2010
Springer
13 years 10 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ADC
2005
Springer
114views Database» more  ADC 2005»
14 years 3 months ago
Optimization of Relational Preference Queries
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good cho...
Bernd Hafenrichter, Werner Kießling
DBPL
2001
Springer
115views Database» more  DBPL 2001»
14 years 2 months ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen
COMPGEOM
2010
ACM
14 years 2 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
EDBTW
2006
Springer
14 years 1 months ago
Dynamic Plan Migration for Snapshot-Equivalent Continuous Queries in Data Stream Systems
A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially install...
Jürgen Krämer, Yin Yang, Michael Cammert...