Sciweavers

99 search results - page 5 / 20
» On the complexity of division and set joins in the relationa...
Sort
View
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
14 years 7 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
MFCS
2005
Springer
14 years 16 days ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
TCOS
2008
13 years 7 months ago
On Contemporary Denotational Mathematics for Computational Intelligence
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
Yingxu Wang
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
13 years 11 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
PARA
1995
Springer
13 years 10 months ago
A Proposal for a Set of Parallel Basic Linear Algebra Subprograms
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS. The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
Jaeyoung Choi, Jack Dongarra, Susan Ostrouchov, An...