Sciweavers

99 search results - page 2 / 20
» On the complexity of division and set joins in the relationa...
Sort
View
LICS
2000
IEEE
13 years 9 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 5 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
JCSS
2002
114views more  JCSS 2002»
13 years 5 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller
IEEEICCI
2009
IEEE
13 years 12 months ago
Interval sets and interval-set algebras
An interval set is an interval in the power set lattice based on a universal set and is a family of subsets of the universal set. Interval sets and interval-set algebras provide a...
Yiyu Yao
LCPC
2001
Springer
13 years 9 months ago
Strength Reduction of Integer Division and Modulo Operations
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behav...
Jeffrey Sheldon, Walter Lee, Ben Greenwald, Saman ...