Sciweavers

342 search results - page 11 / 69
» Conjunctive Queries over Trees
Sort
View
EDBT
2006
ACM
136views Database» more  EDBT 2006»
14 years 7 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
LICS
2005
IEEE
14 years 1 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 7 months ago
On Spatial Conjunction as Second-Order Logic
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
Viktor Kuncak, Martin C. Rinard
VLDB
2000
ACM
151views Database» more  VLDB 2000»
13 years 11 months ago
The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
BTW
2009
Springer
132views Database» more  BTW 2009»
14 years 11 days ago
A Bayesian Approach to Estimating the Selectivity of Conjunctive Predicates
: Cost-based optimizers in relational databases make use of data statistics to estimate intermediate result cardinalities. Those cardinalities are needed to estimate access plan co...
M. Heimel, Volker Markl, Keshava Murthy