Sciweavers

11862 search results - page 89 / 2373
» Relative information completeness
Sort
View
ICDT
2001
ACM
162views Database» more  ICDT 2001»
15 years 7 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
RTA
1993
Springer
15 years 7 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
Jordi Levy, Jaume Agustí-Cullell
COCOA
2009
Springer
15 years 7 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...
IMCSIT
2010
15 years 1 months ago
Quality Benchmarking Relational Databases and Lucene in the TREC4 Adhoc Task Environment
The present work covers a comparison of the text retrieval qualities of open source relational databases and Lucene, which is a full text search engine library, over English docume...
Ahmet Arslan, Ozgur Yilmazel
LICS
2008
IEEE
15 years 9 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat