Sciweavers

619 search results - page 12 / 124
» Query Planning in Infomaster
Sort
View
144
Voted
EDBT
2012
ACM
247views Database» more  EDBT 2012»
13 years 4 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
16 years 2 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton
ICDT
1999
ACM
97views Database» more  ICDT 1999»
15 years 6 months ago
Optimizing Large Join Queries in Mediation Systems
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector...
108
Voted
XIMEP
2004
ACM
88views Database» more  XIMEP 2004»
15 years 7 months ago
XQuery Processing in Natix with an Emphasis on Join Ordering
We give an overview on how XQuery processing works in our native XML database system Natix. After a brief description of the query compiler we focus on the aspect of join ordering...
Norman May, Sven Helmer, Carl-Christian Kanne, Gui...