Sciweavers

3305 search results - page 83 / 661
» Can we Rely on SQL
Sort
View
VLDB
2004
ACM
93views Database» more  VLDB 2004»
14 years 1 months ago
Symmetric Relations and Cardinality-Bounded Multisets in Database Systems
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
Kenneth A. Ross, Julia Stoyanovich
DBPL
1993
Springer
141views Database» more  DBPL 1993»
13 years 11 months ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
ADBIS
2009
Springer
140views Database» more  ADBIS 2009»
14 years 2 months ago
Optimizing Maintenance of Constraint-Based Database Caches
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
Joachim Klein 0002, Susanne Braun
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
13 years 11 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
ICISC
2007
75views Cryptology» more  ICISC 2007»
13 years 9 months ago
Cryptanalysis of a Hash Function Proposed at ICISC 2006
A simple method for constructing collisions for Shpilrain’s polynomial-based hash function from ICISC 2006 is presented. The attack relies on elementary linear algebra and can be...
Willi Geiselmann, Rainer Steinwandt