Sciweavers

ICDT
2001
ACM
189views Database» more  ICDT 2001»
13 years 10 months ago
A Semi-monad for Semi-structured Data
This document proposes an algebra for XML Query. The algebra has been submitted to the W3C XML Query Working Group. A novel feature of the algebra is the use of regular-expression ...
Mary F. Fernández, Jérôme Sim&...
ICDT
2001
ACM
162views Database» more  ICDT 2001»
13 years 10 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo
ICDT
2001
ACM
153views Database» more  ICDT 2001»
13 years 10 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 10 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
ICDT
2001
ACM
131views Database» more  ICDT 2001»
13 years 10 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
Database
Top of PageReset Settings