Sciweavers

569 search results - page 75 / 114
» acm 1995
Sort
View
VLDB
1995
ACM
97views Database» more  VLDB 1995»
13 years 11 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
OOPSLA
1995
Springer
13 years 11 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
13 years 11 months ago
Discovery and Maintenance of Functional Dependencies by Independencies
For semantic query optimization one needs detailed knowledgeabout the contents of the database. Traditional techniquesuse static knowledgeabout all possible states of the database...
Siegfried Bell
SIGCOMM
1995
ACM
13 years 11 months ago
Performance Analysis of MD5
MD5 is an authentication algorithm proposed as the required implementation of the authentication option in IPv6. This paper presents an analysis of the speed at which MD5 can be i...
Joseph D. Touch
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 11 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner