Sciweavers

796 search results - page 100 / 160
» A Formalization of ODMG Queries
Sort
View
PEPM
2010
ACM
16 years 2 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
ICDE
2005
IEEE
113views Database» more  ICDE 2005»
16 years 7 months ago
On the Optimal Ordering of Maps and Selections under Factorization
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
Thomas Neumann, Sven Helmer, Guido Moerkotte
WWW
2008
ACM
16 years 6 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, ...
PODS
2004
ACM
147views Database» more  PODS 2004»
16 years 6 months ago
Flexible Time Management in Data Stream Systems
Continuous queries in a Data Stream Management System (DSMS) rely on time as a basis for windows on streams and for defining a consistent semantics for multiple streams and updata...
Utkarsh Srivastava, Jennifer Widom
DEXAW
2007
IEEE
137views Database» more  DEXAW 2007»
16 years 12 days ago
FCA for contextual semantic navigation and information retrieval in heterogeneous information systems
This paper presents an information retrieval methodology which uses Formal Concept Analysis in conjunction with semantics to provide contextual answers to users’ queries. User f...
Géraldine Polaillon, Marie-Aude Aufaure, B&...