Sciweavers

479 search results - page 71 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient provenance storage
Scientific workflow systems are increasingly used to automate complex data analyses, largely due to their benefits over traditional approaches for workflow design, optimization, a...
Adriane Chapman, H. V. Jagadish, Prakash Ramanan
BTW
2005
Springer
108views Database» more  BTW 2005»
14 years 2 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
FGCS
2000
81views more  FGCS 2000»
13 years 9 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
11 years 11 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
WWW
2008
ACM
14 years 10 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...