Sciweavers

39 search results - page 6 / 8
» Provenance for nested subqueries
Sort
View
PVLDB
2008
113views more  PVLDB 2008»
13 years 5 months ago
Rewriting procedures for batched bindings
Queries, or calls to stored procedures/user-defined functions are often invoked multiple times, either from within a loop in an application program, or from the where/select claus...
Ravindra Guravannavar, S. Sudarshan
JMLR
2010
206views more  JMLR 2010»
13 years 2 months ago
Learning Translation Invariant Kernels for Classification
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...
Sayed Kamaledin Ghiasi Shirazi, Reza Safabakhsh, M...
ICDE
2005
IEEE
121views Database» more  ICDE 2005»
14 years 8 months ago
Full-fledged Algebraic XPath Processing in Natix
We present the first complete translation of XPath into an algebra, paving the way for a comprehensive, state-of-theart XPath (and later on, XQuery) compiler based on algebraic op...
Matthias Brantner, Sven Helmer, Carl-Christian Kan...
CSL
2004
Springer
14 years 25 days ago
Fixed Points of Type Constructors and Primitive Recursion
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
Andreas Abel, Ralph Matthes
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 9 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny